In this paper, we introduce the notation of the soft bornological group to solve the problem of boundedness for the soft group. We combine soft set theory with bornology space to produce a new structure which is called    soft bornological group. So that both the product and inverse maps are soft bounded. As well as, we study the actions of the soft bornological group on the soft bornological sets. The aim soft bornological set is to partition into orbital classes by acting soft bornological group on the soft bornological set. In addition, we explain the centralizer, normalizer, and stabilizer in details. The main important results are to prove that the product of soft bornological groups is soft bornol

Studied red beetle life on each of the yen and wheat durum wheat, barley, corn, rice, chickpeas, ground peanuts and beans in Living situation constant temperature and relative humidity of 65% for a period of 66 days was the life cycle of the insect different from one substance to another ....

In this paper, new concepts which are called: left derivations and generalized left derivations in nearrings have been defined. Furthermore, the commutativity of the 3-prime near-ring which involves some
algebraic identities on generalized left derivation has been studied.

The continuous growth in technology and technological devices has led to the development of machines to help ease various human-related activities. For instance, irrespective of the importance of information on the Steam platform, buyers or players still get little information related to the application. This is not encouraging despite the importance of information in this current globalization era. Therefore, it is necessary to develop an attractive and interactive application that allows users to ask questions and get answers, such as a chatbot, which can be implemented on Discord social media. Artificial Intelligence is a technique that allows machines to think and be able to make their own decisions. This research showed that the dis

The revolution of multimedia has been a driving force behind fast and secured data transmission techniques. The security of image information from unapproved access is imperative. Encryptions technique is used to transfer data, where each kind of data has its own special elements; thus various methods should to be used to conserve distributing the image. This paper produces image encryption improvements based on proposed an approach to generate efficient intelligent session (mask keys) based on investigates from the combination between robust feature for ECC algebra and construction level in Greedy Randomized Adaptive Search Procedure (GRASP) to produce durable symmetric session mask keys consist of ECC points. Symmetric behavior for ECC

     The messages are ancient method to exchange information between peoples. It had many ways to send it with some security.

    Encryption and steganography was oldest ways to message security, but there are still many problems in key generation, key distribution, suitable cover image and others. In this paper we present proposed algorithm to exchange security message without any encryption, or image as cover to hidden. Our proposed algorithm depends on two copies of the same collection images set (CIS), one in sender side and other in receiver side which always exchange message between them.

      To send any message text the sender converts message to ASCII c

      Finding similarities in texts is important in many areas such as information retrieval, automated article scoring, and short answer categorization. Evaluating short answers is not an easy task due to differences in natural language. Methods for calculating the similarity between texts depend on semantic or grammatical aspects. This paper discusses a method for evaluating short answers using semantic networks to represent the typical (correct) answer and students' answers. The semantic network of nodes and relationships represents the text (answers). Moreover, grammatical aspects are found  by measuring the similarity of parts of speech between the answers. In addition, finding hierarchical relationships between nodes in netwo

Digital forensic is part of forensic science that implicitly covers crime related to computer and other digital devices. It‟s being for a while that academic studies are interested in digital forensics. The researchers aim to find out a discipline based on scientific structures that defines a model reflecting their observations. This paper suggests a model to improve the whole investigation process and obtaining an accurate and complete evidence and adopts securing the digital evidence by cryptography algorithms presenting a reliable evidence in a court of law. This paper presents the main and basic concepts of the frameworks and models used in digital forensics investigation.

    Feature selection represents one of the critical processes in machine learning (ML). The fundamental aim of the problem of feature selection is to maintain performance accuracy while reducing the dimension of feature selection. Different approaches were created for classifying the datasets. In a range of optimization problems, swarming techniques produced better outcomes. At the same time, hybrid algorithms have gotten a lot of attention recently when it comes to solving optimization problems. As a result, this study provides a thorough assessment of the literature on feature selection problems using hybrid swarm algorithms that have been developed over time (2018-2021). Lastly, when compared with current feature selection procedu

In this paper the queuing system (M/Er/1/N) has been considered in equilibrium. The method of stages introduced by Erlang has been used. The system of equations which governs the equilibrium probabilities of various stages has been given. For general N the probability of j stages of service are left in the system, has been introduced. And the probability for the empty system has been calculated in the explicit form.