Using almost disjoint coding we prove the consistency of the existence of a 1 2 definable -mad family of infinite subsets of (resp. functions from to ) together with b = 2 = 2.
Let κ < λ be regular uncountable cardinals. Using a finite support iteration of ccc posets we obtain the consistency of b = a = κ < s = λ. If µ is a measurable cardinal...
Let A [] be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indest...
The quality evaluation of open source software (OSS) products, e.g., defect estimation and prediction approaches of individual releases, gains importance with increasing OSS adopt...
Dindin Wahyudin, Alexander Schatten, Dietmar Winkl...
MAD (Movie Authoring and Design) is a novel design and authoring system that facilitates the process of creating dynamic visual presentations such as motion pictures and lecture-d...
Ronald Baecker, Alan J. Rosenthal, Naomi Friedland...