Results 131 to 140 of about 569,188 (376)
MOFs and COFs in Electronics: Bridging the Gap between Intrinsic Properties and Measured Performance
Metal‐organic frameworks (MOFs) and covalent organic frameworks (COFs) hold promise for advanced electronics. However, discrepancies in reported electrical conductivities highlight the importance of measurement methodologies. This review explores intrinsic charge transport mechanisms and extrinsic factors influencing performance, and critically ...
Jonas F. Pöhls, R. Thomas Weitz
wiley +1 more source
A New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets [PDF]
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced
Sadollah Ebrahimnejad +2 more
doaj
Structural factoring approach for analyzing stochastic networks [PDF]
The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional ...
Hayhurst, Kelly J., Shier, Douglas R.
core +1 more source
Device Integration Technology for Practical Flexible Electronics Systems
Flexible device integration technologies are essential for realizing practical flexible electronic systems. In this review paper, wiring and bonding techniques critical for the industrial‐scale manufacturing of wearable devices are emphasized based on flexible electronics.
Masahito Takakuwa +5 more
wiley +1 more source
Legendre spectral collocation method for approximating the solution of shortest path problems [PDF]
Emran Tohidi, O. R. Navid Samadi
openalex +1 more source
The Algorithm of the Time-Dependent Shortest Path Problem with Time Windows
In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function .
N. El-Sherbeny
semanticscholar +1 more source
Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy.
Bauer, Reinhard +2 more
openaire +2 more sources
A hybrid anode composed of Cl‐functionalized curved nanographene and graphite enables ultra‐fast charging and long cycle life through an engineered morphology and sequential Li+ insertion. It delivers 100 mAh g−1 at 5 C with 70% capacity retention after 1000 cycles and maintains stable performance over 2000 cycles in pouch cells, providing a practical ...
Hyunji Cha +8 more
wiley +1 more source
Peptide Sequencing With Single Acid Resolution Using a Sub‐Nanometer Diameter Pore
To sequence a single molecule of Aβ1−42–sodium dodecyl sulfate (SDS), the aggregate is forced through a sub‐nanopore 0.4 nm in diameter spanning a 4.0 nm thick membrane. The figure is a visual molecular dynamics (VMD) snapshot depicting the translocation of Aβ1−42–SDS through the pore; only the peptide, the SDS, the Na+ (yellow/green) and Cl− (cyan ...
Apurba Paul +8 more
wiley +1 more source
This paper addresses the robust shortest path problem with interval data, i.e. the case of classical shortest path problem with given source and sink when arc weights are not fixed but take their values from some intervals associated with arcs.
Nikulin, Yury
core

