The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination

     In this research, several estimators concerning the estimation are introduced. These estimators are closely related to the hazard function by using one of the nonparametric methods namely the kernel function for censored data type with varying bandwidth and kernel boundary. Two types of bandwidth are used:  local bandwidth and global bandwidth. Moreover, four types of boundary kernel are used namely: Rectangle, Epanechnikov, Biquadratic and Triquadratic and the proposed function was employed with all kernel functions. Two different simulation techniques are also used for two experiments to compare these estimators. In most of the cases, the results have proved that the local bandwidth is the best for all the

Java is a high-level , third generation programming language were introduced Javaoptics Open Source Physics (OSP) as a new simulation for design one of the most important interference optical coating called antireflection coating. It is recent developments in deign thin-film coatings. (OSP) shows multiple beam interferences from a parallel dielectric thin film and the evolution of reflection factors. It is simple to use and efficiently also can serve educational purposes. The obtained results have been compared with needle method

   The research  includes the study and calculation of the modulation function of Optical Semiconductor Fractal  Modulator and spatial frequency for different values of Silicon modulator transmittance percentage(10%,35%,45%,58%),it found the relation between the modulation function of Silicon and spatial frequency, the exponential relation of all values of the transmittance , the best state of modulation function when the value of transmittance is T=58% ,also the research includes the study of the relation of transmittance with different values of refractive index of Silicon . So the research involves building a computer program of output data which would relate to fractal optical modulation made of semiconductor mate