5 resultados para meta-heuristics
em Brock University, Canada
Resumo:
The purpose of this meta-analytic investigation was to review the empirical evidence specific to the effect of physical activity context on social physique anxiety (SP A). English language studies were located from computer and manual literature searches. A total of 146 initial studies were coded. Studies included in the meta-analysis presented at least one empirical effect for SPA between physical activity participants (i.e., athletes or exercisers) and non-physical activity participants. The final sample included thirteen studies, yielding 14 effect sizes, with a total sample size of 2846. Studies were coded for mean SPA between physical activity participants and non-physical activity participants. Moderator variables related to demographic and study characteristics were also coded. Using Hunter and Schmidt's (2004) protocol, statistical artifacts were corrected. Results indicate that, practically speaking, those who were physically active reported lower levels of SPA than the comparison group (dcorr = -.12; SDeorr.-=-;22). Consideration of the magnitude of the ES, the SDeorr, and confidence interval suggests that this effect is not statistically significant. While most moderator analyses reiterated this trend, some differences were worth noting. Previous research has identified SPA to be especially salient for females compared to males, however, in the current investigation, the magnitude of the ES' s comparing physical activity participants to the comparison group was similar (deorr = -.24 for females and deorr = -.23 for males). Also, the type of physical activity was investigated, and results showed that athletes reported lower levels of SP A than the comparison group (deorr = -.19, SDeorr = .08), whereas exercisers reported higher levels of SPA than the comparison group (deorr = .13, SDeorr = .22). Results demonstrate support for the dispositional nature of SP A. Consideration of practical significance suggests that those who are involved in physical activity may experience slightly lower levels of SPA than those not reporting physical activity participation. Results potentially offer support for the bi-directionality of the relationship between physical activity and SP A; however, a causality may not be inferred. More information about the type of physical activity (i.e., frequency/nature of exercise behaviour, sport classificationllevel of athletes) may help clarify the role of physical activity contexts on SPA.
Resumo:
Underlying intergroup perceptions include processes of social projection (perceiving personal traitslbeliefs in others, see Krueger 1998) and meta-stereotyping (thinking about other groups' perceptions of one's own group, see Vorauer et aI., 1998). Two studies were conducted to investigate social projection and meta-stereotypes in the domain of White-Black racial relations. Study 1, a correlational study, examined the social projection of prejudice and 'prejudiced' meta-stereotypes among Whites. Results revealed that (a) Whites socially projected their intergroup attitudes onto other Whites (and Blacks) [i.e., Whites higher in prejudice against Blacks believed a large percentage of Whites (Blacks) are prejudiced against Blacks (Whites), whereas Whites low in prejudice believed a smaller percentage of Whites (Blacks) are prejudiced]; (b) Whites held the meta:..stereotype that their group (Whites) is viewed by Blacks to be prejudiced; and (c) prejudiced meta-stereotypes may be formed through the social projection of intergroup attitudes (result of path-model tests). Further, several correlates of social projection and meta-stereotypes were identified, including the finding that feeling negatively stereotyped by an outgroup predicted outgroup avoidance through heightened intergroup anxiety. Study 2 replicated and extended these findings, investigating the social projection of ingroup favouritism and meta- and other-stereotypes about ingroup favouritism. These processes were examined experimentally using an anticipated intergroup contact paradigm. The goal was to understand the experimental conditions under which people would display the strongest social projection of intergroup attitudes, and when experimentally induced meta-stereotypes (vs. other-stereotypes; beliefs about the group 11 preferences of one's outgroup) would be most damaging to intergroup contact. White participants were randomly assigned to one of six conditions and received (alleged) feedback from a previously completed computer-based test. Depending on condition, this information suggested that: (a) the participant favoured Whites over Blacks; (b) previous White participants favoured Whites over Blacks; (c) the participant's Black partner favoured Blacks over Whites; (d) previous Black participants favoured Blacks over Whites; (e) the participant's Black partner viewed the participant to favour Whites over Blacks; or (£) Black participants previously participating viewed Whites to favour Whites over Blacks. In a defensive reaction, Whites exhibited enhanced social projection of personal intergroup attitudes onto their ingroup under experimental manipulations characterized by self-concept threat (i.e., when the computer revealed that the participant favoured the ingroup or was viewed to favour the ingroup). Manipulated meta- and otherstereotype information that introduced intergroup contact threat, on the other hand, each exerted a strong negative impact on intergroup contact expectations (e.g., anxiety). Personal meta-stereotype manipulations (i.e., when the participant was informed that her/ his partner thinks s/he favours the ingroup) exerted an especially negative impact on intergroup behaviour, evidenced by increased avoidance of the upcoming interracial interaction. In contrast, personal self-stereotype manipulations (i.e., computer revealed that one favoured the ingroup) ironically improved upcoming intergroup contact expectations and intentions, likely due to an attempt to reduce the discomfort of holding negative intergroup attitudes. Implications and directions for future research are considered.
Resumo:
This investigation examined the effects of de institutionalization on the adaptive behaviour and adjustment of adults with intellectual disabilities (ID). In study 1, a meta-analysis was conducted with 23 studies on deinstitutionalization adaptive behaviour outcomes. Deinstitutionalization was associated with modest improvements in adaptive behaviour however outcomes varied across adaptive behaviour domains and other substantive variables. Clinical and service implications of these results were explicated. Noting the trends from the meta-analysis, study 2 used this information in refining and piloting an Agency Transition Survey used to evaluate community transitions for persons with ID. Information derived from the survey was found to be valuable and adequate for the effective evaluation of transitional success. Potential applications of the survey and meta-analysis results were illustrated.
Resumo:
Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over the network, for example mitigating pandemic disease or computer virus spread. A number of problem formulations have been proposed that aim to solve such problems based on desired network characteristics, such as maintaining the largest network component after node removal. The recently formulated critical node detection problem aims to remove a small subset of vertices from the network such that the residual network has minimum pairwise connectivity. Unfortunately, the problem is NP-hard and also the number of constraints is cubic in number of vertices, making very large scale problems impossible to solve with traditional mathematical programming techniques. Even many approximation algorithm strategies such as dynamic programming, evolutionary algorithms, etc. all are unusable for networks that contain thousands to millions of vertices. A computationally efficient and simple approach is required in such circumstances, but none currently exist. In this thesis, such an algorithm is proposed. The methodology is based on a depth-first search traversal of the network, and a specially designed ranking function that considers information local to each vertex. Due to the variety of network structures, a number of characteristics must be taken into consideration and combined into a single rank that measures the utility of removing each vertex. Since removing a vertex in sequential fashion impacts the network structure, an efficient post-processing algorithm is also proposed to quickly re-rank vertices. Experiments on a range of common complex network models with varying number of vertices are considered, in addition to real world networks. The proposed algorithm, DFSH, is shown to be highly competitive and often outperforms existing strategies such as Google PageRank for minimizing pairwise connectivity.
Resumo:
Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.