Finding communities of connected individuals in complex networks is challenging, yet crucial for understanding different real-world societies and their interactions. Recently attention has turned to discover the dynamics of such communities. However, detecting accurate community structures that evolve over time adds additional challenges. Almost all the state-of-the-art algorithms are designed based on seemingly the same principle while treating the problem as a coupled optimization model to simultaneously identify community structures and their evolution over time. Unlike all these studies, the current work aims to individually consider this three measures, i.e. intra-community score, inter-community score, and evolution of community over

This paper proposes a collaborative system called Recycle Rewarding System (RRS), and focuses on the aspect of using information communication technology (ICT) as a tool to promote greening. The idea behind RRS is to encourage recycling collectors by paying them for earning points. In doing so, both the industries and individuals reap the economical benefits of such system. Finally, and more importantly, the system intends to achieve a green environment for the Earth. This paper discusses the design and implementation of the RRS, involves: the architectural design, selection of components, and implementation issues. Five modules are used to construct the system, namely: database, data entry, points collecting and recording, points reward

An accurate assessment of the pipes’ conditions is required for effective management of the trunk sewers. In this paper the semi-Markov model was developed and tested using the sewer dataset from the Zublin trunk sewer in Baghdad, Iraq, in order to evaluate the future performance of the sewer. For the development of this model the cumulative waiting time distribution of sewers was used in each condition that was derived directly from the sewer condition class and age data. Results showed that the semi-Markov model was inconsistent with the data by adopting ( 2 test) and also, showed that the error in prediction is due to lack of data on the sewer waiting times at each condition state which can be solved by using successive conditi

This paper presents a novel idea as it investigates the rescue effect of the prey with fluctuation effect for the first time to propose a modified predator-prey model that forms a non-autonomous model. However, the approximation method is utilized to convert the non-autonomous model to an autonomous one by simplifying the mathematical analysis and following the dynamical behaviors. Some theoretical properties of the proposed autonomous model like the boundedness, stability, and Kolmogorov conditions are studied. This paper's analytical results demonstrate that the dynamic behaviors are globally stable and that the rescue effect improves the likelihood of coexistence compared to when there is no rescue impact. Furthermore, numerical simul

In recent years, the rapid development in the field of wireless technologies led to the appearance of a new topic, known as the Internet of things (IoT). The IoT applications can be found in various fields of our life, such as smart home, health care, smart building, and etc. In all these applications, the data collected from the real world are transmitted through the Internet; therefore, these data have become a target of many attacks and hackers. Hence, a secure communication must be provided to protect the transmitted data from unauthorized access. This paper focuses on designing a secure IoT system to protect the sensing data. In this system, the security is provided by the use of Lightweight AES encryption algorithm to encrypt the d

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

This work represents development and implementation a programmable model for evaluating pumping technique and spectroscopic properties of solid state laser, as well as designing and constructing a suitable software program to simulate this techniques . A study of a new approach for Diode Pumped Solid State Laser systems (DPSSL), to build the optimum path technology and to manufacture a new solid state laser gain medium. From this model the threshold input power, output power optimum transmission, slop efficiency and available power were predicted. different systems configuration of diode pumped solid state laser for side pumping, end pump method using different shape type (rod,slab,disk) three main parameters are (energy transfer efficie

Achieving energy-efficient Wireless Sensor Network (WSN) that monitors all targets at
all times is an essential challenge facing many large-scale surveillance applications.Singleobjective
set cover problem (SCP) is a well-known NP-hard optimization problem used to
set a minimum set of active sensors that efficiently cover all the targeted area. Realizing
that designing energy-efficient WSN and providing reliable coverage are in conflict with
each other, a multi-objective optimization tool is a strong choice for providing a set of
approximate Pareto optimal solutions (i.e., Pareto Front) that come up with tradeoff
between these two objectives. Thus, in the context of WSNs design problem, our main
contribution is to

In this paper, introduce a proposed multi-level pseudo-random sequence generator (MLPN). Characterized by its flexibility in changing generated pseudo noise (PN) sequence according to a key between transmitter and receiver. Also, introduce derive of the mathematical model for the MLPN generator. This method is called multi-level because it uses more than PN sequence arranged as levels to generation the pseudo-random sequence. This work introduces a graphical method describe the data processing through MLPN generation. This MLPN sequence can be changed according to changing the key between transmitter and receiver. The MLPN provides different pseudo-random sequence lengths. This work provides the ability to implement MLPN practically