objective : To assess for Psychological Problems. The study was carried out from 1st of December 2004 to 15th
March, 2005.
Mythology : A descriptive comparative study was conducted for elder in the geriatric home and the community;
A questionnaire was constructed to achieve the purposes of the study; it includes two parts dealing with the
elder demographic characteristics and psychological problems.
A purposive (no probability) sampling of (100) elderly include (50) elderly from the Geriatric Home and (50)
elderly from the community.
Data were collected and analyzed through a descriptive statistical approach (frequency, percentage, mean and
mean of scores, Standard deviation, Relative Sufficiency).
Result : the

In this paper, a sufficient condition for stability of a system of nonlinear multi-fractional order differential equations on a finite time interval with an illustrative example, has been presented to demonstrate our result. Also, an idea to extend our result on such system on an infinite time interval is suggested.

This work aims to find a solution to the problem under investigation and to study non-local boundary-value problems for rectangular domains and two-dimensional thirdorder partial differential equations (PDEs). A finite-difference method combined with the trapezoidal rule is used to solve problems. The numerical results were determined to be steady and accurate.

Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the