Results 1  10
of
130,666
The PseudoInverse Of The Derivative Operator
, 1997
"... The matrix D \Gamma kI in polynomial approximations of order N is similar to a large Jordan block which is invertible for nonzero k but extremely sensitive to perturbation. Solving the problem (D \Gamma kI)f = g involves similarity transforms whose condition number grows as N !, which exceeds typica ..."
Abstract
 Add to MetaCart
typical machine precision for N ? 17. By using orthogonal projections, we reformulate the problem in terms of Q, the pseudoinverse of D, and therefore its optimal preconditioner. The matrix Q in commonly used Chebyshev or Legendre representations is a simple tridiagonal matrix and its eigenvalues
Audit
"... Abstract The advent of leading edge auditing techniques which allow auditors to identify risks and evaluate the adequacy of controls over critical information systems in their organizations, has far reaching consequences for many areas of companies ’ activities. More and more organizations are movi ..."
Abstract
 Add to MetaCart
are moving to a computerbased audit approach that can be adapted to develop and improve the continuous audit process. This approach is used to assess risk and to assist an IS auditor’s decision to do either compliance testing or substantive testing. In a computer based audit approach, IS auditors
Monte Carlo sampling of solutions to inverse problems
 J. geophys. Res
, 1995
"... Probabilistic formulation of inverse problems leads to the definition of a probability distribution in the model space. This probability distribution combines a priori information with new information obtained by measuring some observable parameters (data). As, in the general case, the theory linkin ..."
Abstract

Cited by 103 (10 self)
 Add to MetaCart
Probabilistic formulation of inverse problems leads to the definition of a probability distribution in the model space. This probability distribution combines a priori information with new information obtained by measuring some observable parameters (data). As, in the general case, the theory
Efficient Secure and Verifiable Outsourcing of Matrix Multiplications
"... With the emergence of cloud computing services, a resourceconstrained client can outsource its computationallyheavy tasks to cloud providers. Because such service providers might not be fully trusted by the client, the need to verify integrity of the returned computation result arises. The ability ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. The ability to do so is called verifiable delegation or verifiable outsourcing. Furthermore, the data used in the computation may be sensitive and it is often desired to protect it from the cloud throughout the computation. In this work, we put forward solutions for verifiable outsourcing of matrix
Auditing IntervalBased Inference
 In Proceedings of the 14th Conference on Advanced Information Systems Engineering (CAiSE’02
, 2001
"... In this paper we study the feasibility of auditing inteval  based inference. Sensitive information about individuals is said to be compromised if an accurate enough interval, called inference inteval, is obtained into which the value of the sensitive information must fall. ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
In this paper we study the feasibility of auditing inteval  based inference. Sensitive information about individuals is said to be compromised if an accurate enough interval, called inference inteval, is obtained into which the value of the sensitive information must fall.
Multilaterally Secure Ubiquitous Auditing
"... Abstract Tracking information of individuals is a useful input to many Ubiquitous Computing (UbiComp) applications. Consider the example of a smart emergency management application: once mobile first responders are continuously tracked, a precise and safe coordination of rescue missions is possible, ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
to reconcile privacy and accountability requirements in location tracking systems, we introduce and evaluate the approach of using auditing mechanisms on two levels. We illustrate that, by employing carefully designed cryptographic mechanisms for selective pseudonym linkability based on efficient techniques
Finding the Inversion of a Square Matrix and Pseudoinverse of a Nonsquare Matrix by Hebbian Learning Rule
"... Abstract: In this paper, we discuss a neural network based on hebbian learning rule for finding the inverse of a matrix. First we described finding the inverse of a matrix by mentioned neural network. Finally, experimental results for square and nonsquare matrices are presented to show the effectiv ..."
Abstract
 Add to MetaCart
Abstract: In this paper, we discuss a neural network based on hebbian learning rule for finding the inverse of a matrix. First we described finding the inverse of a matrix by mentioned neural network. Finally, experimental results for square and nonsquare matrices are presented to show
Interval PseudoInverse Matrices and Interval Greville Algorithm∗
"... This paper investigates interval pseudoinverse matrices. We state an Interval Greville algorithm and extensions with bisections for calculation of interval pseudoinverse matrices and give the examples of interval pseudoinversion application for estimation of solutions of systems of linear equat ..."
Abstract
 Add to MetaCart
This paper investigates interval pseudoinverse matrices. We state an Interval Greville algorithm and extensions with bisections for calculation of interval pseudoinverse matrices and give the examples of interval pseudoinversion application for estimation of solutions of systems of linear
The PseudoInverse Of The Derivative Operator In Polynomial Spectral Methods
"... The matrix D \Gamma kI in polynomial approximations of order N is similar to a large Jordan block which is invertible for nonzero k but extremely sensitive to perturbation. Solving the problem (D \Gamma kI)f = g involves similarity transforms whose condition number grows as N !, which exceeds typica ..."
Abstract
 Add to MetaCart
typical machine precision for N ? 17. By using orthogonal projections, we reformulate the problem in terms of Q, the pseudoinverse of D, and therefore its optimal preconditioner. The matrix Q in commonly used Chebyshev or Legendre representations is a simple tridiagonal matrix and its eigenvalues
Results 1  10
of
130,666