The aim of this paper is to design a PID controller based on an on-line tuning bat optimization algorithm for the step-down DC/DC buck converter system which is used in the battery operation of the mobile applications. In this paper, the bat optimization algorithm has been utilized to obtain the optimal parameters of the PID controller as a simple and fast on-line tuning technique to get the best control action for the system. The simulation results using (Matlab Package) show the robustness and the effectiveness of the proposed control system in terms of obtaining a suitable voltage control action as a smooth and unsaturated state of the buck converter input voltage of ( ) volt that will stabilize the buck converter sys

In this paper, we define some generalizations of topological group namely -topological group, -topological group and -topological group with illustrative examples. Also, we define grill topological group with respect to a grill. Later, we deliberate the quotient on generalizations of topological group in particular -topological group. Moreover, we model a robotic system which relays on the quotient of -topological group.

This paper is concerned with introducing and studying the new approximation operators based on a finite family of d. g. 'swhich are the core concept in this paper. In addition, we study generalization of some Pawlak's concepts and we offer generalize the definition of accuracy measure of approximations by using a finite family of d. g. 's.

This paper is concerned with the blow-up solutions of a system of two reaction-diffusion equations coupled in both equations and boundary conditions. In order to understand how the reaction terms and the boundary terms affect the blow-up properties, the lower and upper blow-up rate estimates are derived. Moreover, the blow-up set under some restricted assumptions is studied.

Abstract. In this work, some new concepts were introduced and the relationship between them was studied. These concepts are filter directed-toward, nano-closure-directed-toward and nano-closure-converge to point, and some theories and results about these concepts were presented. A definition almost-nano-converges for set, almost-nano-cluster-point, and definition of quasi-nano-Hausdorff-closed and was also called nano-Hausdorff-closed relative, were also presented several theories related to these definitions were presented and the relationship between them was studied . We also provided other generalizations, including nano closure continuous mappings and it was also called as nano-weaklycontinuous- mappings, as well as providing a definit

Multi-carrier direct sequence code division multiple access (MC-DS-CDMA) has emerged recently as a promising candidate for the next generation broadband mobile networks. Multipath fading channels have a severe effect on the performance of wireless communication systems even those systems that exhibit efficient bandwidth, like orthogonal frequency division multiplexing (OFDM) and MC-DS-CDMA; there is always a need for developments in the realisation of these systems as well as efficient channel estimation and equalisation methods to enable these systems to reach their maximum performance. A novel MC-DS-CDMA transceiver based on the Radon-based OFDM, which was recently proposed as a new technique in the realisation of OFDM systems, will be us

This paper contains an equivalent statements of a pre-  space, where  are considered subsets of with the product topology. An equivalence relation between the preclosed set  and a pre-  space, and a relation between a pre-  space and the preclosed set  with some conditions on a function  are found. In addition, we have proved that the graph  of  is preclosed in if  is a pre-  space, where the equivalence relation  on  is open.

     On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that

This paper is concerned with introducing and studying the M-space by using the mixed degree systems which are the core concept in this paper. The necessary and sufficient condition for the equivalence of two reflexive M-spaces is super imposed. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are introduced. From an M-space, a unique supratopological space is introduced. Furthermore, the m-continuous (m-open and m-closed) functions are defined and the fundamental theorem of the m-continuity is provided. Finally, the m-homeomorphism is defined and some of its properties are investigated.

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

            The article describes a certain computation method of -arcs to construct the number of distinct -arcs in  for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons