811 research outputs found

    Mappings of least Dirichlet energy and their Hopf differentials

    Full text link
    The paper is concerned with mappings between planar domains having least Dirichlet energy. The existence and uniqueness (up to a conformal change of variables in the domain) of the energy-minimal mappings is established within the class Hˉ2(X,Y)\bar{\mathscr H}_2(X, Y) of strong limits of homeomorphisms in the Sobolev space W1,2(X,Y)W^{1,2}(X, Y), a result of considerable interest in the mathematical models of Nonlinear Elasticity. The inner variation leads to the Hopf differential hzhzˉˉdzdzh_z \bar{h_{\bar{z}}} dz \otimes dz and its trajectories. For a pair of doubly connected domains, in which XX has finite conformal modulus, we establish the following principle: A mapping hHˉ2(X,Y)h \in \bar{\mathscr H}_2(X, Y) is energy-minimal if and only if its Hopf-differential is analytic in XX and real along the boundary of XX. In general, the energy-minimal mappings may not be injective, in which case one observes the occurrence of cracks in XX. Nevertheless, cracks are triggered only by the points in the boundary of YY where YY fails to be convex. The general law of formation of cracks reads as follows: Cracks propagate along vertical trajectories of the Hopf differential from the boundary of XX toward the interior of XX where they eventually terminate before making a crosscut.Comment: 51 pages, 4 figure

    How to Choose a Champion

    Full text link
    League competition is investigated using random processes and scaling techniques. In our model, a weak team can upset a strong team with a fixed probability. Teams play an equal number of head-to-head matches and the team with the largest number of wins is declared to be the champion. The total number of games needed for the best team to win the championship with high certainty, T, grows as the cube of the number of teams, N, i.e., T ~ N^3. This number can be substantially reduced using preliminary rounds where teams play a small number of games and subsequently, only the top teams advance to the next round. When there are k rounds, the total number of games needed for the best team to emerge as champion, T_k, scales as follows, T_k ~N^(\gamma_k) with gamma_k=1/[1-(2/3)^(k+1)]. For example, gamma_k=9/5,27/19,81/65 for k=1,2,3. These results suggest an algorithm for how to infer the best team using a schedule that is linear in N. We conclude that league format is an ineffective method of determining the best team, and that sequential elimination from the bottom up is fair and efficient.Comment: 6 pages, 3 figure

    Optimal transport on wireless networks

    Get PDF
    We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on wireless networks. Our algorithm iteratively balances network traffic by minimizing the maximum node betweenness on the network. The variant we consider specifically accounts for the broadcast restrictions imposed by wireless communication by using a different betweenness measure. We compare the performance of our algorithm to two other known algorithms and find that our algorithm achieves the highest transport capacity both for minimum node degree geometric networks, which are directed geometric networks that model wireless communication networks, and for configuration model networks that are uncorrelated scale-free networks.Comment: 5 pages, 4 figure

    Injectivity of sections of convex harmonic mappings and convolution theorems

    Get PDF
    In the article the authors consider the class H0{\mathcal H}_0 of sense-preserving harmonic functions f=h+gf=h+\overline{g} defined in the unit disk z<1|z|<1 and normalized so that h(0)=0=h(0)1h(0)=0=h'(0)-1 and g(0)=0=g(0)g(0)=0=g'(0), where hh and gg are analytic in the unit disk. In the first part of the article we present two classes PH0(α)\mathcal{P}_H^0(\alpha) and GH0(β)\mathcal{G}_H^0(\beta) of functions from H0{\mathcal H}_0 and show that if fPH0(α)f\in \mathcal{P}_H^0(\alpha) and FGH0(β)F\in\mathcal{G}_H^0(\beta), then the harmonic convolution is a univalent and close-to-convex harmonic function in the unit disk provided certain conditions for parameters α\alpha and β\beta are satisfied. In the second part we study the harmonic sections (partial sums) sn,n(f)(z)=sn(h)(z)+sn(g)(z), s_{n, n}(f)(z)=s_n(h)(z)+\overline{s_n(g)(z)}, where f=h+gH0f=h+\overline{g}\in {\mathcal H}_0, sn(h)s_n(h) and sn(g)s_n(g) denote the nn-th partial sums of hh and gg, respectively. We prove, among others, that if f=h+gH0f=h+\overline{g}\in{\mathcal H}_0 is a univalent harmonic convex mapping, then sn,n(f)s_{n, n}(f) is univalent and close-to-convex in the disk z<1/4|z|< 1/4 for n2n\geq 2, and sn,n(f)s_{n, n}(f) is also convex in the disk z<1/4|z|< 1/4 for n2n\geq2 and n3n\neq 3. Moreover, we show that the section s3,3(f)s_{3,3}(f) of fCH0f\in {\mathcal C}_H^0 is not convex in the disk z<1/4|z|<1/4 but is shown to be convex in a smaller disk.Comment: 16 pages, 3 figures; To appear in Czechoslovak Mathematical Journa

    Caspase-8 binding to cardiolipin in giant unilamellar vesicles provides a functional docking platform for bid

    Get PDF
    Caspase-8 is involved in death receptor-mediated apoptosis in type II cells, the proapoptotic programme of which is triggered by truncated Bid. Indeed, caspase-8 and Bid are the known intermediates of this signalling pathway. Cardiolipin has been shown to provide an anchor and an essential activating platform for caspase-8 at the mitochondrial membrane surface. Destabilisation of this platform alters receptor-mediated apoptosis in diseases such as Barth Syndrome, which is characterised by the presence of immature cardiolipin which does not allow caspase-8 binding. We used a simplified in vitro system that mimics contact sites and/or cardiolipin-enriched microdomains at the outer mitochondrial surface in which the platform consisting of caspase-8, Bid and cardiolipin was reconstituted in giant unilamellar vesicles. We analysed these vesicles by flow cytometry and confirm previous results that demonstrate the requirement for intact mature cardiolipin for caspase-8 activation and Bid binding and cleavage. We also used confocal microscopy to visualise the rupture of the vesicles and their revesiculation at smaller sizes due to alteration of the curvature following caspase-8 and Bid binding. Biophysical approaches, including Laurdan fluorescence and rupture/tension measurements, were used to determine the ability of these three components (cardiolipin, caspase-8 and Bid) to fulfil the minimal requirements for the formation and function of the platform at the mitochondrial membrane. Our results shed light on the active functional role of cardiolipin, bridging the gap between death receptors and mitochondria

    Characterization of a caspase-3-substrate kinome using an N- and C-terminally tagged protein kinase library produced by a cell-free system

    Get PDF
    Caspase-3 (CASP3) cleaves many proteins including protein kinases (PKs). Understanding the relationship(s) between CASP3 and its PK substrates is necessary to delineate the apoptosis signaling cascades that are controlled by CASP3 activity. We report herein the characterization of a CASP3-substrate kinome using a simple cell-free system to synthesize a library that contained 304 PKs tagged at their N- and C-termini (NCtagged PKs) and a luminescence assay to report CASP3 cleavage events. Forty-three PKs, including 30 newly identified PKs, were found to be CASP3 substrates, and 28 cleavage sites in 23 PKs were determined. Interestingly, 16 out of the 23 PKs have cleavage sites within 60 residues of their N- or C-termini. Furthermore, 29 of the PKs were cleaved in apoptotic cells, including five that were cleaved near their termini in vitro. In total, approximately 14% of the PKs tested were CASP3 substrates, suggesting that CASP3 cleavage of PKs may be a signature event in apoptotic-signaling cascades. This proteolytic assay method would identify other protease substrates

    No evidence of response bias in a populationbased childhood cancer survivor questionnaire survey-Results from the Swiss Childhood Cancer Survivor Study

    Get PDF
    Purpose This is the first study to quantify potential nonresponse bias in a childhood cancer survivor questionnaire survey. We describe early and late responders and nonresponders, and estimate nonresponse bias in a nationwide questionnaire survey of survivors. Methods In the Swiss Childhood Cancer Survivor Study, we compared characteristics of early responders (who answered an initial questionnaire), late responders (who answered after ≥1 reminder) and nonresponders. Sociodemographic and cancer-related information was available for the whole population from the Swiss Childhood Cancer Registry. We compared observed prevalence of typical outcomes in responders to the expected prevalence in a complete (100% response) representative population we constructed in order to estimate the effect of nonresponse bias. We constructed the complete population using inverse probability of participation weights. Results Of 2328 survivors, 930 returned the initial questionnaire (40%); 671 returned the questionnaire after ≥1reminder (29%). Compared to early and late responders, we found that the 727 nonresponders (31%) were more likely male, aged <20 years, French or Italian speaking, of foreign nationality, diagnosed with lymphoma or a CNS or germ cell tumor, and treated only with surgery. But observed prevalence of typical estimates (somatic health, medical care, mental health, health behaviors) was similar among the sample of early responders (40%), all responders (69%), and the complete representative population (100%). In this survey, nonresponse bias did not seem to influence observed prevalence estimates. Conclusion Nonresponse bias may play only a minor role in childhood cancer survivor studies, suggesting that results can be generalized to the whole population of such cancer survivors and applied in clinical practice
    corecore