Results 81 to 90 of about 246,310 (302)

Upsampling DINOv2 Features for Unsupervised Vision Tasks and Weakly Supervised Materials Segmentation

open access: yesAdvanced Intelligent Systems, EarlyView.
Feature from recent image foundation models (DINOv2) are useful for vision tasks (segmentation, object localization) with little or no human input. Once upsampled, they can be used for weakly supervised micrograph segmentation, achieving strong results when compared to classical features (blurs, edge detection) across a range of material systems.
Ronan Docherty   +2 more
wiley   +1 more source

On the construction of L-equienergetic graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2015
For a graph G with n vertices and m edges, and having Laplacian spectrum μ1,μ2,…,μn and signless Laplacian spectrum μ1+,μ2+,…,μn+, the Laplacian energy and signless Laplacian energy of G are respectively, defined as LE(G)=∑i=1n|μi−2mn| and LE+(G)=∑i=1n ...
S. Pirzada, Hilal A. Ganie
doaj   +1 more source

Laplacian energy and first Zagreb index of Laplacian integral graphs

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022
The set Si,n = {0, 1, 2, …, i − 1, i + 1, …, n − 1, n}, 1 ⩽ i ⩽ n, is called Laplacian realizable if there exists a simple connected undirected graph whose Laplacian spectrum is Si,n. The existence of such graphs was established by S. Fallat et all.
Hameed Abdul   +2 more
doaj   +1 more source

Efficient Dynamics: Reduced‐Order Modeling of the Time‐Dependent Schrödinger Equation

open access: yesAdvanced Physics Research, EarlyView.
Reduced‐order modeling (ROM) approaches for the time‐dependent Schrödinger equation are investigated, highlighting their ability to simulate quantum dynamics efficiently. Proper Orthogonal Decomposition, Dynamic Mode Decomposition, and Reduced Basis Methods are compared across canonical systems and extended to higher dimensions.
Kolade M. Owolabi
wiley   +1 more source

Optimal graph Laplacian

open access: yesAutomatica, 2019
This paper provides a construction method of the nearest graph Laplacian to a matrix identified from measurement data of graph Laplacian dynamics that include biochemical systems, synchronization systems, and multi-agent systems. We consider the case where the network structure, i.e., the connection relationship of edges of a given graph, is known.
openaire   +2 more sources

Model‐informed drug development to support nemolizumab clinical development in adults and adolescents with moderate to severe atopic dermatitis

open access: yesBritish Journal of Clinical Pharmacology, EarlyView.
Abstract Aims Population pharmacokinetic (popPK) and pharmacokinetic‐pharmacodynamic (PK/PD) models were developed to support clinical development of nemolizumab, a humanized monoclonal antibody targeting the IL‐31 receptor α, in adolescents and adults with moderate‐to‐severe atopic dermatitis (AD).
Floris Fauchet   +17 more
wiley   +1 more source

An Interpretation of the Geometric Meaning of the Finite Difference and the Function Derivative through the Use of the Finite Element Method Tools

open access: yesМеханика машин, механизмов и материалов, 2016
In the present article on the basis of earlier formulated planspatial problem of the finite elements method the concept of finite differences for the twodimensional continuous environment is developed.
Hrant A. Gevorgyan
doaj  

On the singular problem involving $g$-Laplacian [PDF]

open access: green, 2023
Kaushik Bal   +2 more
openalex   +1 more source

Home - About - Disclaimer - Privacy