365 resultados para atk-ohjelmat - LSP - Library software package


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Twenty-four parents of oppositional preschoolers were randomly assigned to either a self-directed behavioral family intervention condition (SD) or to a waitlist control group (WL). The self-directed parent training program based on self-regulation principles, consisted of a written information package and weekly telephone consultations for 10 weeks. At posttest, in comparison to the WL group, children in the SD group had lower levels of behavior problems on parent report measures of child behavior. At posttreatment, parents in the SD condition reported increased levels of parenting competence and lower levels of dysfunctional parenting practices as compared to parents in the WL condition. In addition, mothers reported lower levels of anxiety, depression, and stress as compared to mothers in the WL condition at posttreatment. Using mother's reports, gains in child behavior and parenting practices achieved at posttreatment were maintained at 4-month follow-up.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador:

Relevância:

20.00% 20.00%

Publicador: