Edmonds' fundamental theorem on arborescences characterizes the existence of $k$ pairwise arc-disjoint spanning with prescribed root sets in a digraph. In this paper, we study problem packing branchings digraphs under cardinality constraints their by arborescence augmentation. Let $D=(V+x,A)$ be digraph, $\mathcal{P}=$ $\{I_{1}, \ldots, I_{l} \}$ partition $[k]$, $c_{1}, c_{l}, c'_{1}, c'_{l}$ ...

Using the notion of “belongingness ($epsilon$)” and “quasi-coincidence (q)” of fuzzy points with fuzzy sets, we introduce the concept of an ($ alpha, beta$)- fuzzyHv-ideal of an Hv-ring, where , are any two of {$epsilon$, q,$epsilon$ $vee$ q, $epsilon$ $wedge$ q} with $ alpha$ $neq$ $epsilon$ $wedge$ q. Since the concept of ($epsilon$, $epsilon$ $vee$ q)-fuzzy Hv-ideals is an important and ...

The aim of this paper is to advance the presentation of low-level benchmarking results in the form of performance prooles, which present concisely on one or two pages the single-or multi-processor performance results. A proole consists of measured and derived performance parameters which characterise the performance of parallel computers. In order to achieve a more systematic approach to low-le...

One-class support vector machines (1-SVMs) estimate the level set of the underlying density observed data. Aside the kernel selection issue, one difficulty concerns the choice of the ’level’ parameter. In this paper, following the work by Hastie et. al (2004), we derive the entire regularization path for ν-1-SVMs. Since this regularization path is efficient for building different level sets est...