Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the contribution of this paper is to reformulate the maximum overlapped set covers problem to handle the probabilistic sensing model. The problem is addressed as a multi-objective optimization (MOO) problem and the well-known decomposition based multi-objective evolutionary algorithm (MOEA/D) is adopted to solve the stated problem. A Multi-layer MOEA/D is suggested, wherein each layer yields a distinct set cover. Performance evaluations in terms of total number of set covers, total residual energy, and coverage reliability are reported through extensive simulations. The main aspect of the results reveals that the network's lifetime (i.e. total number of set covers) can be extended by increasing number of sensors. On the other hand, the coverage reliability can be increased by increasing sensing ranges but at the expense of decreasing the network's lifetime.
This research aimed to know the tectonic activity of the Wadi Al-Batin alluvial fan using hydrological and morphotectonic analyses. Wadi Al-Batin alluvial fan is deposited from Wadi Al-Rimah in Saudi Arabia, which extended to Iraqi and Kuwait international boundaries. The longitudinal and transverse faults that characterize this region were common. The Abu- Jir-Euphrates faults have a significant impact on the region. The faults zone consists of several NW- SE trending faults running from the Rutba in western Iraq to the south along the Euphrates through Kuwait and meeting the Al-Batin fault to the Jal Al-Zor fault. The Hydromorphometric analysis of the present fan shows five watersheds having asymmetry shapes, more elongated and activi
... Show More
(1)
(2)
Cloud computing describes computer services provided through the internet and includes a wide range of virtualization resources. Because cloud computing is made up of a sizable number of heterogeneous autonomous systems with an adaptable computational architecture, it has been widely adopted by many businesses. The scheduling and management of resource utilization, however, have become more difficult as a result of cloud computing. Task scheduling is crucial, and this procedure must schedule tasks on the virtual machine while using the least amount of time possible. Utilizing an effective scheduling strategy enhances and expedites cloud computing services. Optimization techniques are used to resolve cloud scheduling problems.
... Show More
Cyberbullying is one of the biggest electronic problems that takes multiple forms of harassment using various social media. Currently, this phenomenon has become very common and is increasing, especially for young people and adolescents. Negative comments have a significant and dangerous impact on society in general and on adolescents in particular. Therefore, one of the most successful prevention methods is to detect and block harmful messages and comments. In this research, negative Arabic comments that refer to cyberbullying will be detected using a support vector machine algorithm. The term frequency-inverse document frequency vectorizer and the count vectorizer methods were used for feature extraction, and the results wer
... Show More
In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria. First a branch and bound (BAB) algorithm is applied for the 1//∑Ci+∑Ti+Tmax problem. Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(∑Ci ,∑Ti ,Tmax) problem. The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of
... Show MoreIn this paper, new method have been investigated using evolving algorithms (EA's) to cryptanalysis one of the nonlinear stream cipher cryptosystems which depends on the Linear Feedback Shift Register (LFSR) unit by using cipher text-only attack. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) which are used for attacking one of the nonlinear cryptosystems called "shrinking generator" using different lengths of cipher text and different lengths of combined LFSRs. GA and ACO proved their good performance in finding the initial values of the combined LFSRs. This work can be considered as a warning for a stream cipher designer to avoid the weak points, which may be f
... Show More
(6)
(1)
In this paper, a new class of sets, namely ï¡- semi-regular closed sets is introduced and studied for topological spaces. This class properly contains the class of semi-ï¡-closed sets and is property contained in the class of pre-semi-closed sets. Also, we introduce and study ï¡srcontinuity and ï¡sr-irresoleteness. We showed that ï¡sr-continuity falls strictly in between semi-ï¡- continuity and pre-semi-continuity.
The soft sets were known since 1999, and because of their wide applications and their great flexibility to solve the problems, we used these concepts to define new types of soft limit points, that we called soft turning points.Finally, we used these points to define new types of soft separation axioms and we study their properties.
(14)
(4)
In this research, a new application has been developed for games by using the generalization of the separation axioms in topology, in particular regular, Sg-regular and SSg- regular spaces. The games under study consist of two players and the victory of the second player depends on the strategy and choice of the first player. Many regularity, Sg, SSg regularity theorems have been proven using this type of game, and many results and illustrative examples have been presented
(1)
The concepts of nonlinear mixed summable families and maps for the spaces that only non-void sets are developed. Several characterizations of the corresponding concepts are achieved and the proof for a general Pietsch Domination-type theorem is established. Furthermore, this work has presented plenty of composition and inclusion results between different classes of mappings in the abstract settings. Finally, a generalized notation of mixing maps and their characteristics are extended to a more general setting.
In this paper we recall the definition of fuzzy length space on a fuzzy set after that we recall basic definitions and properties of fuzzy length. We define fuzzy bounded operator as an introduction to defined fuzzy length of an operator then we proved that the fuzzy length space FB ̃ ̃ consisting of all fuzzy bounded linear operators from a fuzzy length space ̃ into a fuzzy length space ̃ is fuzzy complete if ̃ is fuzzy complete. Also we proved that every finite dimensional fuzzy length space is fuzzy complete.