13 research outputs found

    Wybrane aspekty funkcjonowania Sejmu w latach 1997–2007

    Get PDF
    Praca recenzowana / peer-reviewed paperPraca naukowa finansowana ze środków na naukę w latach 2006–2008 jako projekt badawczy własny Nr 1 H02E 052 3

    Purification of large volume of liquid argon for LEGEND-200

    Get PDF
    The design, construction and performance of the system capable of purifying 65m3^{3} of liquid argon to sub-ppm level designed for LEGEND–200 experiment is presented. The quality of the purified liquid argon is monitored in real-time during the purification process, by measuring the argon triplet state lifetime and simultaneous direct measurements of the concentrations of impurities such as water, oxygen, and nitrogen with a sensitivity of 0.1 ppm. The achieved argon triplet lifetime value measured inside the LEGEND cryostat, when filled in 70% of its capacity, was at the level of τ3\tau_{3} = 1.3 μs. If needed, the system may also be used later to purify liquid argon already filled into the LEGEND cryostat in the loop mode

    Iterated function systems and multifractal analysis of DNA sequences

    Get PDF

    When lower entropy implies stronger Devaney chaos

    No full text

    Topological structure and entropy of mixing graph maps

    No full text
    AbstractLet PG{ \mathcal{P} }_{G} be the family of all topologically mixing, but not exact self-maps of a topological graph GG. It is proved that the infimum of topological entropies of maps from PG{ \mathcal{P} }_{G} is bounded from below by log3/Λ(G)\log 3/ \Lambda (G), where Λ(G)\Lambda (G) is a constant depending on the combinatorial structure of GG. The exact value of the infimum on PG{ \mathcal{P} }_{G} is calculated for some families of graphs. The main tool is a refined version of the structure theorem for mixing graph maps. It also yields new proofs of some known results, including Blokh’s theorem (topological mixing implies the specification property for maps on graphs).</jats:p

    Relative and discrete utility maximising entropy

    No full text
    The notion of utility maximising entropy (u-entropy) of a probability density, which was introduced and studied by Slomczynski and Zastawniak (Ann. Prob 32 (2004) 2261-2285, arXiv:math.PR/0410115 v1), is extended in two directions. First, the relative u-entropy of two probability measures in arbitrary probability spaces is defined. Then, specialising to discrete probability spaces, we also introduce the absolute u-entropy of a probability measure. Both notions are based on the idea, borrowed from mathematical finance, of maximising the expected utility of the terminal wealth of an investor. Moreover, u-entropy is also relevant in thermodynamics, as it can replace the standard Boltzmann-Shannon entropy in the Second Law. If the utility function is logarithmic or isoelastic (a power function), then the well-known notions of the Boltzmann-Shannon and Renyi relative entropy are recovered. We establish the principal properties of relative and discrete u-entropy and discuss the links with several related approaches in the literature.Comment: 19 page

    Consistency of parliamentary groups

    No full text
    corecore