3 resultados para Ubiquitous and pervasive computing
em DigitalCommons@University of Nebraska - Lincoln
Resumo:
Child sexual abuse continues to be a prevalent and complex problem in today’s society as it poses serious and pervasive mental health risks to child victims and their non-offending parents. The main objectives of this study were (a) to elucidate the psychological symptoms and support needs of parents of child sexual abuse victims as they present to group treatment, (b) to examine changes in psychological symptoms and support needs and their relationship with child functioning over the course of a parallel group treatment, and (c) to examine the impact of these factors on completion of group treatment. Participants included 104 sexually abused youth and their non-offending parent presenting to Project SAFE Group Intervention, a 12-session cognitive-behavioral group treatment for sexually abused children and their non-offending parents. This project had a unique advantage of utilizing a variety of demographic, parent-, and child-report measures, allowing for a more comprehensive examination of change in symptomatology and needs over the course of treatment. Several significant findings were noted, including the identification of four clusters of youth at pre-treatment, which were maintained at post-treatment; elevations on the CTQ Sexual Abuse scale; parents of youth sexually abused by a non-family member had significantly higher PSI-Restriction of Role subscale scores; parental expectations of a negative impact on their child were worse for older children; several parent characteristics predicted client treatment retention (e.g., older parents, lower SCL-90-R GSI scores); and an early age of onset of abuse also increased treatment retention. Future directions, recommendations, and limitations were discussed.
Resumo:
Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.
Resumo:
Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.