We consider the case 1 interval censorship model in which the survival time has an arbitrary distribution function F 0 and the inspection time has a discrete distribution function G. In such a model one is only able to observe the inspection time and whether the value of the survival time lies before or after the inspection time. We prove the strong consistency of the generalized maximum likeli...

In 1979, two constructions for making partitionable graphs were introduced in (by Chv2 atal et al. (Ann. Discrete Math. 21 (1984) 197)). The graphs produced by the second construction are called CGPW graphs. A near-factorization (A; B) of a %nite group is roughly speaking a non-trivial factorization of G minus one element into two subsets A and B. Every CGPW graph with n vertices turns out to b...

We discuss the properties of strictly typed languages on the one hand and soft typing on the other one and identify disadvantages of these approaches to type checking in the context of powerful type languages. To overcome the problems we develop an approach that combines ideas of both strict and soft typing. This approach is based on the concept of complete typing that is guaranteed to accept e...

We classify, in a non-trivial amenable collection of functors, all 2-chains up to the relation of having the same 1-shell boundary. In particular, we prove that in a rosy theory, every 1-shell of a Lascar strong type is the boundary of some 2-chain, hence making the 1st homology group trivial. We also show that, unlike in simple theories, in rosy theories there is no upper bound on the minimal ...

Let λ be א0 or a strong limit of cofinality א0. Suppose that 〈Gm, πm,n : m ≤ n < ω〉 and 〈Hm, π t m,n : m ≤ n < ω〉 are projective systems of groups of cardinality less than λ and suppose that for every n < ω there is a homorphism σ : Hn → Gn such that all the diagrams commute. If for every μ < λ there exists 〈fi ∈ Gω : i < μ〉 such that i 6= j =⇒ fif −1 j 6∈ σω(Hω) then there exists 〈fi ∈ Gω : i ...

Our work deals with the synthesis of multispectral images at a better spatial resolution by the means of another image having such a resolution. We show the lack of standard procedure to assess the expected benefits of fused products. We discuss the case of the reference that is missing in most cases. We discuss the principles of the assessment protocol. One principle is that the constructed sy...

This paper extends the scenario of the Four Color Theorem in the following way. LetHd,k be the set of all k-uniform hypergraphs that can be (linearly) embedded into Rd . We investigate lower and upper bounds on the maximum (weak and strong) chromatic number of hypergraphs in Hd,k. For example, we can prove that for d ≥ 3 there are hypergraphs inH2d−3,d on n vertices whose weak chromatic number ...

We consider the damped and driven two-dimensional Euler equations in the plane with weak solutions having finite energy and enstrophy. We show that these (possibly non-unique) solutions satisfy the energy and enstrophy equality. It is shown that this system has a strong global and a strong trajectory attractor in the Sobolev space H. A similar result on the strong attraction holds in the spaces...