نتایج جستجو برای: huang algorithm
تعداد نتایج: 761631 فیلتر نتایج به سال:
The main aim of this paper intends to discuss the solution of fuzzy Sylvester matrix equation AX +XB = C where A = (aij) ∈ Rn×n , B = (bij) ∈ Rm×m are crisp Mmatrices, C = (cij) ∈ Rn×m is fuzzy matrix and X ∈ Rn×m is unknown,by applying a special algorithm based on a class of ABS algorithms called Huang algorithm. At first, we transform this system to an (mn)×(mn) fuzzy system of linear equatio...
Given a digraph D = (V ,A) and an X ⊆ V , DX denotes the digraph obtained from D by reversing those arcs with exactly one end in X. A digraph D is called acyclically pushable when there exists an X ⊆ V such that DX is acyclic. Huang, MacGillivray and Yeo have recently characterized, in terms of two excluded induced subgraphs on 7 and 8 nodes, those bipartite permutation digraphs which are acycl...
Huang and Zhang cite{Huang} have introduced the concept of cone metric space where the set of real numbers is replaced by an ordered Banach space. Shojaei cite{shojaei} has obtained points of coincidence and common fixed points for s-Contraction mappings which satisfy generalized contractive type conditions in a complete cone metric space.In this paper, the notion of complete cone metric ...
Pulmonary sparganosis mansoni is uncommon in general clinical practice, but prevalent in endemic foci. Pulmonary sparganosis mansoni shares some clinical and radiologic similarities that mimic other common pulmonary pathogens. Delayed diagnosis of pulmonary sparganosis mansoni can pose a significant hazard to the patient. Indeed, a history of ingesting uncooked stone cracks in endemic areas is ...
This paper proposed a new weighted KNN data filling algorithm based on grey correlation analysis (GBWKNN) by researching the nearest neighbor of missing data filling method. It is aimed at that missing data is not sensitive to noise data and combined with grey system theory and the advantage of the K nearest neighbor algorithm. The experimental results on six UCI data sets showed that its filli...
Maintenance is becoming more expensive nowadays due to the increased complexity in design and function of industrial systems. Continuous health monitoring is thus of high importance to increase the availability of industrial systems and consequently reduce the costs. This paper presents an algorithm for unsupervised trends extraction from multidimensional sensory data so as to use such trend in...
A method for localization and severity assessment of structural damages is proposed. The algorithm works based on nonlinear behavior of certain type of damages such as breathing cracks which are called active discontinuities in this paper. Generally, nonlinear features are more sensitive to such damages although their extraction is sometimes controversial. A major controversy is the imposition ...
We propose an iterative channel estimation algorithm based on the Least Square Estimation (LSE) and Sparse Message Passing (SMP) algorithm for the Millimeter Wave (mmWave) MIMO systems. The channel coefficients of the mmWave MIMO are approximately modeled as a Bernoulli-Gaussian distribution since there are relatively fewer paths in the mmWave channel, i.e., the channel matrix is sparse and onl...
A data-driven method for extracting temporally persistent information, at different spatial scales, from rainfall data (as measured by radar/satellite) is described, which extends the Empirical Mode Decomposition (EMD) algorithm into two dimensions. The EMD technique is used here to decompose spatial rainfall data into a sequence of high through to low frequency components. This process is equi...
In [?] Lin, Wang and Zhou propose the iterative Toeplitz filters algorithm as an alternative iterative algorithm for EMD. In this alternative algorithm, the average of the upper and lower envelopes is replaced by certain “moving average” obtained through a low-pass filter. Performing the tradition sifting algorithm with such moving averages is equivlalent to iterating certain convolution filter...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید