In this paper, based on findings from situated cognition, we argue that human reasoning is characterized by an ability to dynamically re-organize knowledge available in an experience, and re-construct it for use within the same experience. This paper describes a computational method that models such a knowledge re-organization process. We show its application on the Design Structure Matrix (DSM...

In this paper, fault location in large analog networks by decomposition method is generalized to include subnetworks not explicitly testable. Assume that the network topology and nominal values of network components are known and the network-undertest is partitioned into subnetworks once for all. The decomposition nodes could be either the accessible nodes whose nodal voltages can be measured o...

Nonlinear coupled partial differential equations are physical problems since it makes the unnecessary very important in a variety of scientific fields. They arise linearization, perturbation problem being solved. in large number of mathematical and engineering In this study, the ADM is extended to problems, especially in fluid mechanics, solid state analytic-numeric simulation for strictly hype...

We introduced an application of the decomposition of a group into cosets of a subgroup to the theory of error detecting and correcting codes. The proposed approach is based on the general method for decoding linear codes known as syndrome decoding. Mathematics Subject Classification: 20A05; 20B05; 20B40

We present in this paper a new method to determine the k largest singular values and their corresponding singular vectors for real rectangular matrices A ∈ Rn×m. Our approach is based on using a block version of the Power Method to compute an k-block SV D decomposition: Ak = UkΣkV T k , where Σk is a diagonal matrix with the k largest non-negative, monotonically decreasing diagonal σ1 ≥ σ2 · · ...

We present an empirical comparison of decomposition techniques for CSPs. We compare three popular heuristics for tree decomposition and an exact method for optimal tree decomposition, along with two methods for hypertree decomposition. We use a small sample of instances in the experiments. We find that the connected hypertree decomposition method finds more optimal width decompositions than the...

A parallel iterative nonoverlapping domain decomposition method is proposed and analyzed for elliptic problems. Each iteration in this method contains two steps. In the rst step, at the interface of two subdomains, one subdomain problem requires that Dirichlet data be passed to it from the previous iteration level, while the other subdomain problem requires Neumann data be passed to it. In the ...

A new algorithm is introduced which is related to matching pursuit but allows updating more than one coding coefficient per iteration: the updated coefficients correspond to mutually orthogonal elements of the dictionary. Coding experiments on natural images show that the new method achieves the same trade-off as matching pursuit between number of coding coefficients and reconstruction error, b...

Here, a simple method to determine the rate of convergence of Adomian decomposition method is introduced. The proposed method is used to compare between the rate of convergence of standard and modified (proposed by Wazwaz [A.M. Wazwaz, A new method for solving singular initial value problems in the second-order ordinary differential equations, Appl. Math. Comput. 128 (2002) 45–57]) Adomian meth...

In this paper an efficient modification of the Adomian decomposition method is presented by using Chebyshev polynomials. The proposed method can be applied to linear and non-linear models. The scheme is tested for some examples and the obtained results demonstrate reliability and efficiency of the proposed method. 2005 Elsevier Inc. All rights reserved.