Query:
faculty: "UvA" and publication year: "2000"
Authors  Paul Beneker, Jan Wiegerinck  Title  Exposedness in Hardy spaces of domains of finite connectivity 
Publisher  s.n. 
Year  2000 
Faculty  UvA 
Institute/dept.  UvA: Universiteitsbibliotheek 
Keywords  Strongly exposed point, exposed point, Hardy space 
Abstract  In this paper we investigate various properties of (strongly) exposed points in the unit ball of the Hardy space $H^1$ over a domain of finite connectivity, and discuss how these compare with results for the unit disc.SR4260821419191919Credit in Acceptance Sampling on Attributesuva/uba/fnwi/kvi114544Klaassen;;Chris A.J.;;Credit is introduced in acceptance sampling on attributes and a Credit Based Acceptance sampling system is developed that is very easy to apply in practice. The credit of a producer is defined as the total number of items accepted since the last rejection. In our sampling system the sample size for a lot depends via a simple function on the lot size, the credit, and the chosen guaranteed upper limit on the outgoing quality, and will be much smaller than in isolated lot inspection. Our Credit Based Acceptance sampling system also yields a simple continuous sampling plan.SR4270320519781978Van zwarte pieten en witte boorden: beslissingsmomenten bij de opsporing van Hinderwetovertredingen185572uva/uba/fdrUtrechtArs Aequi Libri9070094274Beslissingsmomenten in het strafrecht1201991020210;1;01;21122100;;;08;01;01091977Brants;;C.;;Gunther Moor;;L.G.H.;Leuw;;E.;4280120519771977Kernenergie en de bedreiging van de persoonlijke levenssfeer31482919779101290101uva/uba/fdr1201971020210;1;01;21122100;;;08;01;01091977Hoeven;van der;E.;;4290821419191919Function algebras on disksuva/uba/fnwi/kvi114562Nguyen;;Quang Dieu;;Paepe;;Peter de;;For a small closed disk $D$ in the complex plane the uniform closure $A$ in $C(D)$ of the polynomials in $z^2$ and a second function of the form $f^2$, with $f$ behaving as $\bar z$, is considered. It has been shown before, using theory of polynomial convexity, that $A \ne C(D)$ for some choices of $f$, while for other choices of $f$ the situation $A=C(D)$ can occur. A new class of functions $f$ is presented for which $A=C(D)$.SR4300821419191919Covariant Thermodynamics of Quantum Systems: Passivity, Semipassivity, and the Unruh Effectuva/uba/fnwi/kvi114563Kuckert;;Bernd;;According to the Second Law of Thermodynamics, cycles applied to thermodynamic equilibrium states cannot perform any work (passivity property of thermodynamic equilibrium states). In the presence of matter this can hold only in the rest frame of the matter, as moving matter makes windmills and turbines run. If, however, one assumes for a homogeneous and stationary state that no cycle can perform more work than an ideal windmill, one finds that there is some inertial frame where the state is a thermodynamic equilibrium state. This provides a covariant characterization of thermodynamic equilibrium states. In the absence of matter, cycles can perform work only when driven by nonstationary inertial forces. If this is taken as a definition of a (pure) vacuum state of a relativistic quantum field theory, one can derive the spectrum condition and the Unruh effect.SR4310821419191919Asymptotically exact heuristics for (near) primitive roots. IIuva/uba/fnwi/kvi114565Moree;;Pieter;;Let g be a nonzero rational number. Let N_{g,t}(x) denote the number of primes p<=x such that the subgroup of the multiplicative group of the finite field having p elements generated by g mod p is of residual index t. Under the Generalized Riemann Hypothesis we investigate the quantity N_{g,t}(x) and in particular simplify the work carried out in part I (which appeared in J. Number Theory 83 (2000), 155181).SR4320821419191919On hidden Markov chains and finite stochastic systemsuva/uba/fnwi/kvi1145661027650;1;01;23960040;;;03;01;01021999In this paper we study various properties of finite stochastic systems or hidden Markov chains as they are alternatively called. We discuss their construction following different approaches and we also derive recursive filtering formulas for the different systems that we consider. The key tool is a simple lemma on conditional expectations.SR4330821419191919Solving the Gleason problem on linearly convex domainsuva/uba/fnwi 
Document type  Report 
Download  
Document finder 

Use this url to link to this page: http://dare.uva.nl/en/record/114543
Contact us about this recordNotify a colleague
Add to bookbag
