Results 121 to 130 of about 190,109 (292)
A Fuzzy Variable H Strategy Based Ripple-Spreading Algorithm to Find the k Shortest Paths
Ripple-spreading Algorithm (RSA) is a relatively new, nature-inspired, multi-agent based method for path optimization. This paper demonstrates that by modifying the micro-level behaviors of nodes and ripples, RSA achieves good scalability for solving the
Yingfei Zhang +5 more
doaj +1 more source
In this work, a magnetic core‐shell catalyst (HOF‐on‐Fe3O4/ZIF‐67) is successfully synthesized, consisting of a metal–organic framework (ZIF‐67) with magnetic Fe3O4 as the core and a porous hydrogen‐bonded organic framework (HOF) as the shell. The catalyst efficiently activated peroxymonosulfate, resulting in rapid and effective removal of water ...
Yingying Du +4 more
wiley +1 more source
This study uncovers the unexplored role of intermolecular interactions in multiphoton absorption in coordination polymers. By analyzing [Zn2tpda(DMA)2(DMF)0.3], it shows how the electronic coupling of the chromophores and confinement in the MOF enhance two‐and three‐photon absorption.
Simon Nicolas Deger +11 more
wiley +1 more source
Maneuvering Route Safety Planning for Military Vehicles during Wartime
Maneuvering route planning for the military vehicles during wartime is a noteworthy problem in the field of military transportation. Existing research paid little attention to security of vehicles, which we consider as a non-ignorable aspect with the ...
Zhao Tan +4 more
doaj +1 more source
Biofabrication aims at providing innovative technologies and tools for the fabrication of tissue‐like constructs for tissue engineering and regenerative medicine applications. By integrating multiple biofabrication technologies, such as 3D (bio) printing with fiber fabrication methods, it would be more realistic to reconstruct native tissue's ...
Waseem Kitana +2 more
wiley +1 more source
K Shortest Path Implementation
The problem of computing K shortest loopless paths, or ranking of the K shortest loopless paths between a pair of given vertices in a network is a well-studied generalization of shortest path problem. The K shortest paths problem determines not only one shortest path but the K best shortest paths from s to t in an increasing order of weight of the ...
openaire +1 more source
This work demonstrates the successful integration of a phenanthroline‐based 2D COF with MnI catalytic sites into a catholyte‐free membrane‐electrode‐assembly cell for CO2 electroreduction. The crystalline COF actively suppresses Mn⁰–Mn⁰ dimerization, achieving a turnover frequency of 617 h⁻¹ at 2.8 V (full‐cell potential), and enabling stable operation.
Laura Spies +8 more
wiley +1 more source
استخدام المسارين الأساسي والبديل وتأثيره في أداء الشبكة
تستخدم خوارزميات التوجيه في الشبكات الحاسوبية لتحديد المسار الأساسي للمعطيات من المصدر باتجاه الهدف وبشكل أساسي خوارزمية ديجكسترا التي تقوم بإيجاد أقصر مسار بين المصدر والوجهة لكن لدينا خوارزميات تقوم بإيجاد المسار البديل للمعطيات، وتقوم بتخزينه في جدول
د. عماد الدين محمد
doaj
An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone +11 more
wiley +1 more source

