Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to obtain a connected graph in which all th...

Introduction: Generally, geometrical parameters of the cyclone have a profound effect on determining its performance. The air outlet (Vortex Finder) as one of the cyclone’s components has a significant impact on the cyclone’s internal flow pattern, pressure drop and even dust removal efficiency. Material and Methods: Two different air outlets were designed in order to be easily installed and r...

We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle are partitioned into two matchings canonically. A matching defines a single step, the two matchings form a single round. Processors connected by an edge of the matching perfectly balance their loads, and, if there is an excess to...

Trus paper is concerned with the average rUDDing time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number p of processors used. We show that Batcher's odd-even merge (for two sorted lists of length n each) can be implemented to run in time O«nlp)(log(2 + p2 In))) on the avera...

Based on the charge independence hypothesis the properties of V particles are theoretically investigated. It is found that the curious behaviours of these unstable particles are most simply interpreted in terms of the 1}-charge conservation law which directly results from the C. I. hypothesis and suitable isotopic spin assignments to these particles. The topics which are discussed in this paper...