Results 191 to 200 of about 21,220 (243)

Rechargeable Self‐Powered Flexible Pressure Sensors With Adjustable Sensitivity Based on Quasi‐Solid‐State Zinc‐Ion Batteries

open access: yesEcoEnergy, EarlyView.
his paper presents a self‐powered, rechargeable quasi‐solid‐state zinc‐ion battery‐based flexible pressure sensor with adjustable sensitivity, excellent performance and broad application prospects. ABSTRACT Flexible pressure sensors hold broad application prospects in electronic skin, human–machine interaction, and health monitoring.
Qianqian Yao   +7 more
wiley   +1 more source

An Intelligent Multi-Task Supply Chain Model Based on Bio-Inspired Networks. [PDF]

open access: yesBiomimetics (Basel)
Khaleghi M   +3 more
europepmc   +1 more source

Low dose thirdhand smoke exposure enhances platelet functional responses in mice. [PDF]

open access: yesExp Biol Med (Maywood)
Badejo PO   +8 more
europepmc   +1 more source

Non-Inclusive Diagnosability of Alternating Group Graphs

Parallel Processing Letters, 2023
The diagnosability is very important in multiple-processor systems. Ding et al. proposed the non-inclusive diagnosability of systems in 2020. Compared to previous diagnosability, non-inclusive diagnosability requires all faulty sets to be non-inclusive.
Zhuo, Nengjin   +3 more
openaire   +1 more source

Neighbor Connectivity of the Alternating Group Graph

Journal of Interconnection Networks, 2021
Given a graph [Formula: see text], its neighbor connectivity is the least number of vertices whose deletion along with their neighbors results in a disconnected, complete, or empty graph. The edge neighbor connectivity is the least number of edges whose deletion along with their endpoints results in a disconnected, complete, or empty graph.
Mohamad Abdallah, Chun-Nan Hung
openaire   +1 more source

Component Connectivity of Alternating Group Networks and Godan Graphs

International Journal of Foundations of Computer Science, 2022
Connectivity is an important index to evaluate the reliability and fault tolerance of a graph. As a natural extension of the connectivity of graphs, the [Formula: see text]-component connectivity of a graph [Formula: see text], denoted by [Formula: see text], is the minimum number of vertices whose removal from [Formula: see text] results in a ...
Hong Zhang, Shuming Zhou, Qifan Zhang
openaire   +2 more sources

Home - About - Disclaimer - Privacy