Results 131 to 140 of about 132,994 (259)

Discursive Power, Civilian Agency, Wartime Duress, and Resilience: Letters to the Authorities in the Blockade of Leningrad

open access: yesThe Russian Review, EarlyView.
Abstract How did World War II affect the nature and resilience of Soviet institutions and authority, especially in the extreme case of the Blockade of Leningrad? During the Blockade, Leningraders acted with great agency by engaging in the shadow trade of food and shadow talk for information and community in order to survive.
Jeffrey K. Hass, Nikita A. Lomagin
wiley   +1 more source

Active learning strategies in business and information & communication technology engineering higher education: A scoping review

open access: yesReview of Education, Volume 14, Issue 2, August 2026.
Abstract Active learning (AL) has emerged as a pedagogical response to diverse educational challenges across multiple disciplines. This scoping review maps the terrain of AL implementation patterns, examining AL practices in Business Education, Information and Communication Technology (ICT) Engineering, Mathematics, and Statistics from 2015 until the ...
Dubravka Novkovic   +2 more
wiley   +1 more source

Cache Replacement with Memory Allocation [PDF]

open access: yes, 2014
Shahram Ghandeharizadeh   +2 more
openaire   +1 more source

Topological Graph Neural Networks: A Novel Approach for Geometric Deep Learning

open access: yesApplied AI Letters, Volume 7, Issue 2, June 2026.
This graphical abstract illustrates the Topological Graph Neural Network (TopGNN) architecture. It demonstrates a parallel processing approach where an input graph is simultaneously analyzed by a standard GNN Encoder to capture local node features and by Persistent Homology to extract global topological features (like cycles and voids), visualized as a
Amarjeet   +7 more
wiley   +1 more source

‘reportless places’: Janet Malcolm and Collage

open access: yes
Critical Quarterly, EarlyView.
Natalie Ferris
wiley   +1 more source

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

open access: yesNetworks, Volume 87, Issue 4, Page 404-427, June 2026.
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w) is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP‐hard.
Jannick Borowitz   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy