Sharif Digital Repository

We use the Fokker-Planck equation and its moment equations to study the collective behavior of interacting particles in unsteady one-dimensional flows. Particles interact according to a longrange attractive and a short-range repulsive potential field known as Morse potential. We assume Stokesian drag force between particles and their carrier fluid and find analytic single-peaked traveling solutions for the spatial density of particles in the catastrophic phase. In steady flow conditions the streaming velocity of particles is identical to their carrier fluid, but we show that particle streaming is asynchronous with an unsteady carrier fluid. Using linear perturbation analysis, the stability... 

From the birth of multi-spectral imaging techniques, there has been a tendency to consider and process this new type of data as a set of parallel gray-scale images, instead of an ensemble of an n-D realization. However, it has been proved that using vector-based tools leads to a more appropriate understanding of color images and thus more efficient algorithms for processing them. Such tools are able to take into consideration the high correlation of the color components and thus to successfully carry out energy compaction. In this paper, a novel method is proposed to utilize the principal component analysis in the neighborhoods of an image in order to extract the corresponding eigenimages.... 

The energy of a graph G, E(G), is the sum of absolute values of the eigenvalues of its adjacency matrix. Gutman et al. proved that for every cubic graph of order n, E(G)≥n. Here, we improve this result by showing that if G is a connected subcubic graph of order n≥8, then E(G)≥1.01n. Also, we prove that if G is a traceable subcubic graph of order n≥8, then E(G)>1.1n. Let G be a connected cubic graph of order n≥8, it is shown that E(G)>n+2. It was proved that if G is a connected cubic graph of order n, then E(G)≤1.65n. Also, in this paper we would like to present the best lower bound for the energy of a connected cubic graph. We introduce an infinite family of connected cubic graphs whose for...