Iskanje po katalogu digitalne knjižnice

Opis: For a set ▫$X$▫ of binary words of length ▫$h$▫ the daisy cube ▫$Q_h(X)$▫ is defined as the subgraph of the hypercube ▫$Q_h$▫ induced by the set of all vertices on shortest paths that connect vertices of ▫$X$▫ with the vertex ▫$0^h$▫. A vertex in the intersection of all of these paths is a minimal vertex of a daisy cube. A graph ▫$G$▫ isomorphic to a daisy cube admits several isometric embeddings into a hypercube. We show that an isometric embedding is proper if and only if the label ▫$0^h$▫ is assigned to a minimal vertex of ▫$G$▫. This result allows us to devise an algorithm which finds a proper embedding of a graph isomorphic to a daisy cube into a hypercube in linear time.
Ključne besede: daisy cube, partial cube, isometric embedding, proper embedding
Objavljeno v DKUM: 29.11.2024; Ogledov: 0; Prenosov: 3
Celotno besedilo (293,91 KB)
Gradivo ima več datotek! Več...

Opis: Software evolution is driven by changes made during software development and maintenance. While source control systems effectively manage these changes at the commit level, the intent behind them are often inadequately documented, making understanding their rationale challenging. Existing commit intent classification approaches, largely reliant on commit messages, only partially capture the underlying intent, predominantly due to the messages’ inadequate content and neglect of the semantic nuances in code changes. This paper presents a novel method for extracting semantic features from commits based on modifications in the source code, where each commit is represented by one or more fine-grained conjoint code changes, e.g., file-level or hunk-level changes. To address the unstructured nature of code, the method leverages a pre-trained transformer-based code model, further trained through task-adaptive pre-training and fine-tuning on the downstream task of intent classification. This fine-tuned task-adapted pre-trained code model is then utilized to embed fine-grained conjoint changes in a commit, which are aggregated into a unified commit-level vector representation. The proposed method was evaluated using two BERT-based code models, i.e., CodeBERT and GraphCodeBERT, and various aggregation techniques on data from open-source Java software projects. The results show that the proposed method can be used to effectively extract commit embeddings as features for commit intent classification and outperform current state-of-the-art methods of code commit representation for intent categorization in terms of software maintenance activities undertaken by commits.
Ključne besede: software maintenance, code commit, mining software repositories, adaptive pre-training, fine-tuning, semantic code embedding, CodeBERT, GraphCodeBERT, classification, code intelligence
Objavljeno v DKUM: 14.08.2024; Ogledov: 87; Prenosov: 13
Celotno besedilo (1,65 MB)

Opis: Predstavljen je algoritem časovno linearne zahtevnosti, ki na izometričen način vloži dano drevo ▫$T$▫ v celoštevilsko mrežo najmanjše možne dimenzije in omogoča izračun mrežnih koordinat vozlišč drevesa ▫$T$▫ v optimalnem času.
Ključne besede: matematika, teorija grafov, drevo, izometrična vložitev, mrežna vložitev, delna kocka, mathematics, graph theory, lattice embedding, isometric embedding, partial cube, tree
Objavljeno v DKUM: 10.07.2015; Ogledov: 1003; Prenosov: 168
Povezava na celotno besedilo

Opis: Partial cubes are graphs isometrically embeddable into hypercubes. Three infinite families and a few sporadic examples of cubic partial cubes are known. The concept of a tribe is introduced as means to systematize the known examples and establish relations among them. Efficient methods of computation of tribes are developed and several concrete tribes, that include known, as well as new cubic partial cubes, are computed by hand and with the use of a computer.
Ključne besede: mathematics, graph theory, partial cube, hypercube, isometric embedding, tribe, algorithm
Objavljeno v DKUM: 10.07.2015; Ogledov: 1088; Prenosov: 182
Celotno besedilo (688,41 KB)
Gradivo ima več datotek! Več...

Ključne besede: matematika, teorija grafov, izometrična vložitev, delni Hammingovi grafi, mathematics, graph theory, isometric embedding, partial Hamming graphs
Objavljeno v DKUM: 10.07.2015; Ogledov: 1929; Prenosov: 46
Povezava na celotno besedilo