931 resultados para Generalized inverse
Resumo:
Finding the smallest eigenvalue of a given square matrix A of order n is computationally very intensive problem. The most popular method for this problem is the Inverse Power Method which uses LU-decomposition and forward and backward solving of the factored system at every iteration step. An alternative to this method is the Resolvent Monte Carlo method which uses representation of the resolvent matrix [I -qA](-m) as a series and then performs Monte Carlo iterations (random walks) on the elements of the matrix. This leads to great savings in computations, but the method has many restrictions and a very slow convergence. In this paper we propose a method that includes fast Monte Carlo procedure for finding the inverse matrix, refinement procedure to improve approximation of the inverse if necessary, and Monte Carlo power iterations to compute the smallest eigenvalue. We provide not only theoretical estimations about accuracy and convergence but also results from numerical tests performed on a number of test matrices.
Resumo:
Design for low power in FPGA is rather limited since technology factors affecting power are either fixed or limited for FPGA families. This paper investigates opportunities for power savings of a pipelined 2D IDCT design at the architecture and logic level. We report power consumption savings of over 25% achieved in FPGA circuits obtained from clock gating implementation of optimizations made at the algorithmic level(1).
Resumo:
Nonlinear system identification is considered using a generalized kernel regression model. Unlike the standard kernel model, which employs a fixed common variance for all the kernel regressors, each kernel regressor in the generalized kernel model has an individually tuned diagonal covariance matrix that is determined by maximizing the correlation between the training data and the regressor using a repeated guided random search based on boosting optimization. An efficient construction algorithm based on orthogonal forward regression with leave-one-out (LOO) test statistic and local regularization (LR) is then used to select a parsimonious generalized kernel regression model from the resulting full regression matrix. The proposed modeling algorithm is fully automatic and the user is not required to specify any criterion to terminate the construction procedure. Experimental results involving two real data sets demonstrate the effectiveness of the proposed nonlinear system identification approach.
Resumo:
In this paper, we introduce two kinds of graphs: the generalized matching networks (GMNs) and the recursive generalized matching networks (RGMNs). The former generalize the hypercube-like networks (HLNs), while the latter include the generalized cubes and the star graphs. We prove that a GMN on a family of k-connected building graphs is -connected. We then prove that a GMN on a family of Hamiltonian-connected building graphs having at least three vertices each is Hamiltonian-connected. Our conclusions generalize some previously known results.
Resumo:
Generalized cubes are a subclass of hypercube-like networks, which include some hypercube variants as special cases. Let theta(G)(k) denote the minimum number of nodes adjacent to a set of k vertices of a graph G. In this paper, we prove theta(G)(k) >= -1/2k(2) + (2n - 3/2)k - (n(2) - 2) for each n-dimensional generalized cube and each integer k satisfying n + 2 <= k <= 2n. Our result is an extension of a result presented by Fan and Lin [J. Fan, X. Lin, The t/k-diagnosability of the BC graphs, IEEE Trans. Comput. 54 (2) (2005) 176-184]. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
Generalized honeycomb torus is a candidate for interconnection network architectures, which includes honeycomb torus, honeycomb rectangular torus, and honeycomb parallelogramic torus as special cases. Existence of Hamiltonian cycle is a basic requirement for interconnection networks since it helps map a "token ring" parallel algorithm onto the associated network in an efficient way. Cho and Hsu [Inform. Process. Lett. 86 (4) (2003) 185-190] speculated that every generalized honeycomb torus is Hamiltonian. In this paper, we have proved this conjecture. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
The determination of the minimum size of a k-neighborhood (i.e., a neighborhood of a set of k nodes) in a given graph is essential in the analysis of diagnosability and fault tolerance of multicomputer systems. The generalized cubes include the hypercube and most hypercube variants as special cases. In this paper, we present a lower bound on the size of a k-neighborhood in n-dimensional generalized cubes, where 2n + 1 <= k <= 3n - 2. This lower bound is tight in that it is met by the n-dimensional hypercube. Our result is an extension of two previously known results. (c) 2005 Elsevier Inc. All rights reserved.
Resumo:
A novel radix-3/9 algorithm for type-III generalized discrete Hartley transform (GDHT) is proposed, which applies to length-3(P) sequences. This algorithm is especially efficient in the case that multiplication is much more time-consuming than addition. A comparison analysis shows that the proposed algorithm outperforms a known algorithm when one multiplication is more time-consuming than five additions. When combined with any known radix-2 type-III GDHT algorithm, the new algorithm also applies to length-2(q)3(P) sequences.
Resumo:
Using a recent theoretical approach, we study how global warming impacts the thermodynamics of the climate system by performing experiments with a simplified yet Earth-like climate model. The intensity of the Lorenz energy cycle, the Carnot efficiency, the material entropy production, and the degree of irreversibility of the system change monotonically with the CO2 concentration. Moreover, these quantities feature an approximately linear behaviour with respect to the logarithm of the CO2 concentration in a relatively wide range. These generalized sensitivities suggest that the climate becomes less efficient, more irreversible, and features higher entropy production as it becomes warmer, with changes in the latent heat fluxes playing a predominant role. These results may be of help for explaining recent findings obtained with state of the art climate models regarding how increases in CO2 concentration impact the vertical stratification of the tropical and extratropical atmosphere and the position of the storm tracks.
Resumo:
This paper describes time-resolved x-ray diffraction data monitoring the transformation of one inverse bicontinuous cubic mesophase into another, in a hydrated lipid system. The first section of the paper describes a mechanism for the transformation that conserves the topology of the bilayer, based on the work of Charvolin and Sadoc, Fogden and Hyde, and Benedicto and O'Brien in this area. We show a pictorial representation of this mechanism, in terms of both the water channels and the lipid bilayer. The second section describes the experimental results obtained. The system under investigation was 2:1 lauric acid: dilauroylphosphatidylcholine at a hydration of 50% water by weight. A pressure-jump was used to induce a phase transition from the gyroid (Q(II)(G)) to the diamond (Q(II)(D)) bicontinuous cubic mesophase, which was monitored by time-resolved x-ray diffraction. The lattice parameter of both mesophases was found to decrease slightly throughout the transformation, but at the stage where the Q(II)(D) phase first appeared, the ratio of lattice parameters of the two phases was found to be approximately constant for all pressure-jump experiments. The value is consistent with a topology-preserving mechanism. However, the polydomain nature of our sample prevents us from confirming that the specific pathway is that described in the first section of the paper. Our data also reveal signals from two different intermediate structures, one of which we have identified as the inverse hexagonal (H-II) mesophase. We suggest that it plays a role in the transfer of water during the transformation. The rate of the phase transition was found to increase with both temperature and pressure-jump amplitude, and its time scale varied from the order of seconds to minutes, depending on the conditions employed.
Resumo:
OBJECTIVE: The anticipation of adverse outcomes, or worry, is a cardinal symptom of generalized anxiety disorder. Prior work with healthy subjects has shown that anticipating aversive events recruits a network of brain regions, including the amygdala and anterior cingulate cortex. This study tested whether patients with generalized anxiety disorder have alterations in anticipatory amygdala function and whether anticipatory activity in the anterior cingulate cortex predicts treatment response. METHOD: Functional magnetic resonance imaging (fMRI) was employed with 14 generalized anxiety disorder patients and 12 healthy comparison subjects matched for age, sex, and education. The event-related fMRI paradigm was composed of one warning cue that preceded aversive pictures and a second cue that preceded neutral pictures. Following the fMRI session, patients received 8 weeks of treatment with extended-release venlafaxine. RESULTS: Patients with generalized anxiety disorder showed greater anticipatory activity than healthy comparison subjects in the bilateral dorsal amygdala preceding both aversive and neutral pictures. Building on prior reports of pretreatment anterior cingulate cortex activity predicting treatment response, anticipatory activity in that area was associated with clinical outcome 8 weeks later following treatment with venlafaxine. Higher levels of pretreatment anterior cingulate cortex activity in anticipation of both aversive and neutral pictures were associated with greater reductions in anxiety and worry symptoms. CONCLUSIONS: These findings of heightened and indiscriminate amygdala responses to anticipatory signals in generalized anxiety disorder and of anterior cingulate cortex associations with treatment response provide neurobiological support for the role of anticipatory processes in the pathophysiology of generalized anxiety disorder.
Resumo:
We consider the Stokes conjecture concerning the shape of extreme two-dimensional water waves. By new geometric methods including a nonlinear frequency formula, we prove the Stokes conjecture in the original variables. Our results do not rely on structural assumptions needed in previous results such as isolated singularities, symmetry and monotonicity. Part of our results extends to the mathematical problem in higher dimensions.
Resumo:
This paper illustrates how internal model control of nonlinear processes can be achieved by recurrent neural networks, e.g. fully connected Hopfield networks. It is shown that using results developed by Kambhampati et al. (1995), that once a recurrent network model of a nonlinear system has been produced, a controller can be produced which consists of the network comprising the inverse of the model and a filter. Thus, the network providing control for the nonlinear system does not require any training after it has been trained to model the nonlinear system. Stability and other issues of importance for nonlinear control systems are also discussed.
Resumo:
A neural network enhanced proportional, integral and derivative (PID) controller is presented that combines the attributes of neural network learning with a generalized minimum-variance self-tuning control (STC) strategy. The neuro PID controller is structured with plant model identification and PID parameter tuning. The plants to be controlled are approximated by an equivalent model composed of a simple linear submodel to approximate plant dynamics around operating points, plus an error agent to accommodate the errors induced by linear submodel inaccuracy due to non-linearities and other complexities. A generalized recursive least-squares algorithm is used to identify the linear submodel, and a layered neural network is used to detect the error agent in which the weights are updated on the basis of the error between the plant output and the output from the linear submodel. The procedure for controller design is based on the equivalent model, and therefore the error agent is naturally functioned within the control law. In this way the controller can deal not only with a wide range of linear dynamic plants but also with those complex plants characterized by severe non-linearity, uncertainties and non-minimum phase behaviours. Two simulation studies are provided to demonstrate the effectiveness of the controller design procedure.