Abstract Recently, several approaches for multiscale simulations problems with high contrast and no scale separation are introduced. Among them is nonlocal multicontinua (NLMC) method, which introduces multiple macroscopic variables in each computational grid. These explore the entire coarse block resolution one can obtain optimal convergence results independent of scales. However, these not am...

We provide a complete work-flow, based on the language of quantum information theory, suitable for processing data for the purpose of pattern recognition. The main advantage of the introduced scheme is that it can be easily implemented and applied to process real-world data using modest computation resources. At the same time it can be used to investigate the difference in the pattern recogniti...

In this paper, a new feature which is characterized by the extrema density of 2-D wavelet frames estimated at the output of the corresponding filter bank is proposed for texture segmentation. With and without feature selection, the discrimination ability of features based on pyramidal and treestructured decompositions are comparatively studied using the extrema density, energy, and entropy as f...

A simple computational procedure has been developed by using Monte Carlo for allocating redundancy among subsystems so as to achieve maximum reliability of a complex systems subjected to multiple constraints which may be linear, non linear separable or non separable. Two examples of linear, non linear separable and non separable constraints with having twenty problems are solved.

We find all the perfect fluid G 2 diagonal cosmologies with the property that the quotient of the norms of the two orthogonal Killing vectors is constant along each fluid world-line. We find four different families depending each one on two or three arbitrary parameters which satisfy that the metric coefficients are not separable functions. Some physical properties of these solutions including ...

Introduction. In this paper the structure of graphs is studied by purely combinatorial methods. The concepts of rank and nullity are fundamental. The first part is devoted to a general study of non-separable graphs. Conditions that a graph be non-separable are given ; the decomposition of a separable graph into its non-separable parts is studied; by means of theorems on circuits of graphs, a me...