Results 61 to 70 of about 33,387 (263)
StackingNet: Collective Inference Across Independent AI Foundation Models
ABSTRACT Artificial intelligence (AI) built on large foundation models has transformed language understanding, computer vision, and reasoning, yet these systems remain isolated and cannot readily share their capabilities. Coordinating the complementary strengths of independently developed, black‐box foundation models is essential for trustworthy ...
Siyang Li +4 more
wiley +1 more source
DDSurfer reconstructs cortical surfaces directly from diffusion MRI without requiring T1‐weighted scans. By fusing complementary microstructural features and learning diffeomorphic deformations, it efficiently generates accurate white matter and pial surfaces, improving geometric fidelity and morphometric reliability across datasets for robust surface ...
Chengjin Li +10 more
wiley +1 more source
A simplified variational iteration method is proposed to solve high-order homogeneous or nonhomogeneous linear ordinary differential equation and ordinary differential equation eigenvalue problems more efficiently and conveniently.
Chao Pan, Ruifu Zhang, Hao Luo, Hua Shen
doaj +1 more source
scTIDE identifies single‐cell tipping points by combining manifold‐based graph representations with optimal‐transport conditional flow matching, which preserves intrinsic topology and models distributional dynamics. It supports critical‐transition detection at individual‐cell resolution, prediction of unseen cells, and dimensionality reduction and ...
Jiayuan Zhong +6 more
wiley +1 more source
At the end of the spectrum: chromatic bounds for the largest eigenvalue of the normalized Laplacian
For a graph with largest normalized Laplacian eigenvalue λ _N and (vertex) coloring number χ , it is known that $\lambda_N\unicode{x2A7E} \chi/(\chi-1)$ . Here we prove properties of graphs for which this bound is sharp, and we study the multiplicity of $
Lies Beers, Raffaella Mulas
doaj +1 more source
Let W1 and W2 be independent n×n complex central Wishart matrices with m1 and m2 degrees of freedom respectively. This paper is concerned with the extreme eigenvalue distributions of double-Wishart matrices (W1+W2)−1W1, which are analogous to those of F ...
Laureano Moreno-Pozas +2 more
doaj +1 more source
Complex Eigenvalue Analysis of a Linear Pencil: An Experimental Study
This paper is concerned with a finite-dimensional example of a linear pencil which leads to a class of non-self-adjoint matrices. We consider the linear pencil $H_c-\lambda L$, where $H_c$ is a tri-diagonal matrix with a constant parameter $c$ on the main diagonal and off-diagonal entries equal to one, and $L$ is a diagonal matrix whose elements ...
openaire +2 more sources
Mice can transfer the learned rule of spatial working memory to guide similar but novel tasks. Hippocampal CA3 populational activity dynamically reorganize during memory generalization, shifting from task‐specific to generalized coding over testing days. Sparse yet redundant neural representations of CA3 enable rule transfer and cognitive map formation,
Da Song +8 more
wiley +1 more source
This study demonstrates the application of Complex Eigenvalue Analysis (CEA) to optimize a weighted bolt that targets unstable frequencies in a floating caliper brake assembly. A commercial automobile brake assembly undergoes experimental modal analysis,
Beňo Pavel +2 more
doaj +1 more source
Data‐Driven Discovery of Unconventional Antiferromagnets
A high‐throughput workflow that combines the physics‐informed pre‐screening, high‐throughput exchange calculations, Luttinger‐Tisza analysis and symmetry classification is established for accurate identification of unconventional antiferromagnets from the broad structural database.
Qirui Cui +3 more
wiley +1 more source

