Four major existential themes are explored, as they relate to the predicament of the relative supporting a demented elderly dependent at home. These issues, namely, death, isolation, freedom, and meaning are discussed with respect to their dynamic impact on the stressed supporter as well as their implications for anxiety management.
Giving a graph G we wish to determine a subgraph H in which vertices belongs at least to a loop with length equal to 3. Firstly, we give all necessary definitions used in this paper. Secondly, we build the subgraf without isolated vertices and without tree components. Then we give some results that allow us to eliminate vertices and edges but preserve loops… (More)
Giving a graph G we wish to determine the component minimal complete subgraph of G. For this goal we present two algorithms in terms of sets representation of graph G. We give too the theorems that characterized this algorithms. 1. General definitions and results Firstly I wish to give some of the graph theory definitions and a few results related to… (More)
Rezumat: Lucrarea de faţă este o abordare prin programarea procentuală a unei probleme clasice din optimizarea combinatorială, şi anume problema de tip rucsac, dată într-un caz particular al problemei generale, altul decât cazul rucsacului 0-1. Se arată că, în condiţiile speciale ale programării procentuale, există un procedeu de reducere a problemei, care… (More)
This study examined the effects of Supporter Endurance Training (SET) on family supporters of elderly demented patients. Single case methodology was used in evaluating the outcome of providing eight supporters with eight weekly training sessions in meditative relaxation and assertiveness. Four such supporters received no special training. A videotape… (More)
Giving a graph G we wish to determine the component minimal complete subgraph of G. For this goal we present one algorithm in terms of sets representation of graph G. We give too the theorem that characterized this algorithm which is a better algorithm then the two algorithms presented in a previous paper and I show that this it happens. 1. General… (More)
Giving a graph G we wish to determine the component minimal complete subgraph of G. In previous papers we gave algorithms in terms of sets representation of graph G. The goal of this paper is to present the same problem in 0-1 algebraic approach. We do not give the theorem that characterized the algorithm we propose which will be presented in a future… (More)
Because in practical studies, the right hand part of constant sum constraint from constant sum integer programming model is a random variable , we consider that the existence of the solutions for different values of right hand part of constant sum constraint can be considered a prob-abilistic problem. The aim of this paper is to study this problem for the… (More)
This paper make a short presentation of VaR methodology applied in portfolio for foreign currencies in agreement with Romanian National Bank rules. In the first part we present theoretical aspect of VaR methodology and NBR rules. In the end of this paper we give an application of VaR methodology for an imaginary portfolio with two currencies.