
In this paper, we investigate the automatic recognition of emotion in text. We perform experiments with a new method of classification based on the PPM character-based text compression scheme. These experiments involve both coarse-grained classification (whether a text is emotional or not) and also fine-grained classification such as recognising Ekman’s six basic emotions (Anger, Disgust, Fear, Happiness, Sadness, Surprise). Experimental results with three datasets show that the new method significantly outperforms the traditional word-based text classification methods. The results show that the PPM compression based classification method is able to distinguish between emotional and nonemotional text with high accuracy, between texts invo
... Show MoreNatural gas and oil are one of the mainstays of the global economy. However, many issues surround the pipelines that transport these resources, including aging infrastructure, environmental impacts, and vulnerability to sabotage operations. Such issues can result in leakages in these pipelines, requiring significant effort to detect and pinpoint their locations. The objective of this project is to develop and implement a method for detecting oil spills caused by leaking oil pipelines using aerial images captured by a drone equipped with a Raspberry Pi 4. Using the message queuing telemetry transport Internet of Things (MQTT IoT) protocol, the acquired images and the global positioning system (GPS) coordinates of the images' acquisition are
... Show MoreSoftware-Defined Networking (SDN) has evolved network management by detaching the control plane from the data forwarding plane, resulting in unparalleled flexibility and efficiency in network administration. However, the heterogeneity of traffic in SDN presents issues in achieving Quality of Service (QoS) demands and efficiently managing network resources. SDN traffic flows are often divided into elephant flows (EFs) and mice flows (MFs). EFs, which are distinguished by their huge packet sizes and long durations, account for a small amount of total traffic but require disproportionate network resources, thus causing congestion and delays for smaller MFs. MFs, on the other hand, have a short lifetime and are latency-sensitive, but they accou
... Show MoreDerivational word formation process is one of the most substantial linguistic procedures that solves many problems in the translation of the language new vocabulary and helps to comprehend the smallest language component that not simply semantically and structurally explain the elements of both Russian and Arabic but also enables translators to comprehend the derivational method procedures of both languages. It also reveals the structural aspects of translation equivalences, cognitive and semantic foundations of translation. The rapid development of languages and the appearance of a new vocabulary like ṭabaʿa "print → ṭābiʿat "printer", kataba "to write" → kātib → kātibat, rafaʿa "to raise" → rāfiʿat "a crane" d
... Show MoreLet R be a commutative ring with identity, and W be a unital (left) R-module. In this paper we introduce and study the concept of a quasi-small prime modules as generalization of small prime modules.
It is shown that if a subset of a topological space (χ, τ) is δ-semi.closed, then it is semi.closed. By use this fact, we introduce the concept regularity of a topological space (χ, τ) via δ-semi.open sets. Many properties and results were investigated and studied. In addition we study some maps that preserve the δ-semi.regularity of spaces.
In this paper, a new type of supra closed sets is introduced which we called supra β*-closed sets in a supra topological space. A new set of separation axioms is defined, and its many properties are examined. The relationships between supra β*-Ti –spaces (i = 0, 1, 2) are studied and shown with instances. Additionally, new varieties of supra β*-continuous maps have been taken into consideration based on the supra β*-open sets theory.
in this paper the notion of threshold relations by using resemblance relation are introduced to get a similarity relation from a resemnblance relation R