Welding fumes are common ambient air pollutants in manufacturing facilities, and have been shown to have deleterious effects on human health. An experimental effort is conducted to study the formation and composition of respirable fumes from a SMAW process. The responses examined are the fume particle size distribution (mean diameter) and formation rate (particle number and mass concentration)....

A simplified approach to the problem of determining the relative proportion of minerals in a mixture from a reflectance spectrum of the mixture is presented. Fundamental to this approach is a priori information concerning reflectance spectra of the minerals in the mixture and some estimate of the particle sizes of the mixture components. Reflectance spectra of intimate mixtures are a systematic...

Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimization (PSO) and evolutionary algorithms. This connection enables us to generalize PSO to virtually any solution representation in a natural and straightforward way. We demonstrate this for the cases of Euclidean, Manhattan and Hamming spaces.

BACKGROUND Measures to improve bird performance have been sought due to the imminent phase out of in-feed antibiotics in poultry and continued demand for higher poultry feeding efficiency. Increasing grain particle size and dietary fibre may improve gizzard function, digestive efficiency and nutrient absorption. This study was conducted to evaluate the effect increased particle size of corn and...

It is well-known that the second smallest eigenvalue 22 of the difference Laplacian matrix of a graph G is related to the expansion properties of G. A more detailed analysis of this relation is given. Upper and lower bounds on the diameter and the mean distance in G in terms of 22 are derived.

Given a set P of n points in a plane, the Geometric Minimum Diameter Spanning Tree (GMDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. The best known algorithm for this problem runs in slightly sub-cubic time. In this report, I have surveyed some algorithms and approximation schemes developed for this problem and investigated the relation between this pro...

Given a set P of points in the plane, a geometric minimum-diameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. In this paper, we present an approximation algorithm that generates a tree whose diameter is no more than (1+ ) times that of a GMDST, for any > 0. Our algorithm reduces the problem to several grid-aligned versions of the...

Let P be a set of n points in the plane. The geometric minimum-diameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a monoor a dipolar MDST, i.e. a MDST whose longest path consists of two or three edges, respectively. The more difficult dipolar case can so far only be solved in O(n) time. This paper ha...

Based on the CT (Computerized Tomography) scanned images of a 19-years-old healthy boy, a realistic geometric model of URT from nasal cavity to the upper six-generation bronchial is rebuilt. To investigate airflow and particle deposition in the obtained realistic human upper respiratory tract, RNG k-ε turbulence model was used to describe the primary flow and particle deposition under three bre...

The diameter of a set P of n points in R is the maximum Euclidean distance between any two points in P . If P is the vertex set of a 3-dimensional convex polytope, and if the combinatorial structure of this polytope is given, we prove that, in the worst case, deciding whether the diameter of P is smaller than 1 requires Ω(n log n) time in the algebraic computation tree model. It shows that the ...