Locations of Medians on Stochastic Networks

The definition of network medians is extended to the case where travel times on network links are random variables with known discrete probability distributions. Under a particular set of assumptions, it is shown that the well-known theorems of HAKIMI and of LEVY can be extended to such stochastic networks. The concepts are further extended to the case of stochastic oriented networks. A particular set of applications as well as formulations of the problem for solution using mathematical programming techniques are also discussed briefly

ATTITUDES AND PERCEPTIONS OF LIVING KIDNEY DONOR EVALUATION

poster abstractIntroduction: Attitudes and perceptions of living kidney donors are im-portant aspects to the organ donation process. Few patient-centered studies exist which focus on broad health outcomes and expectations of living kid-ney donors. This is of practical concern due to the trend of decreasing donor numbers observed in the last decade (U.S. Department of Health and Human Services, Health Resources and Services Administration, 2011). While fol-low-up care is a crucial part of the donation process, few studies address the importance of follow-up care and its implications on the health status of the donor following his/her donation. This study aims to evaluate attitudes and perceptions of living kidney donors regarding their total donation experience. Data collected will shape policy recommendations pertaining to the standard of follow-up care for living kidney donors. Methods: The present study uses an electronic survey tool to evaluate living kidney donors’ satisfaction with their post-donation follow-up care. All living kidney donors are eligible. Recruitment is via social networking sites with active donor members; successfully recruited participants receive an e-mail with the study information sheet and a link to the brief survey. Results: Completed survey responses are coded and analyzed using sta-tistical coding software. Data produced will illustrate any patient reported negative health outcomes across multiple transplant centers, attitudes about donor follow-up care, and policy recommendations

Generalized iterated wreath products of cyclic groups and rooted trees correspondence

Consider the generalized iterated wreath product $\mathbb{Z}_{r_1}\wr \mathbb{Z}_{r_2}\wr \ldots \wr \mathbb{Z}_{r_k}$ where $r_i \in \mathbb{N}$. We prove that the irreducible representations for this class of groups are indexed by a certain type of rooted trees. This provides a Bratteli diagram for the generalized iterated wreath product, a simple recursion formula for the number of irreducible representations, and a strategy to calculate the dimension of each irreducible representation. We calculate explicitly fast Fourier transforms (FFT) for this class of groups, giving literature's fastest FFT upper bound estimate.Comment: 15 pages, to appear in Advances in the Mathematical Science

Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence

Consider the generalized iterated wreath product $S_{r_1}\wr \ldots \wr S_{r_k}$ of symmetric groups. We give a complete description of the traversal for the generalized iterated wreath product. We also prove an existence of a bijection between the equivalence classes of ordinary irreducible representations of the generalized iterated wreath product and orbits of labels on certain rooted trees. We find a recursion for the number of these labels and the degrees of irreducible representations of the generalized iterated wreath product. Finally, we give rough upper bound estimates for fast Fourier transforms.Comment: 18 pages, to appear in Advances in the Mathematical Sciences. arXiv admin note: text overlap with arXiv:1409.060

A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs

In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable N and any convex separable objective function. We conclude with two sample applications, stochastic integer programs with second-order dominance constraints and stochastic integer multi-commodity flows, which (for fixed blocks) can be solved in polynomial time in the number of scenarios and commodities and in the binary encoding length of the input data. In the proof of our main theorem we combine several non-trivial constructions from the theory of Graver bases. We are confident that our approach paves the way for further extensions

Axiomatic Characterization of the Mean Function on Trees

A mean of a sequence π = (x1, x2, . . . , xk) of elements of a finite metric space (X, d) is an element x for which is minimum. The function Mean whose domain is the set of all finite sequences on X and is defined by Mean(π) = { x | x is a mean of π } is called the mean function on X. In this paper the mean function on finite trees is characterized axiomatically

Business process modelling and visualisation to support e-government decision making: Business/IS alignment

© 2017 Springer-Verlag. The final publication is available at Springer via https://doi.org/10.1007/978-3-319-57487-5_4.Alignment between business and information systems plays a vital role in the formation of dependent relationships between different departments in a government organization and the process of alignment can be improved by developing an information system (IS) according to the stakeholders’ expectations. However, establishing strong alignment in the context of the eGovernment environment can be difficult. It is widely accepted that business processes in the government environment plays a pivotal role in capturing the details of IS requirements. This paper presents a method of business process modelling through UML which can help to visualise and capture the IS requirements for the system development. A series of UML models have been developed and discussed. A case study on patient visits to a healthcare clinic in the context of eGovernment has been used to validate the models

Maximum gradient embeddings and monotone clustering

Let (X,d_X) be an n-point metric space. We show that there exists a distribution D over non-contractive embeddings into trees f:X-->T such that for every x in X, the expectation with respect to D of the maximum over y in X of the ratio d_T(f(x),f(y)) / d_X(x,y) is at most C (log n)^2, where C is a universal constant. Conversely we show that the above quadratic dependence on log n cannot be improved in general. Such embeddings, which we call maximum gradient embeddings, yield a framework for the design of approximation algorithms for a wide range of clustering problems with monotone costs, including fault-tolerant versions of k-median and facility location.Comment: 25 pages, 2 figures. Final version, minor revision of the previous one. To appear in "Combinatorica

Granular cell tumor presenting as a tongue nodule: two case reports

<p>Abstract</p> <p>Introduction</p> <p>Granular cell tumor is an uncommon neoplasm that can occur in any part of the body, including the orofacial region. The tumor is usually benign, but there are reports of cases in which the tumor shows a locally aggressive behavior, malignancy, and distant metastases. The most widely accepted hypothesis is that granular cell tumor arises from the altered metabolism of Schwann cells. The tumor is typically asymptomatic and appears as a nodule that does not exceed 3 cm.</p> <p>Case presentation</p> <p>In case 1, a 26-year-old Caucasian man was seen at the Oral Medicine out-patient clinic of the São José dos Campos Dental School, Universidade Estadual Paulista, with a 'small blister on the tongue', which he had noted approximately three years ago. The nodule was located on the dorsum of the tongue, measured about 1.5 cm in diameter, and was not tender to palpation. Treatment consisted of an excisional biopsy performed on the basis of the diagnostic hypothesis of granular cell tumor, which was confirmed by microscopic analysis. In case 2, a 31-year-old Caucasian woman attended the out-patient clinic of the São José dos Campos Dental School, Universidade Estadual Paulista, with a five-year history of a 'painful lump on the tongue'. Intra-oral examination revealed the presence of a nodular lesion measuring approximately 0.8 cm in diameter, which was located deep in the submucosa of the right lateral margin of the tongue. Treatment consisted of an excisional biopsy performed on the basis of the differential diagnosis of neurofibroma and granular cell tumor. Microscopic analysis defined the final diagnosis of granular cell tumor.</p> <p>Conclusions</p> <p>Granular cell tumor is an uncommon tumor that must be carefully diagnosed and treated correctly.</p