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]).
The bandwidth requirements of telecommunication network users increased rapidly during the last decades. Optical access technologies must provide the bandwidth demand for each user. The passive optical access networks (PONs) support a maximum data rate of 100 Gbps by using the Orthogonal Frequency Division Multiplexing (OFDM) technique in the optical access network. In this paper, the optical broadband access networks with many techniques from Time Division Multiplexing Passive Optical Networks (TDM PON) to Orthogonal Frequency Division Multiplex Passive Optical Networks (OFDM PON) are presented. The architectures, advantages, disadvantages, and main parameters of these optical access networks are discussed and reported which have many ad
... Show MoreThis paper presents a minimum delay congestion control in differentiated Service communication networks. The premium and ordinary passage services based fluid flow theory is used to build the suggested structure in high efficient manage. The established system is capable to adeptly manage both the physical network resource limitations and indefinite time delay related to networking system structure.
In this paper, we investigate and characterize the effects of multi-channel and rendezvous protocols on the connectivity of dynamic spectrum access networks using percolation theory. In particular, we focus on the scenario where the secondary nodes have plenty of vacant channels to choose from a phenomenon which we define as channel abundance. To cope with the existence of multi-channel, we use two types of rendezvous protocols: naive ones which do not guarantee a common channel and advanced ones which do. We show that, with more channel abundance, even with the use of either type of rendezvous protocols, it becomes difficult for two nodes to agree on a common channel, thereby, potentially remaining invisible to each other. We model this in
... Show MoreThe research aims to apply one of the techniques of management accounting, which is the Quality Function Deployment(QFD) on the Pepsi product in Baghdad Soft Drinks Company and to determine the technical requirements objectively that have been applied in practice in Baghdad Soft Drinks Company / a private shareholding company, as it focuses on meeting the quality requirements and achieving positive quality to provide a product It meets the requirements of current and future customers, hence the importance of research that indicates that the Quality Function Deployment(QFD) is a useful tool to develop the requirements of new products, being a design process driven by customers through their voices, and thus contribute to achieve a competi
... Show MoreThe uptake of Cd(II) ions from simulated wastewater onto olive pips was modeled using artificial neural network (ANN) which consisted of three layers. Based on 112 batch experiments, the effect of contact time (10-240 min), initial pH (2-6), initial concentration (25-250 mg/l), biosorbent dosage (0.05-2 g/100 ml), agitation speed (0-250 rpm) and temperature (20-60ºC) were studied. The maximum uptake (=92 %) of Cd(II) was achieved at optimum parameters of 60 min, 6, 50 mg/l, 1 g/100 ml, 250 rpm and 25ºC respectively.
Tangent sigmoid and linear transfer functions of ANN for hidden and output layers respectively with 7 neurons were sufficient to present good predictions for cadmium removal efficiency with coefficient of correlatio
... Show MoreThe problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.