949 resultados para Symmetric Even Graphs
Resumo:
hoṭ man eś nur in daiṭšn ... nai'i heroizgigebin ʿal-yedê ... Michl Šṭerin
Resumo:
Digitalisat der Ausg. Wilna, [1875/76]
Resumo:
mē-... Yaʿaqōv Yôsēf Ben- ... Mē'îr Sôfēr ... mim-medînat Elzus
Resumo:
Purpose To investigate the prognosis of adenocarcinomas of the upper third of the rectum and the rectosigmoid-junction without radiotherapy. Methods Patients from a multicenter randomized controlled trial from 1987–1993 on adjuvant chemotherapy for R0-resected colorectal cancers with stage I–III disease were retrospectively allocated: cancers of the lower two-thirds of the rectum (11 cm or less from anal-verge, Group A, n = 205), of the upper-third of the rectum and rectosigmoid-junction (>11–20 cm from anal-verge, Group B, n = 142), and of the colon (>20 cm from anal-verge, Group C, n = 378). The total mesorectal excision (TME) technique had not been introduced yet. The adjuvant chemotherapy turned out to be ineffective. None of the patients received neoadjuvant or adjuvant radiotherapy. Results The patients had a regular follow-up (median, 8.0 years). The 5-year disease-free survival (DFS) rate was 0.54 (95%CI, 0.47–0.60) in Group A, 0.68 (95%CI, 0.60–0.75) in Group B, and 0.69 (95%CI, 0.64–0.74) in Group C. The 5-year overall survival (OS) rate was 0.64 (95%CI, 0.57–0.71) in Group A, 0.79 (95%CI, 0.71–0.85) in Group B, and 0.77 (95%CI, 0.73–0.81) in Group C. Compared with Group C, patients in Group A had a significantly worse OS (hazard ratio [HR] for death 2.10) and a worse DFS (HR for relapse/death 1.93), while patients in Group B had a similar OS (HR 1.12) and DFS (HR 1.07). Conclusions Adenocarcinomas of the upper third of the rectum and the rectosigmoid-junction seem to have similar prognosis as colon cancers. Even for surgeons not familiar with the TME technique, preoperative radiotherapy may be avoided for most rectosigmoid cancers above 11 cm from anal-verge.
Resumo:
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity transforms to self-adjoint Laplacians. Among other things, we describe a simple way to relate the similarity transforms between Laplacians on certain graphs with elementary similarity transforms between matrices defining the boundary conditions.
Resumo:
Wernicke encephalopathy (WE) is a serious complication of bariatric surgery with significant morbidity and mortality. A few cases have been reported in the literature, mainly in patients after a Roux-en-Y gastric bypass. Since sleeve gastrectomy (SG) has become a more established and popular bariatric procedure, WE is expected to appear more frequently after SG. We performed a literature review on WE after SG, and 13 cases have been found to be sufficiently documented. The risk of WE needs to be considered in patients with a prolonged vomiting episode and any type of neurological symptoms, independent of the presence of any surgical complications.
Resumo:
Libraries of learning objects may serve as basis for deriving course offerings that are customized to the needs of different learning communities or even individuals. Several ways of organizing this course composition process are discussed. Course composition needs a clear understanding of the dependencies between the learning objects. Therefore we discuss the metadata for object relationships proposed in different standardization projects and especially those suggested in the Dublin Core Metadata Initiative. Based on these metadata we construct adjacency matrices and graphs. We show how Gozinto-type computations can be used to determine direct and indirect prerequisites for certain learning objects. The metadata may also be used to define integer programming models which can be applied to support the instructor in formulating his specifications for selecting objects or which allow a computer agent to automatically select learning objects. Such decision models could also be helpful for a learner navigating through a library of learning objects. We also sketch a graph-based procedure for manual or automatic sequencing of the learning objects.