Results 71 to 80 of about 811,718 (165)
Deterministic Construction of Measurement Matrices Based on Bose Balanced Incomplete Block Designs
Compressed sensing is a novel information collection theory. Compared with the Nyquist sampling theorem, compressed sensing can obtain all the information of a signal with very few samples.
Liu Haiqiang +4 more
doaj +1 more source
Interval Valued Secondary k-Range Symmetric Quadri Partitioned Neutrosophic Fuzzy Matrices with Decision Making [PDF]
The objective of this study is to establish the results concerning Interval-Valued (IV) Secondary k-Range Symmetric (RS) Quadri Partitioned Neutrosophic Fuzzy Matrices (QPNFM).
K. Radhika +5 more
doaj +1 more source
More on the Cohort-Component Model of Population Projection in the Context of HIV/AIDS: A Leslie Matrix Representation and New Estimates [PDF]
This article presents an extension of the cohort component model of population projection (CCMPP) first formulated by Heuveline that is capable of modeling a population affected by HIV.
Jason Thomas, Samuel J. Clark
core
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edges. However, there are a number of applications that lead to graphs that do not share these characteristics, for which these algorithms highly become inefficient.
Jia Wu, Ling Chen
openaire +1 more source
The incidence matrix and labelings of a graph
AbstractWe deal with the problem of labeling the edges of a graph in such a way that the labels of the edges incident with any vertex add up to a value prescribed for that vertex. We show that the use of elementary column operations on the incidence matrix is fruitful in giving easy proofs of theorems on magic graphs and labeling |1, 3, 4|.
openaire +1 more source
The classical pre-stack seismic inversion technique uses the Zoeppritz equation and its simplified versions to calculate the PP and PS reflection coefficients at different incidence angles, aiding in inverting the subsurface velocity and density ...
Qianlong Ding +4 more
doaj +1 more source
Graph theoretic concepts and the incidence matrix
Most notation of graph theory can be related to its incidence matrix and its manipulations.
openaire +2 more sources
(-1,1)-incidence matrix of a graph
Let \( V(G) = \{v_1, v_2, \ldots, v_n\} \) be the vertex set and \( E(G) = \{e_1, e_2, \ldots, e_m\} \) be the edge set of a graph \( G \). The Seidel adjacency matrix of a graph \( G \) is defined as \( S(G) = [s_{ij}] \) of order \( n \times n \), in which \( s_{ij} = -1 \) if \( v_i \) is adjacent to \( v_j \), \( s_{ij} = 1 \) if \( v_i \) is not ...
openaire +1 more source
On the diffeomorphic type of the complement to a line arrangement in a projective plane
Bogomolov Fedor, Kulikov Viktor
doaj +1 more source
IMAGE ENCRYPTION USING THE INCIDENCE MATRIX [PDF]
A. Lakehal, A. Boua
openaire +1 more source

