Results 221 to 230 of about 158,911 (285)

Function level parallelism driven by data dependencies

open access: green, 2007
Sean Rul   +2 more
openalex   +2 more sources

Reassessing pseudosluicing in Austronesian

open access: yesSyntax, EarlyView.
Abstract Pseudosluicing diagnostics have played an important role in wider debates about sluicing. Sluicing is the term used to describe the deletion of an embedded clausal constituent, which leaves only a wh‐phrase overt. Genuine sluicing requires syntactic or semantic identity between the sluiced clause and its antecedent, contrasting with ...
John Middleton
wiley   +1 more source

A unified approach to parasitic gap and across‐the‐board constructions: Evidence based on Mandarin Chinese

open access: yesSyntax, EarlyView.
Abstract Despite the lack of consensus on English facts, this study demonstrates that both parasitic gap (PG) and across‐the‐board (ATB) constructions in Mandarin Chinese exhibit parallel effects in variable binding reconstruction, while also displaying asymmetries in gap licensing categories.
Jen Ting
wiley   +1 more source

Disintegrin‐Like and Metalloprotease With Thrombospondin Type 1 Repeat Motifs 13 (ADAMTS13) Activity in 40 Healthy Dogs

open access: yesVeterinary Clinical Pathology, EarlyView.
ABSTRACT Background In humans, deficiency of a disintegrin‐like and metalloprotease with thrombospondin type 1 motifs, number 13 (ADAMTS13), a von Willebrand factor (vWF) cleaving protease, is an underlying mechanism for thrombosis. The role of ADAMTS13 in canine thromboembolic disease is largely unknown.
Ashley R. Wilkinson   +2 more
wiley   +1 more source

Bridging Portability and Performance in Sparse Tensor Computations Using SYCL

open access: yesConcurrency and Computation: Practice and Experience, Volume 37, Issue 27-28, 25 December 2025.
ABSTRACT Sparse tensors have become prevalent data structures in multiple applications, such as medical imaging and machine learning, making operations that decompose them, that is, creating smaller structures that retain most of the original information, essential.
Daniel Pacheco   +4 more
wiley   +1 more source

Dynamic contrast enhanced‐magnetic resonance fingerprinting (DCE‐MRF): A new quantitative MRI method to reliably assess tumor vascular perfusion

open access: yesMagnetic Resonance in Medicine, Volume 94, Issue 6, Page 2578-2592, December 2025.
Abstract Purpose The clinical utility of conventional DCE‐MRI methods is limited by the use of conventional qualitative dynamic T1‐weighted images, resulting in poor reproducibility. This study presents the initial implementation of a new DCE‐magnetic resonance fingerprinting (DCE‐MRF) methodology to provide reproducible, quantitative assessments of ...
Christina J. MacAskill   +13 more
wiley   +1 more source

PyQuake3D: A Python Tool for 3‐D Earthquake Sequence Simulations of Seismic and Aseismic Slip

open access: yesJournal of Geophysical Research: Machine Learning and Computation, Volume 2, Issue 4, December 2025.
Abstract Simulating the full spectrum of fault slip behavior—from slow aseismic creep to dynamic earthquake rupture—is essential for advancing our understanding of fault mechanics and long‐term seismic hazard. However, few open‐source tools provide efficient three‐dimensional modeling of these processes with the flexibility needed for research across ...
Rongjiang Tang   +3 more
wiley   +1 more source

Local Government Proliferation and Fiscal Efficiency: Evidence From Ghana

open access: yesGrowth and Change, Volume 56, Issue 4, December 2025.
ABSTRACT In many active decentralized nations in the developing world, the number of sub‐national administrative units has continued to increase over the past few decades. In most cases, this churning of more decentralized units does not go without contestation, with critics arguing that they are not done in the true spirit of decentralization but ...
Zurikanen Iddrisu   +3 more
wiley   +1 more source

Multi GPU Sparse Matrix by Sparse Matrix Multiplication

open access: yesConcurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.
ABSTRACT The paper focuses on the improvement of the existing nsparse Nagasaka et al. algorithm and its extension to the multi‐GPU setting for the application of real engineering problems. In this work, we propose a distributed multi‐GPU framework for SpGEMM that is designed specifically for the nsparse like algorithms.
Artem Mavliutov   +4 more
wiley   +1 more source

Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale

open access: yesConcurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.
ABSTRACT The Branch‐and‐Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem‐solving and decision‐making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions and abandoning a candidate as soon as it determines that it cannot lead to ...
Guillaume Helbecque   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy