nanocomposites made of carbon nanotube (cnt) bundles have attracted researchers’ attention due to their unusual properties such as: light weight, flexibility and stiffness.  in this paper, the effects of straight and rope-shaped bundles on nanocomposite effective mechanical properties are investigated.  first, fea models are created consisting of cnts with different shapes of straight and rope-...

Matrix balancing may effect the stability of algorithms in matrix computations and the accuracy of computed solutions. In this paper, we first introduce an algorithm for matrix balancing. Then, using Monte Carlo method we propose a robust algorithm to evaluate dominant eigenpair of a given matrix. Finally, several randomly generated examples are presented to show the efficiency of the new method.

finding frequent patterns plays a key role in exploring association patterns, correlation, and many other interesting relationships that are applicable in tdb. several association rule mining algorithms such as apriori, fp-growth, and eclat have been proposed in the literature. fp-growth algorithm construct a tree structure from transaction database and recursively traverse this tree to extract...

in the present paper, we introduce the sequence space [{l_p}(e,delta) = left{ x = (x_n)_{n = 1}^infty : sum_{n = 1}^infty left|  sum_{j in {e_n}} x_j - sum_{j in e_{n + 1}} x_jright| ^p < infty right},] where $e=(e_n)$ is a partition of finite subsets of the positive integers and $pge 1$. we investigate its topological properties and inclusion relations. moreover, we consider the problem of fin...

Future exploitation scheme of an oil reservoir in each cycle within its production life depends on the profitability of the current extraction scenario compared with predicted recoveries that acquire with applying other available methods. In fractured reservoirs appropriate time to pass from the gas injection process into chemical enhanced oil recovery (EOR) firmly depends on the oil extraction...

Incremental versions of batch algorithms are often desired, for increased time efficiency in the streaming data setting, or increased memory efficiency in general. In this paper we present a novel algorithm for incremental kernel PCA, based on rank one updates to the eigendecomposition of the kernel matrix, which is more computationally efficient than comparable existing algorithms. We extend o...

According to the traditional stabilized biconjugate gradient algorithm (BiCGSTAB) deficiency in data locality, this paper proposed a QTBiCGSTAB algorithm whose core idea is that recursively divides sparse matrix with quarter tree into sub-matrix and reorders them, to improve the hit ratio of cache and enhance the algorithm’s efficiency. And the idea is good for algorithm being parallized, that ...

Energy-based Markov–Gibbs random field (MGRF) image models describe images by statistics of local features. But finding features sufficient to describe a texture class has proven challenging. Modern MGRF models learn (extract) parametrised features rather than rely on hand-selected statistics; well-known examples include Fields of Experts (FoE) and Boltzmann machines, which use features built o...

The paper proposes a method for robust face recognition from low quality Kinect acquired images which have a wide range of variations in head pose, illumination, facial expressions, sunglass disguise and occlusions by hand. Multiple Kinect images of a person are considered as an image set and face recognition from these images is formulated as an RGB-D image set classification problem. The Kine...

In this paper, a new evolutionary technique for detecting continuous Pareto optimal sets is proposed. The technique is designed for functions of one real variable but it can be extended for several variables functions. In this approach an individual (a solution) is either a closed interval or a point. Each solution in the final population corresponds to a decision region of Pareto optimal set. ...