2 resultados para catch databases

em Brock University, Canada


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The CATCH Kids Club (CKC) is an after-school intervention that has attempted to address the growing obesity and physical inactivity concerns publicized in current literature. Using Self-Determination Theory (SDT: Deci & Ryan, 1985) perspective, this study's main research objective was to assess, while controlling for gender and age, i f there were significant differences between the treatment (CKC program participants) and control (non- eKC) groups on their perceptions of need satisfaction, intrinsic motivation and optimal challenge after four months of participation and after eight months of participation. For this study, data were collected from 79 participants with a mean age of9.3, using the Situational Affective State Questionnaire (SASQ: Mandigo et aI., 2008). In order to determine the common factors present in the data, a principal component analysis was conducted. The analysis resulted in an appropriate three-factor solution, with 14 items loading onto the three factors identified as autonomy, competence and intrinsic motivation. Initially, a multiple analysis of co-variance (MANCOY A) was conducted and found no significant differences or effects (p> 0.05). To further assess the differences between groups, six analyses of co-variance (ANeOY As) were conducted, which also found no significant differences (p >0 .025). These findings suggest that the eKC program is able to maintain the se1fdetermined motivational experiences of its participants, and does not thwart need satisfaction or self-determined motivation through its programming. However, the literature suggests that the CKe program and other P A interventions could be further improved by fostering participants' self-determined motivational experiences, which can lead to the persistence of healthy PA behaviours (Kilpatrick, Hebert & Jacobsen, 2002).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Classical relational databases lack proper ways to manage certain real-world situations including imprecise or uncertain data. Fuzzy databases overcome this limitation by allowing each entry in the table to be a fuzzy set where each element of the corresponding domain is assigned a membership degree from the real interval [0…1]. But this fuzzy mechanism becomes inappropriate in modelling scenarios where data might be incomparable. Therefore, we become interested in further generalization of fuzzy database into L-fuzzy database. In such a database, the characteristic function for a fuzzy set maps to an arbitrary complete Brouwerian lattice L. From the query language perspectives, the language of fuzzy database, FSQL extends the regular Structured Query Language (SQL) by adding fuzzy specific constructions. In addition to that, L-fuzzy query language LFSQL introduces appropriate linguistic operations to define and manipulate inexact data in an L-fuzzy database. This research mainly focuses on defining the semantics of LFSQL. However, it requires an abstract algebraic theory which can be used to prove all the properties of, and operations on, L-fuzzy relations. In our study, we show that the theory of arrow categories forms a suitable framework for that. Therefore, we define the semantics of LFSQL in the abstract notion of an arrow category. In addition, we implement the operations of L-fuzzy relations in Haskell and develop a parser that translates algebraic expressions into our implementation.