发布求助
文献互助 智能选刊 最新文献

Acta Universitatis Sapientiae Informatica最新文献

筛选
英文 中文
Computing Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs 计算图的拉普拉斯能量、类拉普拉斯能量不变量和Kirchhoff指数
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-12-01 DOI: 10.2478/ausi-2022-0011
S. Bhatnagar, Merajuddin, S. Pirzada
{"title":"Computing Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs","authors":"S. Bhatnagar, Merajuddin, S. Pirzada","doi":"10.2478/ausi-2022-0011","DOIUrl":"https://doi.org/10.2478/ausi-2022-0011","url":null,"abstract":"Abstract Let G be a simple connected graph of order n and size m. The matrix L(G)= D(G)− A(G) is called the Laplacian matrix of the graph G,where D(G) and A(G) are the degree diagonal matrix and the adjacency matrix, respectively. Let the vertex degree sequence be d1 ≥ d2 ≥··· ≥ dn and let μ1 ≥ μ2 ≥··· ≥ μn−1 >μn = 0 be the eigenvalues of the Laplacian matrix of G. The graph invariants, Laplacian energy (LE), the Laplacian-energy-like invariant (LEL) and the Kirchhoff index (Kf), are defined in terms of the Laplacian eigenvalues of graph G, as LE=∑i=1n| μi-2mn | LE = sumnolimits_{i = 1}^n {left| {{mu _i} - {{2m} over n}} right|} , LEL=∑i=1n-1μi LEL = sumnolimits_{i = 1}^{n - 1} {sqrt {{mu _i}} } and Kf=n∑i=1n-11μi Kf = nsumnolimits_{i = 1}^{n - 1} {{1 over {{mu _i}}}} respectively. In this paper, we obtain a new bound for the Laplacian-energy-like invariant LEL and establish the relations between Laplacian-energy-like invariant LEL and the Kirchhoff index Kf.Further,weobtain the relations between the Laplacian energy LE and Kirchhoff index Kf.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"49 1","pages":"185 - 198"},"PeriodicalIF":0.3,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83661878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Some new results on colour-induced signed graphs 关于颜色诱导符号图的一些新结果
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-12-01 DOI: 10.2478/ausi-2022-0019
Niranjana Sudheer, Ann Cherian George, Achu Aniyan, S. Naduvath
{"title":"Some new results on colour-induced signed graphs","authors":"Niranjana Sudheer, Ann Cherian George, Achu Aniyan, S. Naduvath","doi":"10.2478/ausi-2022-0019","DOIUrl":"https://doi.org/10.2478/ausi-2022-0019","url":null,"abstract":"Abstract A signed graph is a graph in which positive or negative signs are assigned to its edges. We consider equitable colouring and Hamiltonian colouring to obtain induced signed graphs. An equitable colour-induced signed graph is a signed graph constructed from a given graph in which each edge uv receives a sign (−1)|c(v)−c(u)|,where c is an equitable colouring of vertex v. A Hamiltonian colour-induced signed graph is a signed graph obtained from a graph G in which for each edge e = uv, the signature function σ(uv)=(−1)|c(v)−c(u)|, gives a sign such that, |c(u)− c(v)| ≥ n − 1 − D(u, v) where c is a function that assigns a colour to each vertex satisfying the given condition. This paper discusses the properties and characteristics of signed graphs induced by the equitable and Hamiltonian colouring of graphs.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"1 1","pages":"338 - 353"},"PeriodicalIF":0.3,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90114532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Transmission-reciprocal transmission index and coindex of graphs 传输-互反传输指数和图的协指数
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-08-01 DOI: 10.2478/ausi-2022-0006
H. Ramane, Deepa V. Kitturmath, Kavita Bhajantri
{"title":"Transmission-reciprocal transmission index and coindex of graphs","authors":"H. Ramane, Deepa V. Kitturmath, Kavita Bhajantri","doi":"10.2478/ausi-2022-0006","DOIUrl":"https://doi.org/10.2478/ausi-2022-0006","url":null,"abstract":"Abstract The transmission of a vertex u in a connected graph G is defined as σ(u) = Σv∈V(G) d(u, v) and reciprocal transmission of a vertex u is defined as rs(u)=∑v∈V(G)1d(u,v) rs(u) = sumnolimits_{v in Vleft( G right)} {{1 over {dleft( {u,v} right)}}} , where d(u, v) is the distance between vertex u and v in G. In this paper we define new distance based topological index of a connected graph G called transmission-reciprocal transmission index TRT(G)=∑uv∈E(G)(σ(u)rs(u)+σ(v)rs(v)) TRTleft( G right) = sumnolimits_{uv in Eleft( G right)} {left( {{{sigma left( u right)} over {rsleft( u right)}} + {{sigma left( v right)} over {rsleft( v right)}}} right)} and its coindex TRT¯(G)=∑uv∉E(G)(σ(u)rs(u)+σ(v)rs(v)) overline {TRT} left( G right) = sumnolimits_{uv notin Eleft( G right)} {left( {{{sigma left( u right)} over {rsleft( u right)}} + {{sigma left( v right)} over {rsleft( v right)}}} right)} , where E(G) is the edge set of a graph G and establish the relation between TRT(G) and TRT¯(G) overline {TRT} left( G right) (G). Further compute this index for some standard class of graphs and obtain bounds for it.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"8 1","pages":"84 - 103"},"PeriodicalIF":0.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87100230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Limit laws for two distance-based indices in random recursive tree models 随机递归树模型中两个基于距离的索引的极限律
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-08-01 DOI: 10.2478/ausi-2022-0003
S. Naderi, R. Kazemi, M. Behzadi
{"title":"Limit laws for two distance-based indices in random recursive tree models","authors":"S. Naderi, R. Kazemi, M. Behzadi","doi":"10.2478/ausi-2022-0003","DOIUrl":"https://doi.org/10.2478/ausi-2022-0003","url":null,"abstract":"Abstract In this paper, we derive several results related to total path length and Sackin index in two classes of random recursive trees. A limiting distribution of the normalized version of the Sackin index is given by the contraction method in random recursive trees. Also, we show the normalized total path length converges in L2 and almost surely to a limiting random variable in plane-oriented recursive trees via martingales.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"1 1","pages":"35 - 48"},"PeriodicalIF":0.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90236970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Signless Laplacian energy of a first KCD matrix 第一KCD矩阵的无符号拉普拉斯能量
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-08-01 DOI: 10.2478/ausi-2022-0002
K. G. Mirajkar, A. Morajkar
{"title":"Signless Laplacian energy of a first KCD matrix","authors":"K. G. Mirajkar, A. Morajkar","doi":"10.2478/ausi-2022-0002","DOIUrl":"https://doi.org/10.2478/ausi-2022-0002","url":null,"abstract":"Abstract The concept of first KCD signless Laplacian energy is initiated in this article. Moreover, we determine first KCD signless Laplacian spectrum and first KCD signless Laplacian energy for some class of graphs and their complement.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"76 1","pages":"22 - 34"},"PeriodicalIF":0.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83191156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Using the Bag-of-Audio-Words approach for emotion recognition 使用音频词袋方法进行情绪识别
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-08-01 DOI: 10.2478/ausi-2022-0001
Mercedes Vetráb, G. Gosztolya
{"title":"Using the Bag-of-Audio-Words approach for emotion recognition","authors":"Mercedes Vetráb, G. Gosztolya","doi":"10.2478/ausi-2022-0001","DOIUrl":"https://doi.org/10.2478/ausi-2022-0001","url":null,"abstract":"Abstract The problem of varying length recordings is a well-known issue in paralinguistics. We investigated how to resolve this problem using the bag-of-audio-words feature extraction approach. The steps of this technique involve preprocessing, clustering, quantization and normalization. The bag-of-audio-words technique is competitive in the area of speech emotion recognition, but the method has several parameters that need to be precisely tuned for good efficiency. The main aim of our study was to analyse the effectiveness of bag-of-audio-words method and try to find the best parameter values for emotion recognition. We optimized the parameters one-by-one, but built on the results of each other. We performed the feature extraction, using openSMILE. Next we transformed our features into same-sized vectors with openXBOW, and finally trained and evaluated SVM models with 10-fold-crossvalidation and UAR. In our experiments, we worked with a Hungarian emotion database. According to our results, the emotion classification performance improves with the bag-of-audio-words feature representation. Not all the BoAW parameters have the optimal settings but later we can make clear recommendations on how to set bag-of-audio-words parameters for emotion detection tasks.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"1 1","pages":"1 - 21"},"PeriodicalIF":0.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83600793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Annihilator graphs of a commutative semigroup whose Zero-divisor graphs are a complete graph with an end vertex 交换半群的湮灭子图，其零因子图是一个有端点的完全图
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-08-01 DOI: 10.2478/ausi-2022-0008
Seyed Mohammad Sakhdari, M. Afkhami
{"title":"Annihilator graphs of a commutative semigroup whose Zero-divisor graphs are a complete graph with an end vertex","authors":"Seyed Mohammad Sakhdari, M. Afkhami","doi":"10.2478/ausi-2022-0008","DOIUrl":"https://doi.org/10.2478/ausi-2022-0008","url":null,"abstract":"Abstract Suppose that the zero-divisor graph of a commutative semi-group S, be a complete graph with an end vertex. In this paper, we determine the structure of the annihilator graph S and we show that if Z(S)= S, then the annihilator graph S is a disconnected graph.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"1 1","pages":"119 - 136"},"PeriodicalIF":0.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91042708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
U-Net architecture variants for brain tumor segmentation of histogram corrected images U-Net结构变体对直方图校正图像的脑肿瘤分割
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-08-01 DOI: 10.2478/ausi-2022-0004
Szidónia Lefkovits, László Lefkovits
{"title":"U-Net architecture variants for brain tumor segmentation of histogram corrected images","authors":"Szidónia Lefkovits, László Lefkovits","doi":"10.2478/ausi-2022-0004","DOIUrl":"https://doi.org/10.2478/ausi-2022-0004","url":null,"abstract":"Abstract In this paper we propose to create an end-to-end brain tumor segmentation system that applies three variants of the well-known U-Net convolutional neural networks. In our results we obtain and analyse the detection performances of U-Net, VGG16-UNet and ResNet-UNet on the BraTS2020 training dataset. Further, we inspect the behavior of the ensemble model obtained as the weighted response of the three CNN models. We introduce essential preprocessing and post-processing steps so as to improve the detection performances. The original images were corrected and the different intensity ranges were transformed into the 8-bit grayscale domain to uniformize the tissue intensities, while preserving the original histogram shapes. For post-processing we apply region connectedness onto the whole tumor and conversion of background pixels into necrosis inside the whole tumor. As a result, we present the Dice scores of our system obtained for WT (whole tumor), TC (tumor core) and ET (enhanced tumor) on the BraTS2020 training dataset.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"25 1","pages":"49 - 74"},"PeriodicalIF":0.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73902668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On graphs associated to ring of Guassian integers and ring of integers modulo n 论与高斯整数环和以n为模的整数环有关的图
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-08-01 DOI: 10.2478/ausi-2022-0005
S. Pirzada, M. Bhat
{"title":"On graphs associated to ring of Guassian integers and ring of integers modulo n","authors":"S. Pirzada, M. Bhat","doi":"10.2478/ausi-2022-0005","DOIUrl":"https://doi.org/10.2478/ausi-2022-0005","url":null,"abstract":"Abstract For a commutative ring R with identity 1, the zero-divisor graph of R, denoted by Γ(R), is a simple graph whose vertex set is the set of non-zero zero divisors Z*(R) and the two vertices x and y ∈ Z*(R) are adjacent if and only if xy = 0. In this paper, we compute the values of some graph parameters of the zero-divisor graph associated to the ring of Gaussian integers modulo n, ℤn[i] and the ring of integers modulo n, ℤn.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"24 1","pages":"75 - 83"},"PeriodicalIF":0.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74549877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Seidel Laplacian matrix and energy of graphs 论Seidel拉普拉斯矩阵与图的能量
IF 0.3
Acta Universitatis Sapientiae Informatica Pub Date : 2022-08-01 DOI: 10.2478/ausi-2022-0007
N. Yalçın
{"title":"On Seidel Laplacian matrix and energy of graphs","authors":"N. Yalçın","doi":"10.2478/ausi-2022-0007","DOIUrl":"https://doi.org/10.2478/ausi-2022-0007","url":null,"abstract":"Abstract In this work, the Seidel Laplacian spectrum of graphs are determined. Then new bounds are presented for the Seidel Laplacian energy of regular graphs and graphs by using their Seidel Laplacian spectrum and other techniques. Further, the Seidel Laplacian energy of specific graphs are computed.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"3 1","pages":"104 - 118"},"PeriodicalIF":0.3,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89588571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信