Preprinti (MII) / Preprints

Permanent URI for this collection

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

Browse

Browsing Preprinti (MII) / Preprints by Title

Now showing 1 - 12 of 12
  • Thumbnail Image
    Item
  • Thumbnail Image
    Item
    About Correctness of Graph-Based Social Network Analysis
    (2017-07-24) Opmanis, Mārtiņš
    Social network analysis widely uses graph techniques. Together with correct applications, in some cases, results are obtained from the graphs using paths longer than one, and due to intransitivity of relationships, several metrics and results are not applicable backward to objects in the investigated domain in a meaningful way. The author provides several examples and tries to recover roots of an incorrect application of graphs.
  • Thumbnail Image
    Item
    Fragile Correctness of Social Network Analysis
    (2016-11-07) Opmanis, Mārtiņš
    Graph techniques are widely used in social network analysis. However, there are some disputable applications where results are obtained from the graphs using paths longer than one and are not simply applicable to objects in the initial domain. The author provides several examples of such usages and tries to recover roots of an incorrect application of graphs.
  • 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
    On building 4-critical plane and projective plane multiwheels from odd wheels
    (2013-01-31) Zeps, Dainis
    We build unbounded classes of plane and projective plane multiwheels that are 4-critical that are received summing odd wheels as edge sums modulo two. These classes can be considered as ascending from a single common graph that can be received as an edge sum modulo two of the octahedron graph O and the minimal wheel W_3. All graphs of these classes belong to 2n-2-edges-class of graphs, among which are those that quadrangulate projective plane, i.e., graphs from the Grötzsch class received applying Mycielski's Construction to an odd cycle.
  • Thumbnail Image
    Item
    ON CYCLE INVARIANT
    (2013-04-23) Zeps, Dainis
    Taking the programming paradigm with the cycle invariant as a base notion there for a ground cycle paradigm, in a more general setting here these things are considered. Epistemological aspects with reference to Rene Descartes methods of reasoning are considered. Particularly analogy between Descartes method of specification and top-down programming is considered. A general principle of reconstruction in epistemology is suggested and discussed, firstly specifying it within programming and then trying it to generalize to whatever else. Submitted as a paper in philosophy for doctoral studies.
  • Thumbnail Image
    Item
    On Grinbergs' differential geometry and finite fields
    (2019-03-27) Zeps, Dainis
    Emanuels Grinbergs, in his youth, during ten years, from 1933 until 1943, wrote three dissertations on one subject, namely, differential geometry [1, 2, 3]. We think that his work in this direction has been neglected for many years, and it is the last time to try to understand the significance of these works. Here, in this short article we touch only one aspect of this work, and compare and put together two approaches, one from thesis of Grinbergs [3], and another, of the author's, [5, 6], where we show close relation between both.
  • 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.
  • Thumbnail Image
    Item
    A systematic review of SQL-on-Hadoop by using compact data formats
    (2016-10-30) Plase, Daiga
    There are huge volumes of raw data generated every day. The question is how to store these data in order to provide faster data access. The research direction in Big Data projects using Hadoop Technology, MapReduce kind of framework and compact data formats shows that two data formats (Avro and Parquet) support schema evolution and compression in order to utilize less storage space. In this paper, a systematic review of SQL-on-Hadoop by using Avro and Parquet has been performed over the past six years (2010–2015) using publications of conference proceedings and journals of IEEEXplore, ACM Digital Library, ScienceDirect. With the help of search strategy followed, 94 research papers have been identified out of which 17 have been analyzed as relevant papers. At the end, the conclusion has been made that direct comparison by compactness and fastness between Avro and Parquet do not exist in data science.
  • Thumbnail Image
    Item
    Testing 4-critical plane and projective plane multiwheels using Mathematica
    (2015-10-27) Zeps, Dainis
    In this article we explore 4-critical graphs using Mathematica. We generate graph patterns according [1, D. Zeps. On building 4-critical plane and projective plane multiwheels from odd wheels, arXiv:1202.4862v1]. Using the base graph, minimal planar multiwheel and in the same time minimal according projective pattern built multiwheel, we build minimal multiwheels according [1], Weforward two conjectures according graphs augmented according considered patterns and their 4-criticallity, and argue them to be proved here if the paradigmatic examples of this article are accepted to be parts of proofs.
  • No Thumbnail Available
    Item
    Using 2-colorings in the theory of uniquely Hamiltonian graphs
    (2019-02) Zeps, Dainis;
    We use the concept of 2-coloring in analyzing UH3 graphs and building exact specifications of functions to find new UH3 graphs by Hamiltonian cycle edge extractions