Hyperbole is an obvious and intentional exaggeration in the sense that it takes things to such an extreme that the audience goes too far and then pulls itself back to a more reasonable position, i.e. it is an extravagant statement or figure of speech not intended to be taken literally. This paper focuses on the formal and functional perspectives in the analysis of hyperbole which American candidates produce in their speeches in electoral campaigns, for it is hypothesized that candidates in their electoral campaigns use hyperbolic expressions excessively to persuade voters of the objectives of their electoral campaign programs. Hence, it aims to analyze hyperbole in context to determine the range of pragmatic functions that this figure fulfills and to present a formal analysis of hyperbole to demonstrate which formal realizations employed with a hyperbolic function are more or less likely to serve the persuasive aspect of hyperbole. To achieve these aims, three campaign speeches by Barack Obama from the 2012 Presidential Election, chosen at random from the American Presidency Project, were analyzed, and the occurrences of hyperbolic expressions identified. The frequency findings, in terms of the formal analysis, reveal that the exaggerated content found in single words is the type which represents the most common realization of hyperbole in Obama's speeches. In terms of the functional analysis, the results reveal that emphasis and evaluation appear to be the most prominent functions suggesting that the intended impression on voters is only constructed through the combined effects of these two devices.
In this paper, we introduce and study the concept of S-coprime submodules, where a proper submodule N of an R-module M is called S-coprime submodule if M N is S-coprime Rmodule. Many properties about this concept are investigated.
Let L be a commutative ring with identity and let W be a unitary left L- module. A submodule D of an L- module W is called s- closed submodule denoted by D ≤sc W, if D has no proper s- essential extension in W, that is , whenever D ≤ W such that D ≤se H≤ W, then D = H. In this paper, we study modules which satisfies the ascending chain conditions (ACC) and descending chain conditions (DCC) on this kind of submodules.
Let R be a commutative ring with identity 1 and M be a unitary left R-module. A submodule N of an R-module M is said to be approximately pure submodule of an R-module, if for each ideal I of R. The main purpose of this paper is to study the properties of the following concepts: approximately pure essentialsubmodules, approximately pure closedsubmodules and relative approximately pure complement submodules. We prove that: when an R-module M is an approximately purely extending modules and N be Ap-puresubmodulein M, if M has the Ap-pure intersection property then N is Ap purely extending.
The global food supply heavily depends on utilizing fertilizers to meet production goals. The adverse impacts of traditional fertilization practices on the environment have necessitated the exploration of new alternatives in the form of smart fertilizer technologies (SFTs). This review seeks to categorize SFTs, which are slow and controlled-release Fertilizers (SCRFs), nano fertilizers, and biological fertilizers, and describes their operational principles. It examines the environmental implications of conventional fertilizers and outlines the attributes of SFTs that effectively address these concerns. The findings demonstrate a pronounced environmental advantage of SFTs, including enhanced crop yields, minimized nutrient loss, improved nut
... Show More
Let R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if
the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are introduced and given some properties .
(1)
Merging biometrics with cryptography has become more familiar and a great scientific field was born for researchers. Biometrics adds distinctive property to the security systems, due biometrics is unique and individual features for every person. In this study, a new method is presented for ciphering data based on fingerprint features. This research is done by addressing plaintext message based on positions of extracted minutiae from fingerprint into a generated random text file regardless the size of data. The proposed method can be explained in three scenarios. In the first scenario the message was used inside random text directly at positions of minutiae in the second scenario the message was encrypted with a choosen word before ciphering
... Show MoreLet M be an R-module, where R is a commutative ring with unity. A submodule N of M is called e-small (denoted by N e  M) if N + K = M, where K e  M implies K = M. We give many properties related with this type of submodules.
Let R be a commutative ring with identity 1 and M be a unitary left R-module. A submodule N of an R-module M is said to be pure relative to submodule T of M (Simply T-pure) if for each ideal A of R, N?AM=AN+T?(N?AM). In this paper, the properties of the following concepts were studied: Pure essential submodules relative to submodule T of M (Simply T-pure essential),Pure closed submodules relative to submodule T of M (Simply T-pure closed) and relative pure complement submodule relative to submodule T of M (Simply T-pure complement) and T-purely extending. We prove that; Let M be a T-purely extending module and let N be a T-pure submodule of M. If M has the T-PIP, then N is T-purely extending.
In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la
In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la