An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow

1992 ◽  
pp. 39-62 ◽  
Author(s):  
U. Derigs ◽  
W. Meier
Keyword(s):  
Data Structures ◽  
Maximum Flow

Specification scheme for the visualisation of data structures

1994 ◽  
Vol 9 (3) ◽  
pp. 127
Author(s):  
X.-B. Lu ◽  
F. Stetter
Keyword(s):  
Data Structures

Outcome of Buccal Mucosal Graft Urethroplasty in Long Segment Anterior Urethral Stricture

2020 ◽  
Vol 19 (2) ◽  
pp. 64-68
Author(s):  
Mrinmoy Biswas ◽  
Sudip Das Gupta ◽  
Mohammed Mizanur Rahman ◽  
Sharif Mohammad Wasimuddin
Keyword(s):  
Urethral Stricture ◽  
Flow Rate ◽  
Surgical Outcome ◽  
Simple Technique ◽  
Anterior Segment ◽  
Maximum Flow ◽  
Anastomotic Site ◽  
Buccal Mucosal Graft ◽  
Male Patients

Objective: To assess the success of BMG urethroplasty in long segment anterior urethral stricture. Method: From January 2014 to December 2015, twenty male patients with long anterior segment urethral stricture were managed by BMG urethroplasty. After voiding trial they were followed up at 3 month with Uroflowmetry, RGU & MCU and PVR measurement by USG. Patients were further followed up with Uroflowmetry and PVR at 6 months interval.Successful outcome was defined as normal voiding with a maximum flow rate >15ml /sec and PVR<50 ml with consideration of maximum one attempt of OIU after catheter removal. Results: Mean stricture length was 5.2 cm (range 3-9 cm) and mean follow-up was 15.55 months (range 6-23 months). Only two patients developed stricture at proximal anastomotic site during follow-up. One of them voided normally after single attempt of OIU. Other one required second attempt of OIU and was considered as failure (5%). Conclusion: BMG urethroplasty is a simple technique with good surgical outcome. Bangladesh Journal of Urology, Vol. 19, No. 2, July 2016 p.64-68

Tidal Flow: A Fast and Teachable Maximum Flow Algorithm

2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE
Keyword(s):  
Computer Science ◽  
Tidal Flow ◽  
Maximum Flow ◽  
Efficient Algorithms ◽  
Science Students ◽  
Flow Algorithm ◽  
Maximum Flows

Among the most interesting problems in competitive programming involve maximum flows. However, efficient algorithms for solving these problems are often difficult for students to understand at an intuitive level. One reason for this difficulty may be a lack of suitable metaphors relating these algorithms to concepts that the students already understand. This paper introduces a novel maximum flow algorithm, Tidal Flow, that is designed to be intuitive to undergraduate andpre-university computer science students.

ASSESSMENT OF HYDROLOGICAL CHANGES IN THE ŠUŠVĖ RIVER

2015 ◽  
Author(s):  
Gražina ŽIBIENĖ ◽  
Alvydas ŽIBAS ◽  
Goda BLAŽAITYTĖ
Keyword(s):  
Hydrological Regime ◽  
Maximum Flow ◽  
Environmental Flow ◽  
Physical Structure ◽  
River Channels ◽  
Hydrologic Alteration ◽  
Water Conditions ◽  
Flow Components ◽  
The Impact ◽  
Large Floods

The construction of dams in rivers negatively affects ecosystems because dams violate the continuity of rivers, transform the biological and physical structure of the river channels, and the most importantly – alter the hydrological regime. The impact on the hydrology of the river can occur through reducing or increasing flows, altering seasonality of flows, changing the frequency, duration and timing of flow events, etc. In order to determine the extent of the mentioned changes, The Indicators of Hydrologic Alteration (IHA) software was used in this paper. The results showed that after the construction of Angiriai dam, such changes occurred in IHA Parameters group as: the water conditions of April month decreased by 31 %; 1-day, 3-days, 7-days and 30-days maximum flow decreased; the date of minimum flow occurred 21 days later; duration of high and low pulses and the frequency of low pulses decreased, but the frequency of high pulses increased, etc. The analysis of the Environmental Flow Components showed, that the essential differences were recorded in groups of the small and large floods, when, after the establishment of the Šušvė Reservoir, the large floods no longer took place and the probability of frequency of the small floods didn’t exceed 1 time per year.

Integrating Improved U-Net and Continuous Maximum Flow Algorithm for 3D Brain Tumor Image Segmentation

2020 ◽  
Vol 64 (4) ◽  
pp. 40412-1-40412-11
Author(s):  
Kexin Bai ◽  
Qiang Li ◽  
Ching-Hsin Wang
Keyword(s):  
Brain Tumor ◽  
Data Augmentation ◽  
A Priori ◽  
Class Imbalance ◽  
Maximum Flow ◽  
Magnetic Resonance Images ◽  
Tumor Segmentation ◽  
Similarity Coefficients ◽  
Segmentation Algorithms ◽  
Flow Algorithm

Abstract To address the issues of the relatively small size of brain tumor image datasets, severe class imbalance, and low precision in existing segmentation algorithms for brain tumor images, this study proposes a two-stage segmentation algorithm integrating convolutional neural networks (CNNs) and conventional methods. Four modalities of the original magnetic resonance images were first preprocessed separately. Next, preliminary segmentation was performed using an improved U-Net CNN containing deep monitoring, residual structures, dense connection structures, and dense skip connections. The authors adopted a multiclass Dice loss function to deal with class imbalance and successfully prevented overfitting using data augmentation. The preliminary segmentation results subsequently served as the a priori knowledge for a continuous maximum flow algorithm for fine segmentation of target edges. Experiments revealed that the mean Dice similarity coefficients of the proposed algorithm in whole tumor, tumor core, and enhancing tumor segmentation were 0.9072, 0.8578, and 0.7837, respectively. The proposed algorithm presents higher accuracy and better stability in comparison with some of the more advanced segmentation algorithms for brain tumor images.

The Social Furniture of Virtual Worlds

Disputatio ◽  
2019 ◽  
Vol 11 (55) ◽  
pp. 345-369
Author(s):  
Peter Ludlow
Keyword(s):  
Large Class ◽  
Data Structures ◽  
Virtual Worlds ◽  
Causal Powers ◽  
Virtual Objects ◽  
David Chalmers ◽  
The Social

AbstractDavid Chalmers argues that virtual objects exist in the form of data structures that have causal powers. I argue that there is a large class of virtual objects that are social objects and that do not depend upon data structures for their existence. I also argue that data structures are themselves fundamentally social objects. Thus, virtual objects are fundamentally social objects.

Sign in / Sign up

Export Citation Format

Share Document