Results 21 to 30 of about 1,595,142 (164)
On the distance energy of k-uniform hypergraphs
In this article, we extend the concept of distance energy for hypergraphs. We first establish a relation between the distance energy and the distance spectral radius.
Sharma Kshitij, Panda Swarup Kumar
doaj +1 more source
The university is currently involved in complex processes of open innovation through permanent dialogue with institutions and companies in the economic, social, and political fields. Professors, researchers, students, and other members of the institution
José Gómez-Galán +3 more
doaj +1 more source
Approximation Algorithm for N-distance Minimal Vertex Cover Problem
Evolution of large scale networks demand for efficient way of communication in the networks. One way to propagate information in the network is to find vertex cover. In this paper we describe a variant of vertex cover problem naming it N-distance Vertex Minimal Cover(N-MVC) Problem to optimize information propagation throughout the network.
Tarun Yadav +2 more
openaire +2 more sources
An IoT-Based Traceability System for Greenhouse Seedling Crops
This paper presents the design of the Internet of Things (IoT)-based greenhouse traceability model for the tracking and recordkeeping of seedlings and other agricultural products in the germination and growth stages. Traced products are generally of high
Carlos Andres Gonzalez-Amarillo +6 more
doaj +1 more source
This review offers a comprehensive examination of the development and current state of the art in the field of molecularly imprinted polymer (MIP)-based colorimetric sensors, focusing on their potential for the rapid detection of organic compounds. These
Juan Carlos Bravo-Yagüe +4 more
doaj +1 more source
Event–Based Feedforward Control of Linear Systems with input Time–Delay
This paper proposes a new method for the analysis of continuous and periodic event-based state-feedback plus static feed-forward controllers that regulate linear time invariant systems with time delays.
Rodríguez Carlos +4 more
doaj +1 more source
Monophonic Distance Laplacian Energy of Transformation Graphs Sn^++-,Sn^{+-+},Sn^{+++}
Let $G$ be a simple connected graph of order $n$, $v_{i}$ its vertex. Let $\delta^{L}_{1}, \delta^{L}_{2}, \ldots, \delta^{L}_{n}$ be the eigenvalues of the distance Laplacian matrix $D^{L}$ of $G$. The distance Laplacian energy is denoted by $LE_{D}(G)$.
Diana R, Binu Selin T
doaj +1 more source
Testing for independence plays a fundamental role in many statistical techniques. Among the nonparametric approaches, the distance-based methods (such as the distance correlation-based hypotheses testing for independence) have many advantages, compared ...
Cheng Huang, Xiaoming Huo
doaj +1 more source
Variational Registration of Multiple Images with the SVD Based $$\mathrm {S}q\mathrm {N}$$ Distance Measure [PDF]
Image registration, especially the quantification of image similarity, is an important task in image processing. Various approaches for the comparison of two images are discussed in the literature. However, although most of these approaches perform very well in a two image scenario, an extension to a multiple images scenario deserves attention. In this
Kai Brehmer +3 more
openaire +2 more sources
Exact $L^2$-Distance from the Limit for QuickSort Key Comparisons (Extended Abstract) [PDF]
Using a recursive approach, we obtain a simple exact expression for the $L^2$-distance from the limit in the classical limit theorem of Régnier (1989) for the number of key comparisons required by $\texttt{QuickSort}$. A previous study by Fill and Janson
Patrick Bindjeme, james Allen fill
doaj +1 more source

