A three-stage learning algorithm for deep multilayer perceptron (DMLP) with effective weight initialisation based on sparse auto-encoder is proposed in this paper, which aims to overcome difficulties in training deep neural networks with limited training data in high-dimensional feature space. At the first stage, unsupervised learning is adopted using sparse auto-encoder to obtain the initial weights of the feature extraction layers of the DMLP. At the second stage, error back-propagation is used to train the DMLP by fixing the weights obtained at the first stage for its feature extraction layers. At the third stage, all the weights of the DMLP obtained at the second stage are refined by error back-propagation. Network structures and values of learning parameters are determined through cross-validation, and test datasets unseen in the cross-validation are used to evaluate the performance of the DMLP trained using the three-stage learning algorithm. Experimental results show that the proposed method is effective in combating overfitting in training deep neural networks.
Deep beams are used in wide construction fields such as water tanks, foundations, and girders in multi-story buildings to provide certain areas free of columns. In practice it is quite often occurring to create web opening in deep beams to supply convenient passage of ventilation ducts, cable channels, gas and water pipes. Experimental studies of ten 10 deep beams were carried out, where two of them are control specimens without openings and eight with large web openings in the shear spans. The variables that have been adopted are the ratio of the shear span to the overall depth of the member cross-section, location and dimensions of the opening. Test results showed that there was a decrease in the load carrying capacity of deep bea
... Show MoreDeep beams are used in wide construction fields such as water tanks, foundations, and girders in multi-story buildings to provide certain areas free of columns. In practice it is quite often occurring to create web opening in deep beams to supply convenient passage of ventilation ducts, cable channels, gas and water pipes. Experimental studies of ten 10 deep beams were carried out, where two of them are control specimens without openings and eight with large web openings in the shear spans. The variables that have been adopted are the ratio of the shear span to the overall depth of the member cross-section, location and dimensions of the opening. Test results showed that there was a decrease in the load carrying capacity of deep bea
... Show MoreIt is commonly known that Euler-Bernoulli’s thin beam theorem is not applicable whenever a nonlinear distribution of strain/stress occurs, such as in deep beams, or the stress distribution is discontinuous. In order to design the members experiencing such distorted stress regions, the Strut-and-Tie Model (STM) could be utilized. In this paper, experimental investigation of STM technique for three identical small-scale deep beams was conducted. The beams were simply supported and loaded statically with a concentrated load at the mid span of the beams. These deep beams had two symmetrical openings near the application point of loading. Both the deep beam, where the stress distribution cannot be assumed linear, and the ex
... Show MoreThis paper presents a new algorithm in an important research field which is the semantic word similarity estimation. A new feature-based algorithm is proposed for measuring the word semantic similarity for the Arabic language. It is a highly systematic language where its words exhibit elegant and rigorous logic. The score of sematic similarity between two Arabic words is calculated as a function of their common and total taxonomical features. An Arabic knowledge source is employed for extracting the taxonomical features as a set of all concepts that subsumed the concepts containing the compared words. The previously developed Arabic word benchmark datasets are used for optimizing and evaluating the proposed algorithm. In this paper,
... Show MoreIn general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot. Simulation results, whi
... Show MoreBinary relations or interactions among bio-entities, such as proteins, set up the essential part of any living biological system. Protein-protein interactions are usually structured in a graph data structure called "protein-protein interaction networks" (PPINs). Analysis of PPINs into complexes tries to lay out the significant knowledge needed to answer many unresolved questions, including how cells are organized and how proteins work. However, complex detection problems fall under the category of non-deterministic polynomial-time hard (NP-Hard) problems due to their computational complexity. To accommodate such combinatorial explosions, evolutionary algorithms (EAs) are proven effective alternatives to heuristics in solvin
... Show MoreThe virtual decomposition control (VDC) is an efficient tool suitable to deal with the full-dynamics-based control problem of complex robots. However, the regressor-based adaptive control used by VDC to control every subsystem and to estimate the unknown parameters demands specific knowledge about the system physics. Therefore, in this paper, we focus on reorganizing the equation of the VDC for a serial chain manipulator using the adaptive function approximation technique (FAT) without needing specific system physics. The dynamic matrices of the dynamic equation of every subsystem (e.g. link and joint) are approximated by orthogonal functions due to the minimum approximation errors produced. The contr
Imitation learning is an effective method for training an autonomous agent to accomplish a task by imitating expert behaviors in their demonstrations. However, traditional imitation learning methods require a large number of expert demonstrations in order to learn a complex behavior. Such a disadvantage has limited the potential of imitation learning in complex tasks where the expert demonstrations are not sufficient. In order to address the problem, we propose a Generative Adversarial Network-based model which is designed to learn optimal policies using only a single demonstration. The proposed model is evaluated on two simulated tasks in comparison with other methods. The results show that our proposed model is capable of completing co
... Show More