<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">IJCNS</journal-id><journal-title-group><journal-title>Int'l J. of Communications, Network and System Sciences</journal-title></journal-title-group><issn pub-type="epub">1913-3715</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ijcns.2014.77022</article-id><article-id pub-id-type="publisher-id">IJCNS-47663</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>COMPUTER SCIENCE &amp; COMMUNICATIONS</subject></subj-group></article-categories><title-group><article-title>Unsupervised Neural Network Approach to Frame Analysis of Conventional Buildings</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Lácides</surname><given-names>R. Pinto</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Alejandro</surname><given-names>R. Zambrano</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>Universidad Nacional Experimental Politécnica, UNEXPO, Puerto Ordaz, Venezuela</addr-line></aff><aff id="aff1"><addr-line>Universidad de La Guajira, UNIGUAJIRA, Riohacha, Colombia</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>lacidesrafael@yahoo.com(LRP)</email>;<email>arzambrano@unexpo.edu.ve(ARZ)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>09</day><month>07</month><year>2014</year></pub-date><volume>07</volume><issue>07</issue><fpage>203</fpage><lpage>211</lpage><history><date date-type="received"><day>28</day>	<month>May</month>	<year>2014</year></date><date date-type="rev-recd"><day>20</day>	<month>June</month>	<year>2014</year>	</date><date date-type="accepted"><day>30</day>	<month>June</month>	<year>2014</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
	In this paper, an
Artificial Neural Network (ANN) model is used for the analysis of any type of
conventional building frame under an arbitrary loading in terms of the
rotational end moments of its members. This is achieved by training the
network. The frame will deform so that all joints will rotate an angle. At the
same time, a relative lateral sway will be produced at the r<sub>th</sub> floor level, assuming that the effects of axial
lengths of the bars of the structure are not altered. The issue of choosing an
appropriate neural network structure and providing structural parameters to
that network for training purposes is addressed by using an unsupervised
algorithm. The model’s parameters, as well as the rotational variables, are
investigated in order to get the most accurate results. The model is then evaluated by using the iteration method of
frame analysis developed by Dr. G. Kani. In general, the new approach
delivers better results compared to several commonly used methods of structural
analysis.
</p></abstract><kwd-group><kwd>Structural Analysis</kwd><kwd> Neural Networks</kwd><kwd> Unsupervised Training</kwd><kwd> End Moments</kwd><kwd> Rotational End  Moments</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>In the past decades, great strides have been taken in developing frame analysis. Throughout the evolution of structural science, most of the work has been done regarding frame analysis. However, the elasticity theory is available for all approaches.</p><p>Four approaches have been presented. The strength of materials approach is the simplest one among them. It is suitable for simple structural members which are subjected to a specific loading. For the analysis of entire systems, this approach can be used in conjunction with static. The solutions are based on linear isotropic infinitesimal elasticity and Euler-Bernoulli beam theory. A second approach, called moment distribution method, was commonly used in the 1930’s. Its essential idea involves no mathematical relations other than the simplest arithmetic [<xref ref-type="bibr" rid="scirp.47663-ref1">1</xref>] . In order to understand the achievement of moment distribution approach, it would be helpful reviewing developments of elasticity theory and its fundamental principles, as it applies to statically indeterminate structures. The iteration method of frame analysis developed by G. Kani [<xref ref-type="bibr" rid="scirp.47663-ref2">2</xref>] , has proved to be extremely satisfactory for structure analysis. Nowadays the moment distribution approach is no longer commonly used due to the fact that computers have changed the way in which engineers evaluate structures. A third method is referred to as the matrix approach. Some believe that during the 1920’s or the early 1930’s, somebody working for the Britain or German aircraft industry was the first person ever to write down stiffness [<xref ref-type="bibr" rid="scirp.47663-ref3">3</xref>] . The major steps in the evolution of Matrix Structural Analysis (MSA) are found in the fundamental contributions of four main authors: Collar, Duncan, Argyris and Turner. Between 1934 and 1938 Collar and Duncan [<xref ref-type="bibr" rid="scirp.47663-ref4">4</xref>] published the first papers which introduced the representation and terminology for matrix systems that are used today. In 1930 they formulated discrete aero elasticity in matrix form. The first couple of journal-published papers and the first book in the field appeared in 1934-1938. The second breakthrough in matrix structural analysis emerged among 1954 and 1955, when Professor Argyris systemized a formal unification of Force and Displacement Methods using dual energy theorems [<xref ref-type="bibr" rid="scirp.47663-ref5">5</xref>] . M. Turner proposed in 1959 the Direct Stiffness Method of structural analysis [<xref ref-type="bibr" rid="scirp.47663-ref6">6</xref>] , one that has undergone the most dramatic changes: an efficient and general computer-based implementation of the incipient Finite Element Method (FEM). Nowadays it can find other models like the Finite Volume Model [<xref ref-type="bibr" rid="scirp.47663-ref7">7</xref>] , used to solve fluids dynamics problems.</p><p>Recently, the neural network approach had been applied to many branches of science. This approach is becoming a strong tool for providing structural engineers with sufficient details for design purposes and management practices.</p><p>This paper evaluates a neural network approach on frame analysis using an unsupervised algorithm. The results are obtained programming the entire formulation of the algorithm using MATLAB. The aim of the study is to estimate the rotational end moment, and this is depicted in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p></sec><sec id="s2"><title>2. Artificial Neural Networks</title><p>An ANN is an information processing system which operates on inputs to extract information, and produces outputs corresponding to the extracted information [<xref ref-type="bibr" rid="scirp.47663-ref8">8</xref>] . Also called connectionists models, parallel distributed processing models and neuromorphic systems, its structure was modeled after that of the human brain and its components. There exist a variety of ANN models and learning procedures. Feed forward networks are well known approaches for prediction [<xref ref-type="bibr" rid="scirp.47663-ref9">9</xref>] -[<xref ref-type="bibr" rid="scirp.47663-ref11">11</xref>] and database processing applications. In this type of ANN, the weighted and biased links feed activation functions from the input layer to the output layer in forward direction. Learning in neural networks comprises adjusting the weights and biases of links. It can be found in the literature [<xref ref-type="bibr" rid="scirp.47663-ref12">12</xref>] -[<xref ref-type="bibr" rid="scirp.47663-ref16">16</xref>] that neural networks had been successfully applied to solve structural problems like damage identification and optimum design of structures, but only taking into account supervised training, which means the necessity of a training set including the patterns and targets. In this paper, we propose a novel ANN architecture with an unsupervised training to solve a structural problem. The success of applying such self-supervised neural networks to any problem depends on training the neural network with sufficient range of input data and adequate operating conditions.</p></sec><sec id="s3"><title>3. General Architecture of Proposed Network</title><p>An artificial neural network model is a system composed of many simple processors, each having a local memory. Processing elements are connected by unidirectional links that carry discriminating data. The linear feed forward net has been found to be a suitable one for training techniques. Outputs of neurons in one layer are transferred to their corresponding neuron in another layer through a link that amplifies or inhibits such outputs through weighting factors. Except for the processing elements of the input layer, the input of each neuron is the sum of the weighted outputs of the node in the prior layer and a bias. Each neuron is activated according to its input, activation function, and threshold value.</p><p><xref ref-type="fig" rid="fig2">Figure 2</xref> shows the general feed-forward multilayer network model, including two hidden layers. The distribution factors beams of the input layer constitutes the neurons inputs in layer (L<sub>1</sub>), representing a set of variables</p><fig id="fig1"><label>Figure 1</label><caption><p> Building frame under any given loading</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\e06aadf5-1ca3-4e85-a94d-ba81aa05a586.png"/></fig><fig id="fig2"><label>Figure 2</label><caption><p> Feed-forward multilayer network</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\e15be1a3-89f5-48c9-8f58-24ad6d133840.png"/></fig><p>(x<sub>1</sub>, x<sub>2</sub>, x<sub>3</sub>)<sup>T</sup>.</p><p>The inputs and outputs for the i<sub>th</sub> neuron are:</p><disp-formula id="scirp.47663-formula1023"><label>(1)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\1940e9d8-a616-456f-b8e7-9239ea228ddc.png"/></disp-formula><disp-formula id="scirp.47663-formula1024"><label>(2)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\c9a9177c-605b-44e6-b330-b82107b2e1b5.png"/></disp-formula><p>where f<sub>i</sub> constitutes an activation function (linear transfer function). Its behavior is that of a threshold function, in which the output of the neuron is generated if a threshold level, is reached. The net input and output to the j<sub>th</sub> neuron are similarly treated as in (1) and (2).</p><p><xref ref-type="fig" rid="fig3">Figure 3</xref> shows a neuron simulating a typical processing element in the neural network. The neuron performs a sum-of-products calculation using the input and the connections weights, adding then the threshold value from</p><fig id="fig3"><label>Figure 3</label><caption><p> Output processing in a network</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\4953234d-4909-4385-881a-2c9eee98cba6.png"/></fig><p>each neuron of the layer, and passing this argument to the transfer function to compute the output. The net input and outputs to and from the i<sub>th</sub> neuron of the L<sub>th</sub> layer are:</p><disp-formula id="scirp.47663-formula1025"><label>(3)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\51848068-fec9-43f7-bd3d-db0fdb2891e8.png"/></disp-formula><p>And the error,</p><disp-formula id="scirp.47663-formula1026"><label>(4)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\56b73b76-082e-43d1-85bb-5b2f59e90cb3.png"/></disp-formula><p>The output for the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\62928ed2-9c36-49fc-b7a3-0c6d0ba8085e.png" xlink:type="simple"/></inline-formula> neuron in the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\2bca1848-e6d1-4c0b-bb57-25873c55c18a.png" xlink:type="simple"/></inline-formula> layer at the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\2dc639ad-4a98-4be5-ae8a-c9f1877268a8.png" xlink:type="simple"/></inline-formula> iteration is:</p><disp-formula id="scirp.47663-formula1027"><label>(5)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\28ecfda8-0f66-46e0-95d7-13eb779eaafc.png"/></disp-formula><p>The output for the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\7ee87fdf-149b-4dba-95c0-fe531566872d.png" xlink:type="simple"/></inline-formula> neuron in the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\0a09c6b8-c7af-44ee-b035-bed35f15f37a.png" xlink:type="simple"/></inline-formula> layer at the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\72387f9d-90c0-4b81-a823-b5ef37ce18b3.png" xlink:type="simple"/></inline-formula> iteration is:</p><disp-formula id="scirp.47663-formula1028"><label>(6)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\429f6d18-4595-4912-b813-6e4a9d868863.png"/></disp-formula><p>Specifically, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\df7cf0fa-09f1-4e1b-9db1-71c00d6e3355.png" xlink:type="simple"/></inline-formula>is represented by a linear transfer function:</p><disp-formula id="scirp.47663-formula1029"><label>(7)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\8f4611ae-5553-43d5-a7f2-8d9ceb6d4f3b.png"/></disp-formula><p>But <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\a8845b0f-0ee7-45ca-a6c5-dfe654af85d2.png" xlink:type="simple"/></inline-formula> represents the input x<sub>j</sub> for the i<sub>th</sub> neuron and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\5ac1abe9-acab-47f4-8d3a-9883b3e11fef.png" xlink:type="simple"/></inline-formula> represents its weight, such that,</p><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\7aff794a-5149-4320-88b7-3a529754694c.png" xlink:type="simple"/></inline-formula>, and<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\5f2d0b4d-09ee-4b22-b7a2-733adcee85da.png" xlink:type="simple"/></inline-formula>.</p><p>Consequently,</p><disp-formula id="scirp.47663-formula1030"><label>(8)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\0e63705a-22a7-4059-b8c3-5cdbd405361d.png"/></disp-formula><p>where <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\eb3e754a-57cf-4972-a743-c518b5279f68.png" xlink:type="simple"/></inline-formula> represents the output variation for two consecutive iterations, and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\4c0f4824-7db2-4247-97d9-e9c9f4fbf708.png" xlink:type="simple"/></inline-formula> acts as a threshold value.</p></sec><sec id="s4"><title>4. Network Algorithm</title><p>The connectivity of the neural network model allows processors on one level to communicate with each neuron at the next level. Each processing element in one layer is connected to its corresponding processing element in the next one by the means of an excitatory weight and bias. This is known as a “locally-connected” topology. Discrepancies between actual and target output values results in evaluation of weights and bias changes. After a complete presentation of the training data, a new set of weights and biases are obtained, and new outputs are again evaluated in a feed-forward manner until a specific tolerance for error is obtained. Unsupervised training uses unlabeled training data and requires no external teaching.</p><p>In our neural network model, a processing element’s input is connected to a specific node. The node has associated node function which carries out local computation based on the input and bias values. In the input layer, the value of W<sub>ij</sub> represents the synaptic weight between the recipient node, whose activity is x<sub>i</sub>, and the previous node whose activity is x<sub>j</sub>.</p><p>There are four descriptors used in the algorithm definition:</p><p>• Equation type: Algebraic, the net performs calculations determined primarily by the state of the network.</p><p>• Connection topology: The connectivity of the network is the measure of how many processors on one level communicate with each processor at the next level. This is the “locally-connected” topology we discussed earlier, and for a one-dimensional space the matrix will be banded diagonally.</p><p>• Processing scheme: Nodes in the network are updated synchronously, since the network output at the current iteration depends entirely on its prior state.</p><p>• Synaptic transmission mode: The neural network model takes neural values multiplied by synaptic weights summed across the input to a neuron. The neuron acts on the summed value and its output is multiplied by weights and used as an input for other neurons.</p><p>It is known that supervised learning in neural networks based on the popular back propagation method can be often trapped in a local minimum of the error function. How did the proposed algorithm with the “locally-con- nected” topology overcome such question? This will be asked in a future paper, as well as the characteristics and properties, in detail, of the proposed model. The complexity of the model in the case we have more than two hidden layers depends on the structure to be analyzed: one neuron corresponds to one node in the structure, and the unsupervised training algorithm can deal with any building frame, that means, with any neurons configuration.</p></sec><sec id="s5"><title>5. Selecting Structural Analysis Parameters</title><p>The most pertinent variables in structural analysis are the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\0687d1e4-5f36-4607-a133-b6694e8586dc.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\0d08e7d8-33bb-4604-8b9f-aa3964136d65.png" xlink:type="simple"/></inline-formula> fixed end moments induced at the ends of the members under the action of the external loads. Assuming the ends to be completely fixed,</p><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\41a50413-a6f4-4a9b-a9fb-3253ea8ef1e9.png" xlink:type="simple"/></inline-formula>is termed as the rotational end moment due to rotation <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\56124de1-3fd0-4ebf-89bf-6dd75c705944.png" xlink:type="simple"/></inline-formula> (expressed in radians) for the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\4d02b806-a169-4aca-9db1-ba3faeb401af.png" xlink:type="simple"/></inline-formula></p><p>end; <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\9822b65b-f3a5-4655-b7ea-5b0c8b8a0584.png" xlink:type="simple"/></inline-formula>is similarly termed as the rotational end moment due to rotation <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\6a47d359-7650-407a-be9b-a9e9e569b78a.png" xlink:type="simple"/></inline-formula> (also expressed in ra-</p><p>dians) for the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\a189cf3d-984d-4b6d-8d11-464b08d71029.png" xlink:type="simple"/></inline-formula> end. <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\68646056-44e5-47f5-9c14-56ce31c646fc.png" xlink:type="simple"/></inline-formula>is the displacement moment in the column consisting of the lateral</p><p>displacement due to the floor sway, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\d7a3b4cf-89f5-4e80-817d-a34dc092efb0.png" xlink:type="simple"/></inline-formula>is the same for all the members meeting at the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\aa968015-07f6-45e4-a73e-7910330e5ee1.png" xlink:type="simple"/></inline-formula> node, while <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\19817aba-ca20-4fe7-84a1-3f66b3b369d4.png" xlink:type="simple"/></inline-formula></p><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\57780f85-b14f-4c80-8abe-c3517359f795.png" xlink:type="simple"/></inline-formula>is a distribution factor for the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\1cf60e1d-ccf7-4847-86e3-5263902940cd.png" xlink:type="simple"/></inline-formula> member, and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\581ee4d0-3215-4b8a-b5a7-b235f4b54fa7.png" xlink:type="simple"/></inline-formula> is the lateral displace-</p><p>ment distribution factor. <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\cc33c819-c349-4245-9587-fc4dee821e97.png" xlink:type="simple"/></inline-formula>represents the stiffness for the <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\31f9240a-931f-4d22-88af-b806b43a963f.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\549be68e-c3e9-4c1c-a59a-8e7f5835e738.png" xlink:type="simple"/></inline-formula>, the sum of stiffness for all the</p><p>members meeting at the node <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\ef84f33f-c99a-464a-8386-fe0bb4cbda72.png" xlink:type="simple"/></inline-formula> These parameters are presented in dimensionless form in several previous studies. <xref ref-type="table" rid="table1">Table 1</xref> shows a summary of the most effective dimensionless parameters, which are commonly used for investigating the structural analysis problem.</p><p>The final expression developed for the total end moments <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\783bb355-f519-4e52-9f2c-ff89f10a19e0.png" xlink:type="simple"/></inline-formula> is, for beams:</p><disp-formula id="scirp.47663-formula1031"><label>(9)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\473c919c-7e0f-4699-9a07-a0aa72c4a13a.png"/></disp-formula><p>And for columns:</p><disp-formula id="scirp.47663-formula1032"><label>(10)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\e4821b4f-bd33-4228-8312-e1251a65bad8.png"/></disp-formula><p>In the frame analysis developed in the neural network model, the final end moments <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\e56305c0-da94-42ec-a7ac-f9b60279d302.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\1bced9e5-47bb-4ae7-87e2-dd59462b13ec.png" xlink:type="simple"/></inline-formula> are determined by finding out the different components<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\96bef7ee-f3a4-40bd-854c-8b2bd77ed579.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\ac0ea418-f09f-4257-b46c-bcf6498aa6a4.png" xlink:type="simple"/></inline-formula>and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\9432fcb9-f61d-4241-bbe5-ed488266f1f3.png" xlink:type="simple"/></inline-formula> separately, and then adding them up as per equations (9) and (10). The components of final end moments will be considered positive in clockwise.</p></sec><sec id="s6"><title>6. Training the Network</title><p>The distribution factors corresponding to the first layer of the frame’s nodes are presented as an input vector to the input layer, and rotational end moments <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\ceb2368d-4a96-4935-9c06-016ae48fa90b.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\f277146a-c7a8-4ab2-aa16-cf464602b5a9.png" xlink:type="simple"/></inline-formula>, as the outputs. In other words, the input layer contains three neurons, while the output layer contains five. Between the two layers, there are hidden layers that</p><table-wrap id="table1"  position="float"><object-id pub-id-type="pii">Table 1</object-id><label>Table 1</label><caption><p>. Structural analysis parameters</p></caption><table><thead><tr><th align="center" valign="middle"  rowspan="2"  >Total End Moment  Formulas</th><th align="center" valign="middle"  colspan="2"  >Selected Variables</th></tr></thead><tbody><tr><td align="center" valign="middle" >Dependent Variables</td><td align="center" valign="middle" >Independent Variables</td></tr><tr><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >Beams</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >Column</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >Node i</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr></tbody></table></table-wrap><p>contain a suitable number of neurons. The network was trained with seven iterations. The number of neurons in the hidden layers and adjustable parameters like weights and biases were determined by the number of nodes in the frame, the distribution factors and the rotational end moments.</p><p>For any member<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\5e0dabe2-638b-4894-8274-6ae2d763fed5.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\162ab470-4b37-4c10-b7b7-b5815fe88565.png" xlink:type="simple"/></inline-formula>is expressed in terms of the fixed end moments <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\715b9b1c-2706-4f38-b4a6-32164f07f72d.png" xlink:type="simple"/></inline-formula> and the far end rotational moments<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\57811386-22cd-4660-9b32-3a9c331e9c93.png" xlink:type="simple"/></inline-formula>, as follows:</p><disp-formula id="scirp.47663-formula1033"><label>(11)</label><inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\75f851eb-bcfe-4e70-b0ac-69eeb4c1b7c8.png"/></disp-formula><p>The values <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\c4496a61-d626-4c0c-8523-85d42283dd69.png" xlink:type="simple"/></inline-formula> are then found by adding up the fixed end moments acting at an <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\f98feef8-0cc8-473a-a109-b2df90f09ac0.png" xlink:type="simple"/></inline-formula> node.</p></sec><sec id="s7"><title>7. The Procedure</title><p>The procedure depends on the solution of three problems for the determination of member constants on fixed end moments, the stiffness at each end of member, and of the over-carry factor (distribution factors <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\90f50d3b-4b4e-4dfa-89ae-62651b00c920.png" xlink:type="simple"/></inline-formula> for the rotational end moments and distribution factors <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\10bcadda-d698-4c7a-97b6-49d901b7305b.png" xlink:type="simple"/></inline-formula> for the lateral displacement moments) at each end for each member of the frame under consideration. The determination of these values is not a part of the presented approach.</p><p>The network has four layers, three inputs and five output values. The function network creates the net, which generates the first layer weights and biases for the four linear layers required for this problem. These weights and biases can now be trained incrementally using the algorithm. The network must be trained in order to obtain first layer weights and biases. For the second, third and fourth layers, the weights and biases are modified in response to network’s inputs and will lead to the correct output vector. There are not target outputs available. The linear network was able to adapt very quickly to the change in the outputs. The fact that it takes only seven iterations for the network to learn the input pattern is quite an impressive accomplishment.</p><p>The scheme for entering the calculations systematically is shown in <xref ref-type="fig" rid="fig2">Figure 2</xref>. The procedure explained above, is best illustrated by solving the structure shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>, which is loaded in a rather complex fashion. The distribution factors for nodes 1, 2 and 3 constitute the net’s input vector.</p><p>The fixed end moments for the different loaded members are calculated by using the standard formula available in any structural handbook. Having completed these preliminary calculations, the training can be initiated. The network was set up with the three parameters (distribution factors of the beam) as the input, and the rotational end moments due to rotation as the outputs determined by the first layer.</p><p>The calculation starts in the input layer and continues from one layer to the next. Such calculation is carried out quickly. After 6 or 7 iterations have been performed, as explained earlier, it will be noted that there is little or no change in the values of two consecutive sets of calculations. The calculations are now stopped and the values of the last iteration are taken as the correct ones, with the previous values being ignored. For the sake of clarity, these final values have been indicated separately in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p></sec><sec id="s8"><title>8. Comparison with Kani’s Method</title><p>A comparison between the presented ANN model and Kani’s method was performed on the same example, and</p><p>it can be shown in <xref ref-type="fig" rid="fig4">Figure 4</xref> and <xref ref-type="fig" rid="fig5">Figure 5</xref>. A discrepancy ratio <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\0462d8e7-143e-46cb-ac9f-4ebc5b568339.png" xlink:type="simple"/></inline-formula> was used for comparison, where <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\aec2eee1-2a7b-4a5f-98c7-1e900dc3d785.png" xlink:type="simple"/></inline-formula></p><p>is the rotational end moment (output network) or total end moment and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\1b9b8a1a-1f35-47ec-be71-7c698b185bea.png" xlink:type="simple"/></inline-formula> is Kani’s result. The mean value</p><fig id="fig4"><label>Figure 4</label><caption><p> Rotational end moments with lateral displacement</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\21ede8fc-4c8b-42a5-a952-7dd053889074.png"/></fig><fig id="fig5"><label>Figure 5</label><caption><p> Total end moments with lateral displacement</p></caption><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\ced9d9d4-c620-4b26-83df-e7bf7dcc05b6.png"/></fig><p><inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\3b4a1f33-b0ad-45d2-957e-a016ca09037d.png" xlink:type="simple"/></inline-formula>and the standard deviation σ are <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\d8bb0758-305c-4b2a-af29-c4174230e178.png" xlink:type="simple"/></inline-formula>and<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\212ebf67-cc4a-4b76-8367-21ad8647f155.png" xlink:type="simple"/></inline-formula>, respectively. The comparison is</p><p>shown in <xref ref-type="table" rid="table2">Table 2</xref> and <xref ref-type="table" rid="table3">Table 3</xref>. From looking at the table, one may conclude that the presented model gives a better agreement with Kani’s method. A group of 15 nodes was used for verification. <xref ref-type="fig" rid="fig4">Figure 4</xref> and <xref ref-type="fig" rid="fig5">Figure 5</xref> shows the nodes of the structure under study, and also the members who access the aforementioned nodes. In these figures we present the comparison of some of the results: rotational moments at the extremes of members obtained with the application of G. Kani Method (distribution moments: these are the values ​​shown in parentheses), and the results of the rotational moments calculated at the ends on the bars of the structure through the</p><table-wrap id="table2"  position="float"><object-id pub-id-type="pii">Table 2</object-id><label>Table 2</label><caption><p>. Accuracy of formulas for rotational end moments</p></caption><table><thead><tr><th align="center" valign="middle" >Nodes</th><th align="center" valign="middle" >Layers</th><th align="center" valign="middle" >Statistical Mean Value</th><th align="center" valign="middle" >Statistical Standard Deviation</th></tr></thead><tbody><tr><td align="center" valign="middle"  rowspan="3"  >Nodes 1s</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1.0375</td><td align="center" valign="middle" >0.0178</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >1.0097</td><td align="center" valign="middle" >0.0013</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >1.0067</td><td align="center" valign="middle" >0.0008</td></tr><tr><td align="center" valign="middle"  rowspan="4"  >Nodes 2s</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0.9776</td><td align="center" valign="middle" >0.0131</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >0.9995</td><td align="center" valign="middle" >0.0147</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >1.0016</td><td align="center" valign="middle" >0.1107</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >0.9976</td><td align="center" valign="middle" >0.0036</td></tr><tr><td align="center" valign="middle"  rowspan="4"  >Nodes 3s</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0.9529</td><td align="center" valign="middle" >0.0036</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >1.0118</td><td align="center" valign="middle" >0.0108</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >1.0578</td><td align="center" valign="middle" >0.0710</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >1.0005</td><td align="center" valign="middle" >0.0032</td></tr><tr><td align="center" valign="middle"  rowspan="4"  >Nodes 4s</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1.0000</td><td align="center" valign="middle" >0.0000</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >1.0000</td><td align="center" valign="middle" >0.0000</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >1.0000</td><td align="center" valign="middle" >0.0000</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >1.0000</td><td align="center" valign="middle" >0.0000</td></tr></tbody></table></table-wrap><table-wrap id="table3"  position="float"><object-id pub-id-type="pii">Table 3</object-id><label>Table 3</label><caption><p>. Accuracy of formulas for total end moments</p></caption><table><thead><tr><th align="center" valign="middle" >Nodes</th><th align="center" valign="middle" >Layers</th><th align="center" valign="middle" >Statistical Mean Value</th><th align="center" valign="middle" >Statistical Standard Deviation</th></tr></thead><tbody><tr><td align="center" valign="middle"  rowspan="3"  >Nodes 1s</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0.9633</td><td align="center" valign="middle" >0.0000</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >1.0289</td><td align="center" valign="middle" >0.0412</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >1.0015</td><td align="center" valign="middle" >0.0054</td></tr><tr><td align="center" valign="middle"  rowspan="4"  >Nodes 2s</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1.0023</td><td align="center" valign="middle" >0.0112</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >1.0025</td><td align="center" valign="middle" >0.0064</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >0.9970</td><td align="center" valign="middle" >0.0155</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >0.9964</td><td align="center" valign="middle" >0.0037</td></tr><tr><td align="center" valign="middle"  rowspan="4"  >Nodes 3s</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1.0075</td><td align="center" valign="middle" >0.0076</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >1.0061</td><td align="center" valign="middle" >0.0091</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >0.9841</td><td align="center" valign="middle" >0.0186</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >1.0040</td><td align="center" valign="middle" >0.0023</td></tr><tr><td align="center" valign="middle"  rowspan="4"  >Nodes 4s</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1.0100</td><td align="center" valign="middle" >0.0000</td></tr><tr><td align="center" valign="middle" >2</td><td align="center" valign="middle" >1.0167</td><td align="center" valign="middle" >0.0000</td></tr><tr><td align="center" valign="middle" >3</td><td align="center" valign="middle" >0.9783</td><td align="center" valign="middle" >0.0000</td></tr><tr><td align="center" valign="middle" >4</td><td align="center" valign="middle" >1.0048</td><td align="center" valign="middle" >0.0000</td></tr></tbody></table></table-wrap><p>analysis executed by neural topology (whose values ​​are outside the parentheses) that can improve the accuracy and speed of the results.</p></sec><sec id="s9"><title>9. Conclusions</title><p>Artificial neural networks are parallel computational models since the computation of the components<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\879f6ea0-a3d7-4694-9d2b-b47ca508fd61.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\4fcb5649-68ce-4b3a-8df7-cb6a6b20c953.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\86937437-ad11-4f0d-8b7b-4fcfb3cc202f.png" xlink:type="simple"/></inline-formula> can be used with advantage to extend ANN model to the solution of complex problems. The idea can be used also in the solution of continuous beams on elastic supports, as well as for frames with inclined legs and Vierendeel girders. A very important feature of these networks is their adaptive nature where “learning by example” replaces “programming or making functions” in solving problems. The ANN model ought to be preferred over the Kani’s method, because:</p><p>1) The networks, as fine-grained parallel implementations of linear systems, can overcome other approaches.</p><p>2) ANNs are very fast even on regular PCs. Enormous data sets can be processed, in comparison with traditional approaches.</p><p>3) The presented ANN model is constructed by using only structural model, and it has no boundary conditions in application.</p><p>4) Site engineers can calculate rotational moments<inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\a4ea3e25-46df-4919-8463-52b24c0fcc9c.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\1c83caaf-bb9d-4e3b-a5bd-6b1c3b9ea4f8.png" xlink:type="simple"/></inline-formula>and displacement moments <inline-formula><inline-graphic xlink:href="http://file.scirp.org/Html/htmlimages\1-9701892x\8f822e2d-9c11-42c8-bc07-e576945f773d.png" xlink:type="simple"/></inline-formula> using the ANN without prior knowledge of the structural analysis theories, providing them with the knowledge of the bounds of the parameters used to generate the ANN.</p><p>5) Artificial neural network models can accept any number of effective variables as input parameters without omission or simplification, as commonly done in conventional approaches.</p></sec><sec id="s10"><title>Acknowledgements</title><p>L. R. P. M. thanks to Prof. Alfonzo G. Cerezo for his advice developing this work.</p></sec></body><back><ref-list><title>References</title><ref id="scirp.47663-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">CROSS, H. (1949) ANALYSIS OF CONTINUOUS FRAMES BY DISTRIBUTING FIXED-END MOMENTS. NUMERICAL METHODS OF ANALYSIS IN ENGINEERING. SUCCESSIVE CORRECTIONS. GRINTER, L.B., ED., MACMILLAN, NEW YORK.</mixed-citation></ref><ref id="scirp.47663-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">KANI, G. (1957) DIE BERECHNUNG MEHRSTOCKINGER, RAHMEN, KONRAD WITTWER VERLAG. VERLAG KONRAD WITTWER, STUTTGART.</mixed-citation></ref><ref id="scirp.47663-ref3"><label>3</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>FELIPPA</surname><given-names> C.A. </given-names></name>,<etal>et al</etal>. (<year>1995</year>)<article-title>PARAMETRIZED UNIFICATION OF MATRIX STRUCTURAL ANALYSIS: CLASSICAL FORMULATION AND D-CONNECTED ELEMENTS</article-title><source>. FINITE ELEMENTS IN ANALYSIS AND DESIGN</source><volume> 21</volume>,<fpage> 45</fpage>-<lpage>74</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1016/0168-874X(95)00027-8</pub-id></mixed-citation></ref><ref id="scirp.47663-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">DUNCAN, W.J. AND COLLAR, A.R. (1934) A METHOD FOR THE SOLUTION OF OSCILLATIONS PROBLEMS BY MATRICES. PHILOSOPHICAL MAGAZINE SERIES 7, 17, 865.</mixed-citation></ref><ref id="scirp.47663-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">ARGYRIS, J.H. AND KELSEY, S. (1960) ENERGY THEOREMS AND STRUCTURAL ANALYSIS. BUTTERWORTHS, LONDON.
HTTP://DX.DOI.ORG/10.1007/978-1-4899-5850-1</mixed-citation></ref><ref id="scirp.47663-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">TURNER. M.J. (1959) THE DIRECT STIFFNESS METHOD OF STRUCTURAL ANALYSIS. STRUCTURAL AND MATERIALS PANEL PAPER, AGARD MEETING, AACHEN.</mixed-citation></ref><ref id="scirp.47663-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">EYMARD, R., GALLOUET, T. AND HERBIN, R. (2000) HANDBOOK FOR NUMERICAL ANALYSIS. CIARLET, P.G., LIONS, J.L., ET AL., EDS., NORTH HOLLAND, AMSTERDAM, 715-1022.</mixed-citation></ref><ref id="scirp.47663-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">FREEMAN, J.A. AND SKAPURA, D.M. (1992) NEURAL NETWORKS ALGORITHMS, APPLICATIONS, AND PROGRAMMING TECHNIQUES. ADDISON-WESLEY PUBLISHING COMPANY, INC., BOSTON.</mixed-citation></ref><ref id="scirp.47663-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">KARUNANITHI, N., GRENNEY, W.J., WHITLY, D. AND BOVEE, K. (1994) NEURAL NETWORK FOR RIVER FLOW PREDICTION. JOURNAL OF COMPUTING IN CIVIL ENGINEERING, 215-220.</mixed-citation></ref><ref id="scirp.47663-ref10"><label>10</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>NAGY</surname><given-names> H.</given-names></name>,<name name-style="western"><surname> WATANABE</surname><given-names> K. </given-names></name>,<name name-style="western"><surname> HIRANO</surname><given-names> M. </given-names></name>,<etal>et al</etal>. (<year>2002</year>)<article-title>PREDICTION OF SEDIMENT LOAD CONCENTRATION IN RIVERS USING ARTIFICIAL NEURAL NETWORK MODEL</article-title><source>. JOURNAL OF HYDRAULIC ENGINEERING</source><volume> 128</volume>,<fpage> 588</fpage>-<lpage>595</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1061/(ASCE)0733-9429(2002)128:6(588)</pub-id></mixed-citation></ref><ref id="scirp.47663-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">AFCA INTERNATIONAL (1988) DARPA NEURAL NETWORK STUDY. LIBRARY OF CONGRESS CATALOGING, USA, 131-133.</mixed-citation></ref><ref id="scirp.47663-ref12"><label>12</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>GUPTA</surname><given-names> T. </given-names></name>,<name name-style="western"><surname> SHARMA</surname><given-names> R.K. </given-names></name>,<etal>et al</etal>. (2011)<article-title>GUPTA, T. AND SHARMA, R.K.  STRUCTURAL ANALYSIS AND DESIGN OF BUILDINGS USING NEURAL NETWORK: A REVIEW</article-title><source>. INTERNATIONAL JOURNAL OF ENGINEERING AND MANAGEMENT SCIENCES</source><volume> 2</volume>,<fpage> 216</fpage>-<lpage>220</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.47663-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">CHANDWANI, V., AGRAWAL, V. AND NAGAR, R. (2013) APPLICATIONS OF SOFT COMPUTING IN CIVIL ENGINEERING: A REVIEW. INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS, 81, 13-20.</mixed-citation></ref><ref id="scirp.47663-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">ARANGIO, S. (2013) NEURAL NETWORK-BASED TECHNIQUES FOR DAMAGE IDENTIFICATION OF BRIDGES: A REVIEW OF RECENT ADVANCES. CIVIL AND STRUCTURAL ENGINEERING COMPUTATIONAL METHODS, CHAPTER 3. SAXE-COBURG PUBLICATIONS, STIRLINGSHIRE, 37-60.</mixed-citation></ref><ref id="scirp.47663-ref15"><label>15</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>SIRCA JR.</surname><given-names> G.F. </given-names></name>,<name name-style="western"><surname> ADELI</surname><given-names> H. </given-names></name>,<etal>et al</etal>. (<year>2012</year>)<article-title>SYSTEM IDENTIFICATION IN STRUCTURAL ENGINEERING</article-title><source>. SCIENTIA IRANICA</source><volume> 19</volume>,<fpage> 1355</fpage>-<lpage>1364</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1016/J.SCIENT.2012.09.002</pub-id></mixed-citation></ref><ref id="scirp.47663-ref16"><label>16</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>SALAJEGHEH</surname><given-names> E. </given-names></name>,<name name-style="western"><surname> GHOLIZADEH</surname><given-names> S. </given-names></name>,<etal>et al</etal>. (<year>2005</year>)<article-title>OPTIMUM DESIGN OF STRUCTURES BY AN IMPROVED GENETIC ALGORITHM USING NEURAL NETWORKS</article-title><source>. ADVANCES IN ENGINEERING SOFTWARE</source><volume> 36</volume>,<fpage> 757</fpage>-<lpage>767</lpage>.<pub-id pub-id-type="doi">HTTP://DX.DOI.ORG/10.1016/J.ADVENGSOFT.2005.03.022</pub-id></mixed-citation></ref></ref-list></back></article>