Results 11 to 20 of about 123,701 (142)

Impact of through-slice gradient optimization for dynamic slice-wise shimming in the cervico-thoracic spinal cord. [PDF]

open access: yesMagn Reson Med
Abstract Purpose This study investigates the effectiveness of through‐slice gradient optimization in dynamic slice‐wise B0 shimming of the cervico‐thoracic spinal cord to enhance signal recovery in gradient‐echo (GRE) EPI sequences commonly used in functional MRI studies. Methods Six volunteers underwent MRI acquisitions with dynamic shim updating (DSU)
Breheret A   +4 more
europepmc   +2 more sources

Selenium Nucleophilicity and Electrophilicity in the Intra- and Intermolecular SN2 Reactions of Selenenyl Sulfide Probes. [PDF]

open access: yesChemistry
Chalcogenol‐dichalcogenide exchange reactions of linear and cyclic dichalcogenides are investigated in silico to gain insight into their relative rates. The unveiled role of double exchange reactions in the chemistry of RX1, a selenenyl sulfide TrxR1 probe, explains the origin of its specificity even under high‐thiol concentrations and provides hints ...
Madabeni A   +3 more
europepmc   +2 more sources

DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Training [PDF]

open access: yesInternational Conference on Learning Representations, 2023
Zeroth-order (ZO) optimization has become a popular technique for solving machine learning (ML) problems when first-order (FO) information is difficult or impossible to obtain.
Aochuan Chen   +9 more
semanticscholar   +1 more source

Quantifying Over Trees in Monadic Second-Order Logic [PDF]

open access: yesLogic in Computer Science, 2023
Monadic Second-Order Logic (MSO) extends First-Order Logic (FO) with variables ranging over sets and quantifications over those variables. We introduce and study Monadic Tree Logic (MTL), a fragment of MSO interpreted on infinite-tree models, where the ...
M. Benerecetti   +3 more
semanticscholar   +1 more source

On Exact Sampling in the Two-Variable Fragment of First-Order Logic [PDF]

open access: yesLogic in Computer Science, 2023
In this paper, we study the sampling problem for first-order logic proposed recently by Wang et al.—how to efficiently sample a model of a given first-order sentence on a finite domain? We extend their result for the universally-quantified subfragment of
Yuanhong Wang   +3 more
semanticscholar   +1 more source

Communication-Efficient Stochastic Zeroth-Order Optimization for Federated Learning [PDF]

open access: yesIEEE Transactions on Signal Processing, 2022
Federated learning (FL), as an emerging edge artificial intelligence paradigm, enables many edge devices to collaboratively train a global model without sharing their private data.
Wenzhi Fang   +5 more
semanticscholar   +1 more source

Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics [PDF]

open access: yesLogic in Computer Science, 2022
Semiring semantics evaluates logical statements by values in some commutative semiring (K, +, ·, 0, 1). Random semiring interpretations, induced by a probability distribution on K, generalise random structures, and we investigate here the question of how
E. Grädel   +3 more
semanticscholar   +1 more source

Technical Note: Using Machine Learning to Predict Locomotor Behavior in Great Apes and Humans From Femur Metaphyseal Shape [PDF]

open access: yesAm J Biol Anthropol
ABSTRACT Objectives The morphology of the hominoid distal femoral metaphyseal surface has been demonstrated to reflect locomotor behavior throughout ontogeny. Here, we quantify metaphyseal surface morphology to evaluate its predictive relationship to locomotor behavioral modes in hominoids.
Stamos P   +3 more
europepmc   +2 more sources

First-order Logic with Connectivity Operators [PDF]

open access: yesAnnual Conference for Computer Science Logic, 2021
First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem parameterized by solution size.
Nicole Schirrmacher   +2 more
semanticscholar   +1 more source

Parameterized Complexity of Elimination Distance to First-Order Logic Properties [PDF]

open access: yesLogic in Computer Science, 2021
The elimination distance to some target graph property ${\mathcal{P}}$ is a general graph modification parameter introduced by Bulian and Dawar. We initiate the study of elimination distances to graph properties expressible in first-order logic.
F. Fomin, P. Golovach, D. Thilikos
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy