Linear discrete ill-posed problems of small to medium size are commonly solved by first computing the singular value decomposition of the matrix and then determining an approximate solution by one of several available numerical methods, such as the truncated singular value decomposition or Tikhonov regularization. The determination of an approximate solution is relatively inexpensive once the s...

We discuss here the convergence of relaxation methods for MPCC with approximate sequence of stationary points by presenting a general framework to study these methods. It has been pointed out in the literature, [25], that relaxation methods with approximate stationary points fail to give guarantee of convergence. We show that by de ning a new strong approximate stationarity we can attain the de...

A class of hybrid heterogeneous methods using time implicit backward differences and Crank-Nicolson approximating schemes in conjunction with explicit domain decomposition approximate inverse matrix techniques is introduced for computing various families of approximate inverses based on approximate LU-type factorization techniques. Explicit preconditioned conjugate gradient type schemes in conj...

While the memory subsystem is already a major contributor to energy consumption of computing platforms, the guardbanding required for masking the effects of ever increasing manufacturing variations in memories imposes even more energy overhead. In this paper, we explore how PartiallyForgetful Memories can be used by exploiting the intrinsic tolerance of a vast class of applications to some leve...

We study the problem of efficient (sub-linear) fuzzy search on encrypted outsourced data, inthe symmetric-key setting. In particular, a user who stores encrypted data on a remote untrustedserver forms queries that enable the server to efficiently locate the records containing the requestedkeywords, even though the user may misspell keywords or provide noisy data in the query. We...

Granular computing, initiated by Lotfi A. Zadeh, has acquired wide popularity as a tool for approximate reasoning, fusion of knowledge, cognitive computing. The need for formal methods of granulation, and means for computing with granules, has been addressed in this work by applying methods of rough mereology. Rough mereology is an extension of mereology taking as the primitive notion the notio...

The age of the air-tight hardware abstraction is over. As the computing ecosystem moves beyond the predictable yearly advances of Moore’s Law, appeals to familiarity and backwards compatibility will become less convincing: fundamental shifts in abstraction and design will look more enticing. It is time to embrace hardware–software co-design in earnest, to cooperate between programming languages...

In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at low cost. The first method is the static masterworker with uniform distribution strategy, the second one is the dynamic master-worker with allocation of subtexts and the third one is the dynamic master-worker with allocat...

the purpose of this paper is to obtain necessary and suffcient conditionsfor existence approximate fi xed point on geraghty-contraction. in this paper,de nitions of approximate -pair fi xed point for two maps tα , sα and theirdiameters are given in a metric space.