Results 221 to 230 of about 374,835 (257)
Complementary unipolar electrical transport is demonstrated in ZnO‐Co3O4 core–shell nanowires, by engineering multi‐terminal device architectures that allow to selectively address different sections of the nanostructure and resorting on ionic liquid gating for conformal capacitive coupling and field effect control.
Valeria Demontis +5 more
wiley +1 more source
scII: Dual-Threshold Adaptive Integration of Single-Cell Multiomics Data Driven by Imputation. [PDF]
Zhang Y, Li Y, Jin Z, Tian Y, Su C.
europepmc +1 more source
Teacher sensitivity as a bridge to emotion regulation for students with special educational needs in their emotional and social development in physical education. [PDF]
Brunssen L, Kastrup V.
europepmc +1 more source
Psychological distress and cultural role conflict among dementia family caregivers in China: a phenomenological study. [PDF]
Yu G, Yuan T, Bu S, Zeng Y.
europepmc +1 more source
The experience of gay Christian men attending collaborative workshops facilitated by a sexual health professional and a priest. [PDF]
Kunelaki R +3 more
europepmc +1 more source
Experiences of Ageism in mHealth App Usage Among Older Adults: Interview Study Among Older Adults Based on Extended Unified Theory of Acceptance and Use of Technology and Risks of Ageism Models. [PDF]
Sun J +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Discrete Mathematics, 1994
Summary: The authors present a construction of binary self-dual codes from Eulerian graphs and establish that the code will be indecomposable if and only if the vertices of degree 2 are not a cutset of the graph. The construction is used to establish that every finite group is isomorphic to the automorphism group of some self-dual code.
Babai, L., Oral, H., Phelps, K. T.
openaire +1 more source
Summary: The authors present a construction of binary self-dual codes from Eulerian graphs and establish that the code will be indecomposable if and only if the vertices of degree 2 are not a cutset of the graph. The construction is used to establish that every finite group is isomorphic to the automorphism group of some self-dual code.
Babai, L., Oral, H., Phelps, K. T.
openaire +1 more source

