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

This study aims to derive a general relation between line loads that acting on two-way slab system and the equivalent uniformly distributed loads. This relation will be so useful to structural designer that are used to working with a uniformly distributed load and enable them to use the traditional methods for analysis of two-way systems (e.g. Direct Design Method). Two types of slab systems, Slab System with Beams and Flat Slab Systems, have been considered in this study to include the effect of aspect ratio and type of slab on the proposed relation. Five aspect ratios, l2/l1 of 0.5, 0.75, 1.0, 1.5 and 2.0, have been considered for both types of two-way systems.
All necessary finite element analyses have been executed with SAFE Soft

A Longitudinal opening is used to construct hollow core beam is a cast in site or precast or pre stressed concrete member with continuous voids provided to reduce weight, cost and, as a side benefit, to use for concealed electrical or mechanical runs. Primarily is used as floor beams or roof deck systems. This study investigate the behavior of six beams (solid or with opening) of dimension (length 1000 x height 180 x width120mm) simply support under partial uniformly distributed load, four of these beam contain long opening of varied section (40x40mm) or (80x40mm). The effect of vertical steel reinforcing, opening size and orientations are investigated to evaluate the response of beams. The experimental behavior based on load-deflection

One of the important differences between multiwavelets and scalar wavelets is that each channel in the filter bank has a vector-valued input and a vector-valued output. A scalar-valued input signal must somehow be converted into a suitable vector-valued signal. This conversion is called preprocessing. Preprocessing is a mapping process which is done by a prefilter. A postfilter just does the opposite.

The most obvious way to get two input rows from a given signal is to repeat the signal. Two rows go into the multifilter bank. This procedure is called “Repeated Row” which introduces oversampling of the data by a factor of 2.

 For data compression, where one is trying to find compact transform representations for a

In this paper, we present multiple bit error correction coding scheme based on extended Hamming product code combined with type II HARQ using shared resources for on chip interconnect. The shared resources reduce the hardware complexity of the encoder and decoder compared to the existing three stages iterative decoding method for on chip interconnects. The proposed method of decoding achieves 20% and 28% reduction in area and power consumption respectively, with only small increase in decoder delay compared to the existing three stage iterative decoding scheme for multiple bit error correction. The proposed code also achieves excellent improvement in residual flit error rate and up to 58% of total power consumption compared to the other err