Nowadays, due to our everyday stress and current stressful lifestyle, the loss of items appears a frequent issue and may be very inconvenient. In this regard, until the IoT becomes part of everyday life, we can use the software as an efficient tool to assist a person's searching, verifying, and finding lost belongings. This paper presents an Android-based application that we proposed and implemented to help users find lost items. Utilizing this software will enable the subscriber to record his request to the relevant authority. In addition, a special section offers to insert a contact telephone number or email to communicate between the person who found the item and the person who lost it. During testing, among other services, the p

Students in the twenty-first century need to find innovative ways to satisfy and respond to these learning requirements since they live in a visible world that is continuously surrounded by visual, technological stimuli. This is especially true of higher education. In order promote advancements in sustainable awareness, the project aims to include visual understanding in education (VUE) in higher education communication skills. An interview has been employed as a tool to accomplish the study's goal. The idea of Visual Understanding in Education (VUE) is one of the many novel or modern ways that has produced remarkable outcomes in a wide range of specialized sectors. Teachers may spread lessons of responsibility and consciousness by being aw

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m

Let be an infinite dimensional separable complex Hilbert space and let , where is the Banach algebra of all bounded linear operators on . In this paper we prove the following results. If is a operator, then 1. is a hypercyclic operator if and only if D and for every hyperinvariant subspace of . 2. If is a pure, then is a countably hypercyclic operator if and only if and for every hyperinvariant subspace of . 3. has a bounded set with dense orbit if and only if for every hyperinvariant subspace of , .