1,721,608 research outputs found
HASIL CROSS PRODUCT DARI DUA GRAF-K
Full text linkArtikel ini membahas tentang hasil cross product dari dua graf-k. Dalam penelitian ini dibahas mengenai struktur dari graf-k, yang terdiri dari kategori dan fungtor yang memenuhi sifat faktorisasi. Selanjutnya dibahas bagaimana hasil cross product dari dua graf-k, yang mencangkup produk kategori dan fungtor untuk produk kategori tersebut. Lalu diberikan ilustrasi bagaimana membentuk graf-(k_1+k_2) dari dua graf-k yang berbeda, yaitu graf-k_1 dan graf-k_2.
Kata kunci : Kategori, fungtor, graf-k, kategori produk, fungtor untuk kategori produk, cross product.
This article discusses results of cross product of two k-graphs. This study discusses the structure of the k-graphs, which consists of category and functor that satisfying the factorisation property. Furthermore, this thesis discussed the cross product results from two k-graphs, which includes product category and functor for that product category. Then an illustration is given on how to form a (k_1+ k_2)-graph from two different k-graphs, namely k_1-graph and k_2-graph.
Keywords : Category, functor, k-graph, product category, functor for product category, cross product
Properti Eigen Untuk Graf k-Regular Tak Terhubung
No full textAbstract. (eigen properties of non-connected k-regular graph) One of the important properties of an adjacency matrix as a representation of a graph is its eigen property. According to Biggs, a k-regular connected graph will have k as one of its Eigen value and the multiplicity is 1. Here, we investigate the Eigen value and its multiplicity of a non-connected
k-regular graph. The result shows if a non-connected k-regular graph has c components, then will be one of its eigen value with the geometric multiplicity of c.
Keywords: adjacency matrix, eigen values, geometric multiplicity
Abstrak. Salah satu sifat penting dari matriks adjasen sebagai representasi dari graf adalah sifat eigennya. Biggs menyatakan bahwa graf regular terhubung dengan derajat k akan memiliki nilai eigen k yang multiplisitasnya satu. Di sini diselidiki nilai eigen untuk graf k-regular yang tak terhubung. Jika graf k-regular tak terhubung memiliki c buah komponen, maka k akan menjadi salah satu nilai eigen graf tersebut dengan multiplisitas geometri c.
Kata kunci: matriks adjasen, nilai eigen, multiplisitas geometr
DIMENSI METRIK GRAF AMALGAMASI GRAF k-THETA
Full text linkMisalkan G = (V, E) adalah graf terhubung, dengan V (G) adalah himpunan titik dan E(G) himpunan sisi. Jarak antara dua titik u dan v didefinisikan sebagai panjang lintasan terpendek dari titik u ke v di G, dinotasikan d(u, v). Jika diberikan suatu himpunan terurut W = {w1, w2,· · · , wk} ⊆ V (G), maka representasi titik v terhadap W adalah r(v|W ) = (d(v, w1), d(v, w2),· · · , d(v, wk)). Jika r(v|W ) untuk setiap titik v ∈ V (G) berbeda, maka W disebut himpunan pembeda. Kardinalitas minimum dari himpunan pembeda disebut dimensi metrik dari G, yang dinotasikan dim(G). Pada artikel ini akan dibahas dimensi metrik pada graf Graf k-Theta, dinotasikan Θ(n, k) dengan n ≥ 3 dan k ≥ 4 dan Graf R, dinotasikan Amal(mΘ(n, k)) dengan m ≥ 2,n ≥ 3 dan k ≥
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
ALJABAR KUMJIAN-PASK DARI GRAF-k BERHINGGA BARIS TANPA SOURCES
Full text linkDiberikan suatu graf-k berhingga baris tanpa sources � dan suatu ring
komutatif R dengan unsur kesatuan. Aljabar Kumjian-Pask KPR(�) dide�nisikan
sebagai aljabar-R universal yang analog dengan aljabar graf C�(�). Untuk
setiap � yang diberikan, dapat dikonstruksi aljabar Kumjian-Pask KPR(�)
sebagai kuosien dari aljabar-R bebas pada X = �0 [ �6=0 [ G(�6=0) modulo
ideal I yang dibangun oleh suatu himpunan sedemikian sehingga memenuhi
relasi Kumjian-Pask.,---Given a row-�nite k-graph without sources � and a unital commutative
ring R. Kumjian-Pask algebra KPR(�) is a universal R-algebra analogous with
the graph algebra C�(�). For every given �, we can construct a Kumjian-Pask
algebra KPR(�) as a quotient of free R-algebra on X = �0 [ �6=0 [ G(�6=0)
modulo ideal I generated by a set such that the ideal satis�ed Kumjian-Pask
relations
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
