Results 51 to 60 of about 190,109 (292)
Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae
Forward stimulated Raman scattering (F‐SRS) and epi coherent anti‐Stokes Raman scattering (E‐CARS) allow label‐free discrimination of distinct subcellular structures in the pancreas of living zebrafish larvae. Given the straightforward applicability, we anticipate broad implementation of Raman microscopy in other organs and across various biomedical ...
Noura Faraj +3 more
wiley +1 more source
Betweenness centrality for temporal multiplexes
Betweenness centrality quantifies the importance of a vertex for the information flow in a network. The standard betweenness centrality applies to static single-layer networks, but many real world networks are both dynamic and made of several layers.
Silvia Zaoli +2 more
doaj +1 more source
Filterless optical networks (FONs) have become a cost-effective solution for optical network deployment due to their low-cost characteristics. However, eliminating active switching elements causes signals to propagate over unintended links, wasting ...
Junling Yuan +5 more
doaj +1 more source
Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications
This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley +1 more source
A Tag-Constrained Top-k Shortest Path for Finding Diverse Routes
The top-k shortest path problem is a fundamental topic in graph theory and pathfinding applications. Traditional approaches focus solely on finding k paths with the least total cost or distance, often resulting in highly similar paths that offer limited
Bagus Jati Santoso +2 more
doaj +1 more source
Urban Rail Transit Network KSP Algorithm Based on Labeling Edge [PDF]
Path searching is the precondition of the ticket income distribution and the passenger flow assignment of urban rail transit network.Only being extended,the urban rail transit network can find path by using path searching algorithm with labeling node ...
TANG Jimeng,SUN Quanxin,DU Peng,CHEN Zhijie
doaj +1 more source
Dynamic Shortest Paths Methods for the Time-Dependent TSP
The time-dependent traveling salesman problem (TDTSP) asks for a shortest Hamiltonian tour in a directed graph where (asymmetric) arc-costs depend on the time the arc is entered.
Christoph Hansknecht +2 more
doaj +1 more source
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
Counterexample Generation in Probabilistic Model Checking [PDF]
Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This paper considers algorithms for counterexample generation for probabilistic CTL formulae in discrete-time Markov chains ...
Damman, B., Han, T., Katoen, J.P.
core +5 more sources
This review provides an overview of bio‐based polymer sources, their unique functional properties and their environmental impact, and addresses their role as sustainable alternatives. It discusses end‐of‐life options, including composting and anaerobic digestion for renewable energy.
Sabina Kolbl Repinc +8 more
wiley +1 more source

