Results 61 to 70 of about 407,365 (309)

High Repetition Rate Laser‐Induced Printing of Bioink with Picosecond Pulse Durations: Optimization of the Printing Process

open access: yesAdvanced Engineering Materials, EarlyView.
This study explores the use of laser‐induced forward transfer in the picosecond regime to create in vitro biomodels. Focusing on hydrodynamics and rheology, it investigates jet dynamics through time‐resolved imaging, optimizing laser fluence, biological ink viscosity, and printing distance to precisely control the volume and location of bioink ...
Lucas Duvert   +5 more
wiley   +1 more source

Bio-Inspired ACO-based Traffic Aware QoS Routing in Software Defined Internet of Things

open access: yesApplied Artificial Intelligence
The rising number of Internet of Things (IoT) devices, powered by inexpensive sensors and rapid wireless connections, places challenge on existing internet infrastructure and concerns sustainability issues. For networks to satisfy Quality-of-Service (QoS)
Shreyas J   +5 more
doaj   +1 more source

An Improved A* Search Algorithm for Road Networks Using New Heuristic Estimation [PDF]

open access: yesarXiv, 2022
Finding the shortest path between two points in a graph is a fundamental problem that has been well-studied over the past several decades. Shortest path algorithms are commonly applied to modern navigation systems, so our study aims to improve the efficiency of an existing algorithm on large-scale Euclidean networks. The current literature lacks a deep
arxiv  

Compact Routing on Internet-Like Graphs

open access: yes, 2003
The Thorup-Zwick (TZ) routing scheme is the first generic stretch-3 routing scheme delivering a nearly optimal local memory upper bound. Using both direct analysis and simulation, we calculate the stretch distribution of this routing scheme on random ...
Fall, Kevin   +2 more
core   +3 more sources

Space-Efficient Routing Tables for Almost All Networks and the Incompressibility Method [PDF]

open access: yes, 1999
We use the incompressibility method based on Kolmogorov complexity to determine the total number of bits of routing information for almost all network topologies. In most models for routing, for almost all labeled graphs $\Theta (n^2)$ bits are necessary
Buhrman, Harry   +2 more
core   +6 more sources

Metastable Liquid–Liquid Phase Separation and Aging Lead to Strong Processing Path Dependence in Mini‐Spidroin Solutions

open access: yesAdvanced Functional Materials, EarlyView.
Biomolecular condensates have central functions in cells and are also observed during the assembly of biological materials such as silks. For a mini‐spidroin protein, the presence of long‐lived metastable or dynamically arrested intermediate states leads to complex pathways and difficulties in identifying equilibrium states. Constructing phase diagrams
Dmitrii Fedorov   +8 more
wiley   +1 more source

Average Size of Unstretched Remote-Spanners [PDF]

open access: yes, 2009
International audienceMotivated by the optimization of link state routing in ad hoc networks, and the concept of multipoint relays, we introduce the notion of remote-spanner. Given an unweighted graph $G$, a remote spanner is a set of links $H$ such that
Jacquet, Philippe, Viennot, Laurent
core   +3 more sources

Near-shortest and K-shortest simple paths

open access: yesNetworks, 2005
Practical vehicle routing problems generally have both routing and scheduling aspects to consider. However, few heuristic methods exist that address both these complicated aspects simultaneously. We present heuristics to determine an efficient circular traversal of a weighted graph that requires a subset of its edges to be traversed, each a specified ...
Cheng-Kuan Lin   +3 more
openaire   +7 more sources

Exploring Dipolar Dynamics and Ionic Transport in Metal‐Organic Frameworks: Experimental and Theoretical Insights

open access: yesAdvanced Functional Materials, EarlyView.
In this study, the interplay of dipolar dynamics and ionic charge transport in MOF compounds is investigated. Synthesizing the novel structure CFA‐25 with integrated freely rotating dipolar groups, local and macroscopic effects, including interactions with Cs cations are explored.
Ralph Freund   +6 more
wiley   +1 more source

Compact routing for the future internet [PDF]

open access: yes, 2012
The Internet relies on its inter-domain routing system to allow data transfer between any two endpoints regardless of where they are located. This routing system currently uses a shortest path routing algorithm (modified by local policy constraints ...
Strowes, Stephen D.
core   +2 more sources

Home - About - Disclaimer - Privacy