Results 51 to 60 of about 279,848 (302)

Maximum Weight Scheduling Algorithm for Wireless Network Based on Congestion Control [PDF]

Jisuanji gongcheng, 2016
In wireless network,packet scheduling and congestion control are usually independently designed.This prevents the network resources from being efficiently utilized.In order to solve this problem,a new maximum weight scheduling algorithm based on ...
CHEN Chixin,ZHOU Jipeng
doaj   +1 more source

Robust Maximum Flow Network Interdiction Problem

, 2020
In this thesis, a maximum flow-based network interdiction problem considering uncertainties in arc capacities and interdiction resource consumption is solved.
Chauhan, Darshan Rajesh
core   +1 more source

Design of poiseuille flow controllers using the method of inequalities [PDF]

, 2009
This paper investigates the use of the method of inequalities (MoI) to design output-feedback compensators for the problem of the control of instabilities in a laminar plane Poiseuille flow.
Whidborne, James F., Papadakis, George, McKernan, John   +2 more
core   +1 more source

A Qualitative Analysis of Patient Perspectives and Preferences in Lupus Management to Guide Lupus Guidelines Development

Arthritis Care &Research, EarlyView.
Objective A patient‐centered approach for chronic disease management, including systemic lupus erythematosus (SLE), aligns treatment with patients’ values and preferences, leading to improved outcomes. This paper summarizes how patient experiences, perspectives, and priorities informed the American College of Rheumatology (ACR) 2024 Lupus Nephritis (LN)
Shivani Garg, Izzy Hartel, Lisa R. Sammaritano, Anca Askanase, Bonnie L. Bermas, Maria Dall'Era, Alí Duarte‐García, Victoria P. Werth, Brad Rovin, Reem A. Mustafa, Amy S. Turner, Bené Williams, Brian L. Ung, Hiya Bhavsar, Monique C. Gore‐Massy, Nahirannette Pulido, Natacha Guerrero, Natalie M. Smith, Wambui Machua, Linda T. Hiraki, Mary Beth Son   +20 more
wiley   +1 more source

The maximum flow in dynamic networks [PDF]

Computer Science Journal of Moldova, 2005
The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj  

A Return to Normality: A Descriptive Qualitative Interview Study Exploring the Patient Experience of Gout Flare Resolution

Arthritis Care &Research, EarlyView.
Objective Although the definition of a gout flare is well established, the state of gout flare resolution has not yet been defined. This study aimed to explore patients’ experiences and perceptions of gout flare resolution. Methods Semistructured interviews were conducted with 24 people with gout, guided by open‐ended questions exploring their ...
Sarah Stewart, Anne Horne, Angelo Gaffo, Lisa K. Stamp, N. Lawrence Edwards, Nicola Dalbeth   +5 more
wiley   +1 more source

Quantum optimization methods in water flow control [PDF]

E3S Web of Conferences
This paper examines the problem of optimizing water flow control in order to minimize costs, represented as the square of the water flow. This takes into account restrictions on this flow, such as the maximum flow value.
Muhamediyeva Dilnoz, Niyozmatova Nilufar, Yusupova Dilfuza, Samijonov Boymirzo   +3 more
doaj   +1 more source

Adaptive Observer for Coupled Wave PDE and Infinite ODE With Sampled Data and Unknown Input: Application to Brain Hemodynamics Estimation

International Journal of Adaptive Control and Signal Processing, EarlyView.
This article proposes a convergent adaptive observer for a damped wave PDE and an infinite‐dimensional ODE coupled in cascade using sampled‐in‐space ODE state measurements. The proposed observer estimates the distributed states of the PDE and ODE along with unknown PDE parameters and spatial input.
Zehor Belkhatir, Sarah Mechhoud, Taous‐Meriem Laleg‐Kirati   +2 more
wiley   +1 more source

A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph [PDF]

Network Biology
A bit-arc capacity scaling algorithm to solve the maximal flow problem subjected to box constraints on the flow vector in directed network has been presented. The algorithm is mainly based on successive divisions of capacities by multiples of two.
Muhammad Tlas
doaj  

Connectome graphs and maximum flow problems

CoRR, 2014
We propose to study maximum flow problems for connectome graphs. We suggest a few computational problems: finding vertex pairs with maximal flow, finding new edges which would increase the maximal flow. Initial computation results for some publicly available connectome graphs are described.
openaire   +2 more sources