Language is an important means through which one can construct one's social world. Accordingly, the way we view ourselves and the world is basically formed by language use whereby identities, relations, and values are constructed and maintained. Most discourse analysts consider narrative not only the locus of construction and enactment of identity, but also a distinguished genre for its analysis.The present study is concerned with how identity can poetically be informed, hence exploring the way black poets use language when reflecting their identity and culture. The poem, right on: white america by the black American poetess Sonia Sanchez, is chosen to be analyzed based on Simpson's stylistic model (2004). In this model, the analysis of the levels of language shapes and organizes the stylistic analysis whereas discourse is situated above the central levels of language. Stylistics and discourse analysis aim to show how and why the text means what it means linguistically. The study concludes that poetry is a potent creator and an enforcer of identity. The stylistic analysis casts light on the linguistic deviations, especially on the graphological level used by the poetess Sonia Sanchez. Such a level expresses the poetess' resistance and rage against the white. Besides, Sonia Sanchez’s use of Black English transmits her belonging to the oppressed Black.
In this paper, we introduce the concept of almost Quasi-Frobcnius fuzzy ring as a " " of Quasi-Frobenius ring. We give some properties about this concept with qoutient fuzzy ring. Also, we study the fuzzy external direct sum of fuzzy rings.
In this paper, we formulate and study a new property, namely indeterminacy (neutrosophic) of the hollow module. We mean indeterminacy hollow module is neutrosophic hollow module B (shortly Ne(B)) such that it is not possible to specify the conditions for satisfying it. Some concepts have been studied and introduced, for instance, the indeterminacy local module, indeterminacy divisible module, indeterminacy indecomposable module and indeterminacy hollow-lifting module. Also, we investigate that if Ne(B) is an indeterminacy divisible module with no indeterminacy zero divisors, then any indeterminacy submodule Ne(K) of Ne(B) is an indeterminacy hollow module. Further, we study the relationship between the indeterminacy of hollow an
... Show MoreIn this paper, we study the effect of group homomorphism on the chain of level subgroups of fuzzy groups. We prove a necessary and sufficient conditions under which the chains of level subgroups of homomorphic images of an a arbitrary fuzzy group can be obtained from that of the fuzzy groups . Also, we find the chains of level subgroups of homomorphic images and pre-images of arbitrary fuzzy groups
In this research we will present the signature as a key to the biometric authentication technique. I shall use moment invariants as a tool to make a decision about any signature which is belonging to the certain person or not. Eighteen voluntaries give 108 signatures as a sample to test the proposed system, six samples belong to each person were taken. Moment invariants are used to build a feature vector stored in this system. Euclidean distance measure used to compute the distance between the specific signatures of persons saved in this system and with new sample acquired to same persons for making decision about the new signature. Each signature is acquired by scanner in jpg format with 300DPI. Matlab used to implement this system.
In this paper, we introduce and study the concepts of hollow – J–lifting modules and FI – hollow – J–lifting modules as a proper generalization of both hollow–lifting and J–lifting modules . We call an R–module M as hollow – J – lifting if for every submodule N of M with is hollow, there exists a submodule K of M such that M = K Ḱ and K N in M . Several characterizations and properties of hollow –J–lifting modules are obtained . Modules related to hollow – J–lifting modules are given .
We dealt with the nature of the points under the influence of periodic function chaotic functions associated functions chaotic and sufficient conditions to be a very chaotic functions Palace
In current generation of technology, a robust security system is required based on biometric trait such as human gait, which is a smooth biometric feature to understand humans via their taking walks pattern. In this paper, a person is recognized based on his gait's style that is captured from a video motion previously recorded with a digital camera. The video package is handled via more than one phase after splitting it into a successive image (called frames), which are passes through a preprocessing step earlier than classification procedure operation. The pre-processing steps encompass converting each image into a gray image, cast off all undesirable components and ridding it from noise, discover differen
... Show MoreAudio classification is the process to classify different audio types according to contents. It is implemented in a large variety of real world problems, all classification applications allowed the target subjects to be viewed as a specific type of audio and hence, there is a variety in the audio types and every type has to be treatedcarefully according to its significant properties.Feature extraction is an important process for audio classification. This workintroduces several sets of features according to the type, two types of audio (datasets) were studied. Two different features sets are proposed: (i) firstorder gradient feature vector, and (ii) Local roughness feature vector, the experimentsshowed that the results are competitive to
... Show MoreIn this paper we give many connections between essentially quasi-Dedekind (quasi-
Dedekind) modules and other modules such that Baer modules, retractable modules,
essentially retractable modules, compressible modules and essentially compressible
modules where an R-module M is called essentially quasi-Dedekind (resp. quasi-
Dedekind) if, Hom(M N ,M ) 0 for all N ≤e M (resp. N ≤ M). Equivalently, a
module M is essentially quasi-Dedekind (resp. quasi-Dedekind) if, for each
f End (M) R , Kerf ≤ e M implies f = 0 (resp. f 0 implies ker f 0 ).