Results 91 to 100 of about 94,123 (306)
Resonances on regular tree graphs
We investigate the distribution of the resonances near spectral thresholds of Laplace operators on regular tree graphs with $k$-fold branching, $k \geq 1$, perturbed by nonself-adjoint exponentially decaying potentials. We establish results on the absence of resonances which in particular involve absence of discrete spectrum near some sectors of the ...
Bourget, Olivier +2 more
openaire +2 more sources
Modelling deposition environments around superheater tubes [PDF]
In an important initiative to reduce carbon dioxide emission from pulverized fuel boilers, coal is now co-fired with biomass. During the combustion process, however, chlorine and sulphur in chemical compounds associated with sodium and potassium are ...
Davies, Martyn W.
core
Persistent Bilateral [18F]THK5351 and Migrating Unilateral [18F]FDG Uptake in Anti‐LGI1 Encephalitis
ABSTRACT Anti–leucine‐rich glioma‐inactivated 1 encephalitis (LGI1‐E) can cause persistent cognitive deficits, but the mechanisms remain unclear. A 40‐year‐old woman with LGI1‐E presented with subacute cognitive deficits and showed mild left medial temporal lobe (MTL) swelling and fluid‐attenuated inversion recovery (FLAIR) hyperintensity on initial ...
Yusuke Akitomi +8 more
wiley +1 more source
Background Graph representational learning can detect topological patterns by leveraging both the network structure as well as nodal features. The basis of our exploration involves the application of graph neural network architectures and machine ...
Gayathri Sunil +4 more
doaj +1 more source
ABSTRACT Objective Down syndrome regression disorder is a syndrome characterized by subacute loss of cognitive, behavioral, and functional abilities in individuals with Down syndrome. Electroencephalography abnormalities are frequently observed during evaluation, but it remains unclear whether these findings represent a dynamic marker of disease ...
Jonathan D. Santoro +14 more
wiley +1 more source
COMPUTING THE ANTI-KEKULÉ NUMBER OF CERTAIN NANOTUBES AND NANOCONES
Let G(V,E) be a connected graph. A set M subset of E is called a matching if no two edges in M have a common end-vertex. A matching M in G is perfect if every vertex of G is incident with an edge in M.
Mehar Ali MALIK, Muhammad IMRAN
doaj
This article presents an experimental and numerical modal investigation of composite sandwich structures using surfboards as model systems. By comparing different core materials and reinforcement strategies, the study demonstrates how local stiffeners influence vibrational response and introduce characteristic modal features, highlighting modal ...
Brett Connellan +4 more
wiley +1 more source
Resonance Graph of Perfect Matchings
Let G be a graph with perfect matchings and let C be a set of linearly independent even cycles of G of width at most 2. The resonance graph R(G, C) is a graph with the vertex set M a subset of M(G) such that two vertices Mi and Mj are adjacent if and ...
Aluoch, James
core
Reliability test for processing of magnetic resonance images in resting state using graph theory
Publisher Copyright: © Copyright 2016 American Scientific Publishers.A large number of current studies have been conducted using graph theory as magnetic resonance image processing.
Jorge-Hernandez, Fernando +1 more
core +1 more source
Magnetic‐field‐assisted CVD of heterometallic single‐source precursors modulates thin‐film surface electronic structure and interfacial charge transfer. Field‐grown (Cobalt ferrite‐1T)CF‐1T films exhibit stabilized electronic states, lower kinetic barriers, and markedly enhanced nitrate‐to‐ammonia electrocatalysis versus (Cobalt ferrite‐0T) CF‐0T ...
Touraj Karimpour +11 more
wiley +1 more source

