The concept of Cech fuzzy soft bi-closure space ( ˇ Cfs bi-csp) ( ˇ U, L1, L2, S) is initiated and studied by the authors in [6]. The notion of pairwise fuzzy soft separated sets in Cfs bi-csp is defined in this study, and various features of ˇ this notion are proved. Then, we introduce and investigate the concept of connectedness in both Cfs bi-csps and its ˇ associated fuzzy soft bitopological spaces utilizing the concept of pairwise fuzzy soft separated sets. Furthermore, the concept of pairwise feebly connected is introduced, and the relationship between pairwise connected and pairwise feebly connected is discussed. Finally, we provide various instances to further explain our findings.
Government-sponsored projects in Iraq significantly improve the economic situation and provide services but face high rates of troubling blocks. This work aims to identify indicative factors of the Troubled Project using periodic health check reports based on a literature review and interviews with Iraqi experts. As a result, a questionnaire was prepared that included four sections. The first is personal information; the second section is information about knowing the level of institutions’ implementation of project management through prepared documents. The third section is about indicative factors for the project's trouble, including 25 workers; the fourth section is about the questions in the periodic reports to che
... Show MoreThe theory of probabilistic programming may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, production and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient bi is random variable
... Show MoreIn this work, we introduced and studied a new kind of soft mapping on soft topological spaces with an ideal, which we called soft strongly generalized mapping with respect an ideal I, we studied the concepts like SSIg-continuous, Contra-SSIg-continuous, SSIg-open, SSIg-closed and SSIg-irresolute mapping and the relations between these kinds of mappings and the composition of two mappings of the same type of two different types, with proofs or counter examples
Based on the German language department’s theoretical and practical aspects as well as educational programs, the present study discusses the semantic relations in text sentences and their role in the science of translation. Through clarifying the semantic relationship between the text sentence and the methods used to express a news item, a situation or an occurrence and through the statement of the multiple theoretical semantic structures of the text’s construction and interrelation, a translator can easily translate a text into the target language.
It is known that language learners face multiple difficulties in writing and creating an inte
... Show MoreAlthough text document images authentication is difficult due to the binary nature and clear separation between the background and foreground but it is getting higher demand for many applications. Most previous researches in this field depend on insertion watermark in the document, the drawback in these techniques lie in the fact that changing pixel values in a binary document could introduce irregularities that are very visually noticeable. In this paper, a new method is proposed for object-based text document authentication, in which I propose a different approach where a text document is signed by shifting individual words slightly left or right from their original positions to make the center of gravity for each line fall in with the m
... Show MoreIn 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 MoreIn this research we study the effect of UV radiation on pure PC samples and doped samples with plasticizer (DOP) for different exposure times (6, 12, 18, 24h). The study have been made on the change in the IR spectra causes by the UV radiation on both kinds of samples, besides the morphology changes were also studied by the optical microscope. From the results we conclude that the increasing of exposure causes the elaboration of CO2 and C2 gases.
This paper introduces some properties of separation axioms called α -feeble regular and α -feeble normal spaces (which are weaker than the usual axioms) by using elements of graph which are the essential parts of our α -topological spaces that we study them. Also, it presents some dependent concepts and studies their properties and some relationships between them.
In this paper we investigate the automatic recognition of emotion in text. We propose a new method for emotion recognition based on the PPM (PPM is short for Prediction by Partial Matching) character-based text compression scheme in order to recognize Ekman’s six basic emotions (Anger, Disgust, Fear, Happiness, Sadness, Surprise). Experimental results with three datasets show that the new method is very effective when compared with traditional word-based text classification methods. We have also found that our method works best if the sizes of text in all classes used for training are similar, and that performance significantly improves with increased data.