In this paper, the computational complexity will be reduced using a revised version of the selected mapping (SLM) algorithm. Where a partial SLM is achieved to reduce the mathematical operations around 50%. Although the peak to average power ratio (PAPR) reduction gain has been slightly degraded, the dramatic reduction in the computational complexity is an outshining achievement. Matlab simulation is used to evaluate the results, where the PAPR result shows the capability of the proposed method.  

   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.

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

In this paper, we proved that if R is a prime ring, U be a nonzero Lie ideal of R , d be a nonzero (?,?)-derivation of R. Then if Ua?Z(R) (or aU?Z(R)) for a?R, then either or U is commutative Also, we assumed that Uis a ring to prove that: (i) If Ua?Z(R) (or aU?Z(R)) for a?R, then either a=0 or U is commutative. (ii) If ad(U)=0 (or d(U)a=0) for a?R, then either a=0 or U is commutative. (iii) If d is a homomorphism on U such that ad(U) ?Z(R)(or d(U)a?Z(R), then a=0 or U is commutative.

In this paper a new method is proposed to perform the N-Radon orthogonal frequency division multiplexing (OFDM), which are equivalent to 4-quadrature amplitude modulation (QAM), 16-QAM, 64-QAM, 256-QAM, ... etc. in spectral efficiency. This non conventional method is proposed in order to reduce the constellation energy and increase spectral efficiency. The proposed method gives a significant improvement in Bit Error Rate performance, and keeps bandwidth efficiency and spectrum shape as good as conventional Fast Fourier Transform based OFDM. The new structure was tested and compared with conventional OFDM for Additive White Gaussian Noise, flat, and multi-path selective fading channels. Simulation tests were generated for different channels

In this paper, the complex of Lascoux in the case of partition (3,3,2) has been studied by using diagrams ,divided power of the place polarization ) (k ij ,Capelli identites and the idea of mapping Cone .

Many organizations today are  interesting to implementing lean manufacturing principles  that should enable them to eliminating the wastes to reducing a  manufacturing lead time.  This paper concentrates on  increasing  the competitive level of the company in globalization markets and improving of the productivity by reducing the manufacturing lead time. This will be by using the main tool of lean manufacturing which is value stream mapping (VSM) to identifying all the activities of manufacturing process (value and non-value added activities) to reducing elimination of wastes (non-value added activities) by converting a manufacturing system to pull instead of push by applying some of pull system strategies a

The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.

Flying Ad hoc Networks (FANETs) has developed as an innovative technology for access places without permanent infrastructure. This emerging form of networking is construct of flying nodes known as unmanned aerial vehicles (UAVs) that fly at a fast rate of speed, causing frequent changes in the network topology and connection failures. As a result, there is no dedicated FANET routing protocol that enables effective communication between these devices. The purpose of this paper is to evaluate the performance of the category of topology-based routing protocols in the FANET. In a surveillance system involving video traffic, four routing protocols with varying routing mechanisms were examined. Additionally, simulation experiments conduct

In this paper we define and study new generalizations of continuous functions namely, -weakly (resp., w-closure, w-strongly) continuous and the main properties are studies: (a) If f : X®Y is w-weakly (resp., w-closure, w-strongly) continuous, then for any AÌX and any BÌY the restrictions fïA : A®Y and fB : f -1(B)®B are w-weakly (resp., w-closure, w-strongly) continuous. (b) Comparison between deferent forms of generalizations of continuous functions. (c) Relationship between compositions of deferent forms of generalizations of continuous functions. Moreover, we expanded the above generalizations and namely almost w-weakly (resp., w-closure, w-strongly) continuous functions and we state and prove several results concerning it.