Results 191 to 200 of about 57,468 (218)

ANN-based analysis of MHD third-grade hybrid nanofluid flow over a thin needle with fuzzy volume fraction under nonlinear radiation and heat generation. [PDF]

Sci Rep
Siddique I, Nadeem M, Shakoor B, Kraiem H, Ghallab AS, Yaseen ZM, Abdullaeva B.   +6 more
europepmc   +1 more source

Fault-tolerant formation control of heterogeneous multi-agent systems with unknown inputs and external disturbances. [PDF]

Sci Rep
Li Y, Liu Y, Zhu L, Guo Y.
europepmc   +1 more source

High genus surface parameterization using the Euclidean Ricci flow method. [PDF]

Sci Rep
Wang YG.
europepmc   +1 more source

Dynamical phase diagram of the quantum Ising model with cluster interaction under noiseless and noisy driven field. [PDF]

Sci Rep
Kheiri S, Jafari R, Mahdavifar S, Oskoee SEN, Akbari A.   +4 more
europepmc   +1 more source

Optimizing ergonomic risk assessment using fuzzy irregular cellular automata: a novel approach to modeling musculoskeletal disorders in industrial workstations. [PDF]

Sci Rep
Kashani M, Zare A, Barzekar S, Jaamebozorgi MB, Moradpour MA, Sadeghi M.   +5 more
europepmc   +1 more source

Study on the influencing factors of photovoltaic siting in coal mining subsidence areas-taking Shanxi Province as an example. [PDF]

Sci Rep
Lu Y, Yan Y, Wang M, Zhou L.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

𝒌 – Graceful Labeling of Triangular Type Grid Graphs 𝑫𝒏(𝑷𝒎) and 𝑳 – Vertex Union of 𝑫𝒏(𝑷𝒎)

Proceedings of the SLIIT International Conference on Engineering and Technology, 2023
Graph labeling is one of the most popular research topics in the field of graph theory. Prime labeling, antimagic labeling, radio labeling, graceful labeling, lucky labeling, and incidence labeling are some of the labeling techniques. Among the above-mentioned techniques, graceful labeling is one of the most engaging graph labeling techniques with a ...
W.K.M Indunil, A.A.I Perera
openaire   +1 more source

Probabilistic distributed algorithm for uniform election in polyo-triangular grid graphs

2014 Second World Conference on Complex Systems (WCCS), 2014
Electing in a network is to chose one and only one element in this network. The element can be used later to manage the resource sharing (printer, connection, …) or centralize some of the network informations (size, diameter …). In this case, many algorithms are available under different topologies and applicable under appropriate assumptions; the ...
Ismail Hind, Dahmani Ali
openaire   +1 more source

Rechargeable Batteries for Grid Scale Energy Storage

Chemical Reviews, 2022
Yang Jin, Yi Cui, Wei Chen
exaly