Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Michael H Schneider"'
Autor:
Michael H. Schneider, Mario W. Kramer
Publikováno v:
Medikamente in der Urologie ISBN: 9783662614914
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd3e4cd8cd12142ded9fecaa7e5bc439
https://doi.org/10.1007/978-3-662-61492-1_15
https://doi.org/10.1007/978-3-662-61492-1_15
Autor:
Nils Gilbert, Michael H Schneider, Tomasz Ozimek, Marie C. Hupe, Axel S. Merseburger, Mario W. Kramer, Judith R Wiessmeyer, Jens Cordes
Publikováno v:
World journal of urology. 38(8)
The increasing number of flexible ureteroscopy procedures, the fragility of devices and their repair costs are a burden for urological departments worldwide. The objective was to investigate the impact of 26 pre- and intraoperative factors on reusabl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28c2f9589a5573419c07310d52b7b247
https://pubmed.ncbi.nlm.nih.gov/31659464
https://pubmed.ncbi.nlm.nih.gov/31659464
Autor:
Michael H Schneider, Marie C. Hupe, Nils Gilbert, Judith R Wiessmeyer, Axel S. Merseburger, Jens Cordes, Tomasz Ozimek, Mario W. Kramer
Publikováno v:
Journal of endourology. 32(7)
The increasing number of flexible ureterorenoscopy (fURS) procedures, the fragility of devices, and their growing repair costs represent a substantial burden for urological departments worldwide. No risk factors of flexible ureteroscope damage have b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::343cc1a74570dd21f144f4a3df9c79e7
https://pubmed.ncbi.nlm.nih.gov/29737199
https://pubmed.ncbi.nlm.nih.gov/29737199
Publikováno v:
Aktuelle Urologie. 50:585-585
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a8be55727ee311fa157e957913a8253
https://doi.org/10.1055/a-0894-9313
https://doi.org/10.1055/a-0894-9313
Publikováno v:
European Journal of Combinatorics. 16:357-369
A well-known theorem in network flow theory states that for a strongly connected digraph D = ( V , A ) there exists a set of directed cycles the incidence vectors of which form a basis for the circulation space of D and integrally span the set of int
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24701064788f64ef7968c7c23794fb1d
https://doi.org/10.1016/0195-6698(95)90017-9
https://doi.org/10.1016/0195-6698(95)90017-9
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 15:1-14
A nonnegative symmetric matrix $B$ has row maxima prescribed by a given vector $r$, if for each index $i$, the maximum entry in the $i$th row of $B$ equals $r_i$. This paper presents necessary and sufficient conditions so that for a given nonnegative
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4e210325a4c4c24ed54db12c3065eff
https://doi.org/10.1137/s0895479891222088
https://doi.org/10.1137/s0895479891222088
Autor:
Michael H. Schneider, Mark Hartmann
Publikováno v:
ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research. 38:261-267
Analgebraic flow for a digraphD=(V, A) is a generalization of acirculation forD in which the operation of addition is replaced by a binary operation defined over a commutative semigroup. A substantial literature exists in which flow-theory has been s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bdd464ee0910e8208751d8888f55d8fc
https://doi.org/10.1007/bf01416607
https://doi.org/10.1007/bf01416607
Publikováno v:
The Journal of the Acoustical Society of America. 92:3140-3156
Three-layer neural-network functions were developed to transform spectral representations of pinna-filtered stimuli at the input to a space-mapped representation of sound-source direction at the output. The inputs are modeled after transfer functions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58ea04be97b3458815c03b1f150baf46
https://doi.org/10.1121/1.404210
https://doi.org/10.1121/1.404210
Publikováno v:
Discrete Applied Mathematics. 39(3):241-261
Let G=(V,A) be a graph with vertex set V and arc set A. A flow for G is an arbitrary real-valued function defined on the arcs A. A flow f is called max-balanced if for every cut W,∅≠W⊂V, the maximum flow over arcs leaving W equals the maximum f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95d916f09f2e9617dae2cab78aa1b9a1
Autor:
Michael H. Schneider, Mark Hartmann
Publikováno v:
Mathematical Programming. 57:459-476
LetD=(V, A) be a directed graph. A real-valued vectorx defined on the arc setA is amax-balanced flow forD if for every cutW the maximum weight over arcs leavingW equals the maximum weight over arcs enteringW. For vectorslźu defined onA, we describe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::362d55477220efb982b436976e1fba19
https://doi.org/10.1007/bf01581095
https://doi.org/10.1007/bf01581095