Traditional tests for memories are based on conventional fault models, involving the address decoder, individual memory cells and a limited coupling between them. Built-in self-test (BIST) solutions for testing memories today incorporate hardware for test pattern generation and application for a variety of the algorithms. The NPSF fault model is recognized as a high quality fault model for memo...

impact responses of rectangular composite plates with embedded shape memory alloy (sma) wires are investigated in the present research. the plate is assumed to be placed in a thermal environment; so that in contrast to the available researches in the field, the shape memory and ferroelasticity effects have to be considered also in addition to the superelasticity. the governing equations are der...

A parallel algorithm for shape recognition is presented along with its implementation on a distributed memory muhiprocessor. Shape recognition is one of the fundamental problems of computer vision. We consider a shape to be composed of a set of small straight line segments tangential to the object. The recognition problem is to determine whether the test image contains a specified reference sha...

Direct factorization methods for the solution of large, sparse linear systems that arise from PDE discretizations are robust, but typically show poor time and memory scalability for large systems. In this paper, we describe an efficient sparse, rank-structured Cholesky algorithm for solution of the positive definite linear system Ax = b when A comes from a discretized partial-differential equat...

Objective: This cross-sectional study aimed to compare the retrieval of autobiographical memory and the problem solving of people with borderline personality disorder (BPD) and normal people. Methods: The study population comprised all patients with BPD in Tehran. The study sample consisted of 15 patients with BPD, who referred to Hazrat-e-Rasool Hospital and 15 control group people, who were ...

This paper proposes an algorithm for Public Key Cryptography (PKC) using the hybrid concept of two evolutionary algorithms, Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) respectively. PSO alone are fast and easy to implement, they follow the procedures of common evolutionary algorithm and posses memory feature which is absent in GA making it more valuable. In GA whole population ...

Convex games are a natural generalization of matrix (normal-form) games that can compactly model many strategic interactions with interesting structure. We present a new anytime algorithm for such games that leverages fast best-response oracles for both players to build a model of the overall game. This model is used to identify search directions; the algorithm then does an exact minimization i...