An indoor spraying robot is built in this research to solve numerous challenges associated with manual spraying. The mechanical, hardware and essential technologies used are all detailed and designed. The proposed spraying robot's conceptual design is split into two parts: hardware and software. The mechanical design, manufacturing, electrical, and electronics systems are described in the hardware part, while the control of the robot is described in the software section. This robot's kinematic and dynamic models were developed using three links that move in the x, y, and z directions. The robot was then designed using SolidWorks software to compute each connection's deflection and maximum stresses. The characteristics of the stepper moto

In this paper, we present an approximate method for solving integro-differential equations of multi-fractional order by using the variational iteration method.
First, we derive the variational iteration formula related to the considered problem, then prove its convergence to the exact solution. Also we give some illustrative examples of linear and nonlinear equations.

Multi-document summarization is an optimization problem demanding optimization of more than one objective function simultaneously. The proposed work regards balancing of the two significant objectives: content coverage and diversity when generating summaries from a collection of text documents.

     Any automatic text summarization system has the challenge of producing high quality summary. Despite the existing efforts on designing and evaluating the performance of many text summarization techniques, their formulations lack the introduction of any model that can give an explicit representation of – coverage and diversity – the two contradictory semantics of any summary. In this work, the design of

A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optim

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

Android operating system, since its first start, is growing very fast and takes a large space in smart devices market. It is built and developed on Linux and designed basically for touch screen devices such as, mobiles, tablets, etc. Mobile devices are markedly complicated and feature-rich; therefore they are prone to reliability of software and performance problems. Because of the small resources, smart devices, such as CPU, RAM, suffer from problems. One of these problems is Software Aging (SA). SA is recognized in long running OSs as a shortage in resources, performance retreating, and finally failure. SA is looked at from two sides, namely the poor response time of application which represents the end user side and the shortage in me

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric

The path and its nodal purposes
Abstract
This study has come to indicate the doctrinal purposes of faith in this path، It was composed of an introduction and four demands، as follows:
The first requirement: the intentions of distinguishing between the ranks of people according to divine justice، as those who pass by him are different. Some of them are safe by his work، surviving from the fire، and some of them are not peace، he falls into the fire of Hell، and all of them are different in their ranks in a manner consistent with the justice of God Almighty and the works they have given themselves.
The second requirement: the purposes of divine mercy in honoring the Prophet and his nation on the path and embodying their

Aerial manipulation of objects has a number of advantages as it is not limited by the morphology of the terrain. One of the main problems of the aerial payload process is the lack of real-time prediction of the interaction between the gripper of the aerial robot and the payload. This paper introduces a digital twin (DT) approach based on impedance control of the aerial payload transmission process. The impedance control technique is implemented to develop the target impedance based on emerging the mass of the payload and the model of the gripper fingers. Tracking the position of the interactional point between the fingers of gripper and payload, inside the impedance control, is achieved using model predictive control (MPD) approach.