Type of packings and characteristics of their geometry can affect the flow behavior in the reactive distillation columns. KATAPAK SP is one the newest modular catalytic structured packings (MCSP) that has been used in the reactive distillation columns, recently. However, there is not any study on the hydrodynamics of this packing by using computational fluid dynamics. In the present work, a 3D ...

Given a non-decreasing sequence S = (s1, s2, . . . , sk) of positive integers, an Spacking edge-coloring of a graph G is a partition of the edge set of G into k subsets {X1,X2, . . . ,Xk} such that for each 1 ≤ i ≤ k, the distance between two distinct edges e, e′ ∈ Xi is at least si + 1. This paper studies S-packing edgecolorings of cubic graphs. Among other results, we prove that cubic graphs ...

In PATH SET PACKING, the input is an undirected graph G, a collection $$\mathcal{P}$$ of simple paths in and positive integer k. The problem to decide whether there exist k edge-disjoint . We study parameterized complexity PACKING with respect both natural structural parameters. show that W[1]-hard vertex cover plus maximum length path , pathwidth degree solution size. These results answer open...

Packing non-identical circles inside a rectangle witnesses a wide range of industrial applications. However, the non-convex constraints in this problem make it intractable using exact analytical approaches. Even via heuristic methods, the solution time for industrial-scale instances sometimes is too long to be acceptable. This article aims to challenge the existing methods for the benchmark ins...

We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard) bin packing problem with cardinality constraints which is an important version of bin packing, introduced by Krause, Shen and Schwetman already in 1975. Following previous work on the unbounded space online problem, we e...

Let R d be an open set of measure 1. An open set D R d is called a tight orthogonal packing region for if D ? D does not intersect the zeros of the Fourier Transform of the indicator function of and D has measure 1. Suppose that is a discrete subset of R d. The main contribution of this paper is a new way of proving the folowing result (proved by Lagarias, Reeds and Wang and, in the case of bei...

INTRODUCTION Acute pancreatitis appears to be less prevalent in multi-ethnic Southeast Asia, where the aetiology also appears to be influenced by ethnicity. As with acute pancreatitis elsewhere, however, pancreatic necrosis is a cause of significant mortality and the aim of this study was to review our institutional experience with pancreatic necrosectomy. MATERIALS AND METHODS The records of...

In this paper, the effects of two different Particle Size Distributions (PSD) on packingbehavior of ideal rigid spherical nanoparticles using a novel packing model based on parallelalgorithms have been reported. A mersenne twister algorithm was used to generate pseudorandomnumbers for the particles initial coordinates. Also, for this purpose a nanosized tetragonal confinedcontainer with a squar...

This paper surveys some new results and constructions on BIBDs and related designs including RBIBDs, GDDs, packing and covering designs, etc. A certain number of related open problems are also discussed.

We show that if a graph admits packing and covering both consisting of ? many spanning trees, where is some infinite cardinal, then the also decomposition into trees. For finite analogous question remains open, however, slightly weaker statement proved.