Results 131 to 140 of about 820,509 (271)

Beyond Order: Perspectives on Leveraging Machine Learning for Disordered Materials

open access: yesAdvanced Engineering Materials, EarlyView.
This article explores how machine learning (ML) revolutionizes the study and design of disordered materials by uncovering hidden patterns, predicting properties, and optimizing multiscale structures. It highlights key advancements, including generative models, graph neural networks, and hybrid ML‐physics methods, addressing challenges like data ...
Hamidreza Yazdani Sarvestani   +4 more
wiley   +1 more source

CentFlow: Centrality-Based Flow Balancing and Traffic Distribution for Higher Network Utilization

open access: yesIEEE Access, 2017
Next-generation networks (NGNs) are embracing two key principles of software defined networking (SDN) paradigm functional segregation of control and forwarding plane, and logical centralization of the control plane.
Rajesh Challa   +3 more
doaj   +1 more source

Deteksi Dan Pengendalian Kemacetan Jaringan Melalui Protokol Routing Open Shortest Path First [PDF]

open access: yes, 2017
Open Shortest Path First (OSPF) merupakan salah satu protokol routing dinamis berbasis link-state yang menggunakan algoritme Dijkstra dalam melakukan komputasi jalur terbaiknya.
Mukti, Fransiska Sisilia
core  

Monitoring and Maintaining Laser Surface Texture Quality Based on Acoustic and Optical Process Emissions during Direct Laser Interference Patterning

open access: yesAdvanced Engineering Materials, EarlyView.
Acoustic emissions during direct laser interference patterning are shown to strongly correlate with surface texture depth. By implementing a closed‐loop control system utilizing acoustic feedback, consistent microstructures with uniform depth are achieved despite laser power fluctuations.
Tobias Steege   +4 more
wiley   +1 more source

Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs [PDF]

open access: yesarXiv, 2017
In this paper we consider the decremental single-source shortest paths (SSSP) problem, where given a graph $G$ and a source node $s$ the goal is to maintain shortest distances between $s$ and all other nodes in $G$ under a sequence of online adversarial edge deletions.
arxiv  

Destination-based Routing and Circuit Allocation for Future Traffic Growth [PDF]

open access: yes, 2020
Internet traffic continues to grow relentlessly, driven largely by increasingly high- \\ resolution video streaming, the increasing adoption of cloud computing, the emergence of 5G networks, and the ever-growing reach of social media and social networks.
Yin, Ping
core  

An Examination of Aerosol Jet‐Printed Surface Roughness and its Impact on the Performance of High‐Frequency Electronics

open access: yesAdvanced Engineering Materials, EarlyView.
This study explores aerosol jet‐printed (AJP) surface roughness, its effects on the performance of microwave electronics, and its process contributors. First, an electromagnetic model is vetted for AJP's unique roughness signature. Simulations are built which show process‐induced roughness is as significant as conductor resistivity in driving microwave
Christopher Areias, Alkim Akyurtlu
wiley   +1 more source

Succinct Data Structures for Families of Interval Graphs

open access: yes, 2019
We consider the problem of designing succinct data structures for interval graphs with $n$ vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time in the $\Theta(\log n)$-bit word RAM model.
A Bar-Noy   +20 more
core   +1 more source

Home - About - Disclaimer - Privacy