this study takes a critical discourse analysis approach to investigate the linguistic representation of male and female social actors and construction of gender identities in the interchange third edition. the analytical models used are van leeuwen's (1996) framework and halliday's transitivity model (halliday & matthiessen, 2004). the findings of this study indicated a differential represe...

A characteristic of the developing mammalian visual system is a brief interval of plasticity, termed the "critical period," when the circuitry of primary visual cortex is most sensitive to perturbation of visual experience. Depriving one eye of vision (monocular deprivation [MD]) during the critical period alters ocular dominance (OD) by shifting the responsiveness of neurons in visual cortex t...

feminist critical discourse analysis is an approach distinguished by its focus on revealing unequal power relations between women and men in their social life. in the present paper, it is suggested that simone de beauvoir’s theory of the formation of gender identity and female subject in the second sex provides a meaningful theoretical ground to the feminist critical discourse analysis. althoug...

this study investigated the effect of using visual aids, semantic elaboration, and visual aids plus semantic elaboration on the iranian efl learners' vocabulary learning. to conduct the study, the researchers assigned 49 elementary learners to three homogeneous groups according to their proficiency level. then, a pre-test of paribakht and wesche's vocabulary knowledge scale was given ...

A short proof is presented for a theorem of G. A. Dirac (1974) giving a lower bound for the number of edges of a k-critical graph on a given number of vertices and describing all non-complete k-critical graphs with minimum edge excess.

The concepts of canonical grasp and grasp transformation graph proposed in 10] are useful in grasp planning and dextrous manipulation. However, one critical element, namely the automatic generation of the canonical grasps, is required for the grasp transformation graph to be practical. In this paper, we present an algorithm to generate all canonical grasps in the planar case automatically. To t...

We prove that every k-list-critical graph (k ≥ 7) on n ≥ k + 2 vertices has at least 1 2 ( k − 1 + k−3 (k−c)(k−1)+k−3 ) n edges where c = (k − 3) ( 1 2 − 1 (k−1)(k−2) ) . This improves the bound established by Kostochka and Stiebitz [13]. The same bound holds for online k-list-critical graphs, improving the bound established by Riasat and Schauz [16]. Both bounds follow from a more general resu...