Integration of Multi-Sensor Fusion and Decision-Making Architecture for Autonomous Vehicles in Multi-Object Traffic Conditions. [PDF]
Sensors (Basel)Nguyen HN +6 more
europepmc +1 more source
Long-Term Water Stability Analysis of Graphene-Composite-Modified Permeable Asphalt Mixture. [PDF]
Materials (Basel)Ji S +6 more
europepmc +1 more source
Suitability of prolonged meloxicam treatment in mice seems limited due to unfavorable pharmacokinetics, side effects, and impact on home-cage behaviors. [PDF]
Sci RepGlasenapp A +8 more
europepmc +1 more source
Determining Tyre Adhesion Characteristics Based on the Road Tests of Automobiles. [PDF]
Sensors (Basel)Reński A +5 more
europepmc +1 more source
Ultrasonographic evaluation of gastrointestinal wall thickness in Korean raccoon dogs (<i>Nyctereutes procyonoides koreensis</i>). [PDF]
J Vet SciChoi Y, Kim M, Han JI, Lee K, Yoon H.
europepmc +1 more source
Fibonacci and Lucas numbers arising from two-component spanning forests of wheel graphs [PDF]
Tsuyoshi Miezaki, Shunya Tamura
openalex
Related searches:
The significant growing amount of shared files in distributed and serverless P2P networks has impacted heavily on content management and retrieval field. In this paper, we propose an associative memory network with intention to provide efficient pattern recognition within P2P networks.
Amiza Amir +2 more
openaire +1 more source
Distance integral generalized wheel graphs
Discrete Mathematics, 2023The authors consider the question of when the spectrum of the distance matrix of the join of several copies of the same complete graph (\(aK_m\)) and a cycle (\(C_n\)) consists of integers only. Since both constituent graphs are regular, their adjacency eigenvalues find their way into the distance spectrum of the join, so that only integral cycles (\(n\
Junying Lu, Weijun Liu, Lu Lu
openaire +1 more source
TOTAL DOMINATION INTEGRITY OF WHEEL RELATED GRAPHS
Advances and Applications in Discrete Mathematics, 2023The total domination integrity of a simple connected graph G with no isolated vertices is denoted by TDI(G) and defined as TDI(G)=min { left | S right |+m(G-S) : S subseteq V(G) }, where S is a total dominating set of G and m(G - S) is the order of a maximum connected component of G - S. It is a new measure of vulnerability of a graph.
Shah, N. H., Viho, P. L.
openaire +2 more sources