Results 31 to 40 of about 4,837,596 (345)
Algebraic structures and distance based analysis of genetic code [PDF]
Network Biology, 2023 This paper explores the genetic code's algebraic structures associated with the four mRNA (or DNA) bases A, G, C, and U. We have obtained quotient group structures of codons by considering the transition and substitution mutation. In these quotient group
Chandra Borah, Tazid Ali
doaj
Use of Dynamic Time Warping for Description of Combustion Process in a Biomass Boiler
Acta Technologica Agriculturae, 2022 The efficient biomass energy use is a key prerequisite for the implementation of renewable energy development strategies on a regional level. For the highly efficient energy use in the combustion process, it is necessary to properly regulate the process ...
Kucín Martin +3 more
doaj +1 more source
Distance (signless) Laplacian spectrum of dumbbell graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we determine the distance Laplacian and distance signless Laplacian spectrum of generalized wheel graphs and a new class of graphs called dumbbell graphs.
Sakthidevi Kaliyaperumal +1 more
doaj +1 more source
Localization From Incomplete Euclidean Distance Matrix: Performance Analysis for the SVD–MDS Approach [PDF]
IEEE Transactions on Signal Processing, 2018 Localizing a cloud of points from noisy measurements of a subset of pairwise distances has applications in various areas, such as sensor network localization and reconstruction of protein conformations from nuclear magnetic resonance measurements ...
Huan Zhang, Yulong Liu, Hong Lei
semanticscholar +1 more source
Stress of a graph and its computation
AKCE International Journal of Graphs and Combinatorics, 2023 Stress is a centrality measure determined by the shortest paths passing through the given vertex. Noting that adjacency matrix playing an important role in finding the distance and the number of shortest paths between given pair of vertices, an ...
Raksha Poojary +3 more
doaj +1 more source
Max–min distance nonnegative matrix factorization
Neural Networks, 2015 Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples.
Wang, Jim Jing-Yan, Gao, Xin
openaire +3 more sources
Application of Floyd's Algorithm on Transport Network of South Bohemian Region
Communications, 2016 The introductory part of the paper deals with the theory of searching for optimal routes in transport networks, including a description of each type of optimization tasks. The aim of the article is demonstration of Floyd algorithm application to find the
Jiri Hanzl +3 more
doaj +1 more source
Occluded Joints Recovery in 3D Human Pose Estimation based on Distance Matrix [PDF]
International Conference on Pattern Recognition, 2018 Albeit the recent progress in single image 3D human pose estimation due to the convolutional neural network, it is still challenging to handle real scenarios such as highly occluded scenes. In this paper, we propose to address the problem of single image
Xiang Guo, Yuchao Dai
semanticscholar +1 more source
Determining finite connected graphs along the quadratic embedding constants of paths
Electronic Journal of Graph Theory and Applications, 2021 The QE constant of a finite connected graph G, denoted by QEC(G), is by definition the maximum of the quadratic function associated to the distance matrix on a certain sphere of codimension two.
Edy Tri Baskoro, Nobuaki Obata
doaj +1 more source
The bipartite Laplacian matrix of a nonsingular tree
Special Matrices, 2023 For a bipartite graph, the complete adjacency matrix is not necessary to display its adjacency information. In 1985, Godsil used a smaller size matrix to represent this, known as the bipartite adjacency matrix.
Bapat Ravindra B. +2 more
doaj +1 more source