\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={A Simple Neural Network Approach to Software Cost Estimation},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2013-05-15 (revised: 15 May 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-05-15}
\title{A Simple Neural Network Approach to Software Cost Estimation}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Dr. Anupama  Kaushik}

             \affil[1]{  Maharaja Surajmal Institute of Technology}

\renewcommand\Authands{ and }

\date{\small \em Received: 6 April 2013 Accepted: 1 May 2013 Published: 15 May 2013}

\maketitle


\begin{abstract}
        


The effort invested in a software project is one of the most challenging task and most analyzed variables in recent years in the process of project management. Software cost estimation predicts the amount of effort and development time required to build a software system. It is one of the most critical tasks and it helps the software industries to effectively manage their software development process. There are a number of cost estimation models. Each of these models have their own pros and cons in estimating the development cost and effort. This paper investigates the use of Back-Propagation neural networks for software cost estimation. The model is designed in such a manner that accommodates the widely used COCOMO model and improves its performance. It deals effectively with imprecise and uncertain input and enhances the reliability of software cost estimates. The model is tested using three publicly available software development datasets.  The test results from the trained neural network are compared with that of the COCOMO model. From the experimental results, it was concluded that using the proposed neural network model the accuracy of cost estimation can be improved and the estimated cost can be very close to the actual cost.

\end{abstract}


\keywords{artificial neural networks, back-propagation networks, COCOMO model, project management, soft computing techniques, software effort estimation.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
oftware cost estimation is one of the most significant activities in software project management. It refers to the predictions of the likely amount of effort, time and staffing levels required to build a software system. The effort prediction aspect of software is made at an early stage during project development, when the costing of the project is proposed for approval. It is concerned with the prediction of the person hour required to accomplish the task. However, estimates at the early stages of the development are the most difficult to obtain because very little is known about the project and the product at the beginning. So, estimating software development effort remains a complex problem and it continues to attract research attention. There are several cost estimation techniques proposed and they are grouped into two major categories: (1) Parametric models or Algorithmic models, which uses a mathematical formula to predict project cost based on the estimates of project size, the number of software engineers, and other process and product factors \hyperref[b0]{[1]}. These models can be built by analysing the costs and attributes of completed projects and finding the closest fit formula to actual experience. \hyperref[b1]{(2)} Non Parametric models or Non algorithmic models which are based on fuzzy logic (FL), artificial neural networks (ANN) and evolutionary computation (EC). In this paper, we focus on non parametric cost estimation models based on artificial neural networks, and particularly Back-Propagation networks. Neural networks have learning ability and are good at modelling complex nonlinear relationships. They also provide more flexibility to integrate expert knowledge into the model. There are many software cost estimation models that have been developed using neural networks over the years. The use of radial basis function neural networks for software effort estimation is well described by many researchers  {\ref [2, 3 and 4]}. The clustering algorithms used in those designs are the conventional algorithms.\par
K. Vinay Kumar et al. \hyperref[b6]{[5]} Uses wavelet neural networks for predicting software development cost. B. Tirimula Rao et al. \hyperref[b7]{[6]} provided a novel neural network approach for software cost estimation using functional link artificial neural network. G. Witting and G. Finnie \hyperref[b8]{[7]} uses back propagation learning algorithms on a multilayer perceptron in order to predict development effort. N. Karunanitthi et al. \hyperref[b10]{[8]} reports the use of neural networks for predicting software reliability including experiments with both feed forward and Jordan networks. N. Tadayon [9] also reports the use of neural network with a back propagation learning algorithm. However it was not clear how the dataset was divided for training and validation purposes. T.M. Khoshgoftaar et al. \hyperref[b12]{[10]} presented a case study considering real time software to predict the testability of each module from source code static measures. Ch. Satyananda Reddy and KVSVN Raju \hyperref[b13]{[11]} proposed a cost estimation model using multi layer feed forward neural network. Venkatachalam \hyperref[b15]{[12]} also investigated the application of artificial neural network (ANN) to software cost estimation.\par
Artificial neural networks are the promising techniques to build predictive models. So, there is always a scope for developing effort estimation models with better predictive accuracy. The COCOMO model, is the best known algorithmic cost model published by Barry Boehm in 1981 \hyperref[b0]{[1]}. It was developed from the analysis of sixty three software projects. It is a hierarchy of software cost estimation models, which includes Basic, Intermediate and Detailed sub models. It was the most cited and plausible of all the traditional cost estimation models. COCOMO II is the revised version of the original COCOMO and is tuned to the life cycle practices of the 21 st century. It also provides a quantitative analytic framework, and set of tools and techniques for evaluating the effects of software technology improvements on software life cycle costs and schedules. It consists of three sub models and they are:  \hyperref[tab_1]{1} lists COCOMO II cost drivers along with their multipliers. Scale factor is a particular characteristic of the software development that has an exponential effect of increasing or decreasing the amount of development effort and they are Precedentness, Development flexibility, Architecture/Risk resolution, Team cohesion and Process maturity. These factors are rated on a six point scale i.e., very low, low, nominal, high, very high and extra high as given in Table \hyperref[tab_2]{2}. COCOMO II post architecture model is given as:?PM = A × [ × (\textbf{1})\par
Where PM is the effort expressed in person months, A is a multiplicative constant, size is the projected size of the software project expressed in thousands of lines of code KLOC, EM i (i=1,2....17) are effort multipliers and SF i (i=1,2....5) are exponent scale factors. 
\section[{b) Artificial Neural Networks}]{b) Artificial Neural Networks}\par
An artificial neural network (ANN) is an efficient information processing system which resembles in characteristics with a biological neural network. ANN's possess large number of highly interconnected processing elements called neurons. Each neuron is connected with the other by a connection link. Each connection link is associated with weights which contain information about the input signal. This information is used by the neuron net to solve a particular problem. Each neuron has an internal state of its own. This internal state is called the activation level of neuron, which is the function of the inputs the neuron receives. There are a number of activation functions that can be applied over net input such as Gaussian, Linear, Sigmoid and Tanh. It is the Sigmoid function that is the most frequently used in neural nets. Thus, the models of ANN are specified by the three basic entities namely \hyperref[b16]{[13]}: 1. The model's synaptic interconnections; 2. The training or learning rules adopted for updating and adjusting the connection weights; 3. Their activation functions.\par
The neural network process starts by developing the structure of the network and establishing the technique used to train the network using an existing data set. Neural network architectures are divided into two groups: 1. Feed forward networks where no loops in the network path occur. 2. Feedback networks that have recursive loops.  The most common architecture of neural networks which is used in software cost estimation is the Back-Propagation trained Feed Forward networks \hyperref[b17]{[14,}\hyperref[b18]{15]}. The training algorithm of back propagation involves four stages: 1. Initialization of weights 2. Feed forward 3. Back Propagation of errors 4. Updation of the weights and biases III. 
\section[{Proposed Work}]{Proposed Work}\par
The performance of a neural network depends on its architecture and their parameter settings. There are many parameters governing the architecture of the neural network including the number of layers, the number of nodes in each layer, the transfer function in each node, learning algorithm parameters and the weights which determine the connectivity between nodes. There is no rule which determines the ideal parameter settings but even a slight parameter changes can cause major variations in the results of almost all networks. This property of the neural network is captured in the present work for predicting the software costs. The neural network model proposed is based on multi layer feed forward neural network and it uses the architecture given by Ch. Satyananda Reddy and KVSVN Raju \hyperref[b13]{[11]}. The model accommodates the COCOMO II model.\par
The aim of this work is to evaluate the results of software cost estimation using COCOMO II by varying the activation functions at the input, hidden and the output layers. The model proposed uses the identity function at the input layer which is defined by The hidden and the output layer uses unipolar sigmoid function defined by .\par
This function is especially advantageous to use in neural networks trained by back-propagation algorithms. Because it is easy to distinguish, and this can interestingly minimize the computation capacity for training. 
\section[{a) Architecture of the Neural Network Model}]{a) Architecture of the Neural Network Model}\par
The proposed structure of the neural network accommodates the COCOMO II post architecture model given by Eq. 1. The use of neural network to estimate PM (person months) in Eq. 1 requires twenty four input nodes in the input layer which corresponds to seventeen EM's, five SF's and two bias values. The COCOMO model which is a non linear model is transformed into a linear model using natural logarithms as shown in Eq. 2.  
\section[{S.No}]{S.No}\par
The above equation becomes : C PM = [b 1 +x 1 *\par
Where, C PM =ln(PM); z 1 =ln(EM 1 ); z 2 =ln(EM 2 );??;z 17 =ln(EM 17 ); z 18 =SF 1 ;??..;z 22 =SF 5 ; b 1 and b 2 are the biases and the coefficients x i and y i are the additional terms used in the model which act as the weights from the input layer to the hidden layer.\par
The COCOMO II model as given by Eq. 3 is shown in Fig. \hyperref[fig_2]{1}. This network consists of two hidden layer nodes C EM and C SF that take into account the contribution of effort multipliers and scale factors. C PM is the node of the output layer where we get the value of ln(PM) which is the desired output of the model. In the above network all the original EM i and SF i values of COCOMO II are pre processed to ln(EM i ) and ln(SF i ) and used as input nodes. The two bias values are denoted by b 1 and b 2 , which are ln(A) and 1.01 respectively. The size of the product is not considered as one of the inputs to the network but as a cofactor for the initial weights for scale factors (SF). The weights associated to the input nodes connected to the hidden layer are denoted by x i for for each input ln(EMi) and b 1 . On the other hand, the weights associated to the hidden layer for each ln (SFi) input nodes and b 2 are y i +ln (size) for . These weights are initialized as x i =1and y i =0. The weights from the hidden layer to the output layer are denoted by p and q and initialized as p=q=1. The feed forward back propagation procedure is used to train the network by iteratively processing a set of training samples and comparing the network's prediction with the actual value. For each training sample, the weights are modified so as to minimize the error between the networks predicted value and the actual value. The following algorithm is used for training the proposed network and for calculating the new set of weights:\par
Step 2: Perform steps 3-10 when stopping condition is false.\par
Step 3: Perform steps 4-9 for each training pair.\par
Step 4: Each input unit receives input signal and sends it to the hidden unit.\par
Step 5: Each hidden unit C EM and C SF sums its weighted input signals to calculate net input given by:  
\section[{D}]{D}\par
Step 1: Initialize the weights and learning rate ? ( Apply sigmoidal activation function over C EM and C SF and send the output signal from the hidden unit to the input of output layer units.\par
Step 6: The output unit C PM , calculates the net input given by: C PM =C EM *p+C SF *q Apply sigmoidal activation function over C PM to compute the output signal E est .\par
Step 7: Calculate the error correction term as: ?=E act -E est , where E act is the actual effort from the dataset and E est is the estimated effort from step 6.\par
Step 8: Update the weights between hidden and the output layer as:p(new)=p(old)+ ?* ?* C EM q(new)=q(old)+ ?* ?* C SF\par
Step 9: Update the weights and bias between input and hidden layers as:x i (new)=x i (old)+ ?* ? EM *z i for i=1 to 17 y i (new)=y i (old)+ ?* ? SF *z i for i=18 to 22 b 1 (new)=b 1 (old)+ ?* ? EM b 2 (new)=b 2 (old)+ ?* ? SF\par
The error is calculated as? EM = ?*p; ? SF = ?*q ;\par
Step 10: Check for the stopping condition. The stopping condition may be certain number of epochs reached or if the error is smaller than a specific tolerance.\par
Using this approach, we iterate forward and backward until the terminating condition is satisfied. The variable ? used in the above formula is the learning rate, a constant, typically having a value between 0 and 1. The learning rate can be increased or decreased by the expert judgment indicating their opinion of the input effect. In other words the error should have more effect on the expert's indication that a certain input had more contribution to the error propagation or vice versa. For each project, the expert estimator can identify the importance of the input value to the error in the estimation. If none selected by the expert, the changes in the weights are as specified by the learning algorithm. The network should also be trained according to correct inputs. For example, if during estimation ACAP (Analyst Capability) is set as high but after the end of the project, the management realizes that it was nominal or low, then the system should not consider this as a network error and before training the system, the better values of cost factors should be used to identify the estimated cost.\par
IV. 
\section[{Datasets and Evaluation Criteria}]{Datasets and Evaluation Criteria}\par
The data sets used in the present study comes from PROMISE Software Engineering Repository data The evaluation consists in comparing the accuracy of the estimated effort with the actual effort. A common criterion for the evaluation of cost estimation model is the Magnitude of Relative Error (MRE) and is defined as in Eq. 4. 
\section[{MRE = (4)}]{MRE = (4)}\par
The MRE values are calculated for each project in the validation set, while mean magnitude of relative error (MMRE) computes the average of MRE over N projects.\par
(5) Another evaluation criterion is MdMRE, which measures the median of all MRE's. MdMRE is less sensitive to extreme values. It exhibits a similar pattern to MMRE but it is more likely to select the true model if the underestimation is served.\par
Since MRE, MMRE and MdMRE are the most common evaluation criteria, they are adopted as the performance evaluators in the present paper.\par
V. 
\section[{Results and Discussion}]{Results and Discussion}\par
This section presents and discusses the results obtained when applying the proposed neural network model to the  {\ref COCOMO}   Table \hyperref[tab_7]{3} shows the results and comparison on COCOMO dataset. It also contain results given by Ch. Satyananda Reddy and KVSVN Raju \hyperref[b13]{[11]} for the corresponding projects. For example, in the case of Project ID 5 it is  {\ref 7.44}    {\ref 2} shows the graphical representation of MRE values for the three models for COCOMO 81 dataset. There is a decrement in the relative error using the proposed model. The results obtained thus suggest that the proposed architecture can be applied for accurately predicting the software costs.\par
Table \hyperref[tab_8]{4} shows the results and comparison on NASA 93 dataset. Here also, there is a decrease in the relative error using the proposed model. For example, the relative error calculated for Project ID 30 is 8.81 for COCOMO model, and 3.34 for our proposed model. The relative error calculated for Project ID 62 is 13.2 for COCOMO model, and 5.00 for our proposed model. The Mean Magnitude of Relative Error (MMRE) for the entire validation set is 12.746 and 4.349 for the COCOMO model and our proposed model respectively. The MdMRE for the entire validation set is 13.43\% for the COCOMO model and 4.46\% for our proposed model. Fig.  {\ref 3} shows the graphical representation of MRE values for the two models.\par
For COCOMO\textunderscore SDR dataset, COCOMO II model performs very poorly. For Project ID 1, it has estimated effort as 2241.4 whereas the actual effort is 1 and with our proposed model it is 1.24. Similarly, for Project ID 2 COCOMO II effort is 901.6; its actual effort is 2 and the estimated is 1.95. Table \hyperref[tab_9]{5} shows the estimated effort and their MRE values using the proposed model on COCOMO\textunderscore SDR dataset. MMRE value for the estimated effort is 6.34. The MdMRE for the entire validation set is 4.62\% for the proposed model. Fig.  {\ref 4} shows the bar graph representation of actual effort values and estimated effort values with the proposed model for COCOMO\textunderscore SDR. The bar graph shows that the estimated effort is very close to the actual effort.\par
The results obtained thus, suggest that the proposed model outperformed the COCOMO model and the model given by Ch. Satyananda Reddy and KVSN Raju in terms of all the discussed evaluation criteria i.e, MRE, MMRE and MdMRE. It can be applied for accurately predicting the software costs.      
\section[{Conclusion}]{Conclusion}\par
Software development cost estimation is a challenging task for both the industrial as well as academic communities. The accurate predictions during the early stages of development of a software project can greatly benefit the development team. There are several effort estimation models that can be used in forecasting software development effort.\par
In the paper, Feed Forward Back Propagation model of neural network is used which maps the COCOMO model. The model used identity function at the input layer and sigmoidal function at the hidden and output layer. The model incorporates COCOMO dataset and COCOMO NASA 2 dataset to train and to test the network. Based on the experiments performed, it is observed that the proposed model outscored COCOMO model and the model proposed by Ch. Satyananda Reddy and KVSN Raju. Future research can replicate and confirm this estimation technique with other datasets for software cost estimation. Furthermore, the utilization of other neural networks architecture can also be applied for estimating software costs. This work can also be extended using Neuro Fuzzy approach.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_1}A}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_2}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_3}C}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_4}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_5}D}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{234}\includegraphics[]{image-7.png}
\caption{\label{fig_7}Figure 2 :Figure 3 :Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
Application Composition Model: This model is\\
suitable for quickly developed applications using\\
interoperable components like components based\\
on GUI builders and is based on new object point's\\
estimation.\\
? Early Design Model: This model is used in the early\\
stages of a software project and can be used in\\
Application Generator, System Integration, or\\
Infrastructure Development Sector. It uses\\
Unadjusted Function Points (UFP) as the measure\\
of size.\\
? Post Architecture Model: This is the most detailed of\\
the three and is used after the overall architecture\\
for the project has been designed. One could use\\
function points or LOC as size estimates with this\\
model. It involves the actual development and\\
maintenance of a software product.\\
COCOMO II describes\end{longtable} \par
 
\caption{\label{tab_0}17 cost drivers and 5 scale factors that are used in the Post Architecture model. The cost drivers for COCOMO II are rated on a scale from very low to extra high. Their product is used to adjust the nominal effort. Table}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_2}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.1470763723150358\textwidth}P{0.0821599045346062\textwidth}P{0.11157517899761336\textwidth}P{0.09838902147971361\textwidth}P{0.09230310262529834\textwidth}P{0.09230310262529834\textwidth}P{0.11056085918854415\textwidth}P{0.08520286396181384\textwidth}P{0.030429594272076373\textwidth}}
\tabcellsep Cost Driver\tabcellsep Very Low\tabcellsep \multicolumn{3}{l}{Low Nominal High}\tabcellsep Very High\tabcellsep Extra High\tabcellsep \\
1\tabcellsep RELY\tabcellsep 0.75\tabcellsep 0.88\tabcellsep 1.00\tabcellsep 1.15\tabcellsep 1.39\tabcellsep --\tabcellsep \\
2\tabcellsep DATA\tabcellsep --\tabcellsep 0.93\tabcellsep 1.00\tabcellsep 1.09\tabcellsep 1.19\tabcellsep --\tabcellsep \\
3\tabcellsep CPLX\tabcellsep 0.75\tabcellsep 0.88\tabcellsep 1.00\tabcellsep 1.15\tabcellsep 1.30\tabcellsep 1.66\tabcellsep \\
4\tabcellsep RUSE\tabcellsep \tabcellsep 0.91\tabcellsep 1.00\tabcellsep 1.14\tabcellsep 1.29\tabcellsep 1.49\tabcellsep \\
5\tabcellsep DOCU\tabcellsep 0.89\tabcellsep 0.95\tabcellsep 1.00\tabcellsep 1.06\tabcellsep 1.13\tabcellsep \tabcellsep \\
6\tabcellsep TIME\tabcellsep --\tabcellsep --\tabcellsep 1.00\tabcellsep 1.11\tabcellsep 1.31\tabcellsep 1.67\tabcellsep \\
7 8\tabcellsep STOR PVOL\tabcellsep ----\tabcellsep --0.87\tabcellsep 1.00 1.00\tabcellsep 1.06 1.15\tabcellsep 1.21 1.30\tabcellsep 1.57 --\tabcellsep 013 2\\
9 10\tabcellsep ACAP PCAP\tabcellsep 1.50 1.37\tabcellsep 1.22 1.16\tabcellsep 1.00 1.00\tabcellsep 0.83 0.87\tabcellsep 0.67 0.74\tabcellsep ----\tabcellsep Year\\
11\tabcellsep PCON\tabcellsep 1.24\tabcellsep 1.10\tabcellsep 1.00\tabcellsep 0.92\tabcellsep 0.84\tabcellsep --\tabcellsep \\
12\tabcellsep AEXP\tabcellsep 1.22\tabcellsep 1.10\tabcellsep 1.00\tabcellsep 0.89\tabcellsep 0.81\tabcellsep --\tabcellsep \\
13\tabcellsep PEXP\tabcellsep 1.25\tabcellsep 1.12\tabcellsep 1.00\tabcellsep 0.88\tabcellsep 0.81\tabcellsep --\tabcellsep \\
14\tabcellsep LTEX\tabcellsep 1.22\tabcellsep 1.10\tabcellsep 1.00\tabcellsep 0.91\tabcellsep 0.84\tabcellsep --\tabcellsep \\
15\tabcellsep TOOL\tabcellsep 1.24\tabcellsep 1.12\tabcellsep 1.00\tabcellsep 0.86\tabcellsep 0.72\tabcellsep --\tabcellsep \\
16\tabcellsep SITE\tabcellsep 1.25\tabcellsep 1.10\tabcellsep 1.00\tabcellsep 0.92\tabcellsep 0.84\tabcellsep 0.78\tabcellsep \\
17\tabcellsep SCED\tabcellsep 1.29\tabcellsep 1.10\tabcellsep 1.00\tabcellsep 1.00\tabcellsep 1.00\tabcellsep --\tabcellsep \\
\multicolumn{2}{l}{Scaling Factors}\tabcellsep Very Low\tabcellsep \multicolumn{3}{l}{Low Nominal High}\tabcellsep Very High\tabcellsep Extra High\tabcellsep \\
\multicolumn{2}{l}{Precedentness}\tabcellsep \multicolumn{2}{l}{6.20 4.96}\tabcellsep 3.72\tabcellsep 2.48\tabcellsep 1.24\tabcellsep 0.00\tabcellsep \\
\multicolumn{4}{l}{Development Flexibility 5.07 4.05}\tabcellsep 3.04\tabcellsep 2.03\tabcellsep 1.01\tabcellsep 0.00\tabcellsep \\
\multicolumn{2}{l}{Architecture/Risk}\tabcellsep \multicolumn{2}{l}{7.07 5.65}\tabcellsep 4.24\tabcellsep 2.83\tabcellsep 1.41\tabcellsep 0.00\tabcellsep \\
Resolution\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{Team Cohesion Process Maturity}\tabcellsep \multicolumn{2}{l}{5.48 4.38 7.80 6.24}\tabcellsep 3.29 4.68\tabcellsep 2.19 3.12\tabcellsep 1.10 1.56\tabcellsep 0.00 0.00\tabcellsep ( D D D D D D D D ) D\end{longtable} \par
 
\caption{\label{tab_3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_4}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_6}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.050173611111111106\textwidth}P{0.09149305555555556\textwidth}P{0.21545138888888887\textwidth}P{0.27743055555555557\textwidth}P{0.21545138888888887\textwidth}}
S.No\tabcellsep Project ID\tabcellsep MRE(\%) using COCOMO model\tabcellsep MRE(\%) using Model proposed by Satyananda Reddy\tabcellsep MRE(\%) using proposed model\\
1\tabcellsep 5\tabcellsep 7.44\tabcellsep 5.08\tabcellsep 4.012\\
2\tabcellsep 12\tabcellsep 19.83\tabcellsep 6.8\tabcellsep 3.98\\
3\tabcellsep 30\tabcellsep 6.49\tabcellsep 3.24\tabcellsep 1.77\\
4\tabcellsep 38\tabcellsep 50.98\tabcellsep 15.34\tabcellsep 3.59\\
5\tabcellsep 40\tabcellsep 12.4\tabcellsep 11.1\tabcellsep 4.16\\
6\tabcellsep 45\tabcellsep 5.35\tabcellsep 4.59\tabcellsep 4.01\\
7\tabcellsep 47\tabcellsep 16.4\tabcellsep 10.06\tabcellsep 3.46\\
8\tabcellsep 59\tabcellsep 8.66\tabcellsep 4.92\tabcellsep 3.67\\
9\tabcellsep 61\tabcellsep 13.1\tabcellsep 12.5\tabcellsep 3.86\\
10\tabcellsep 62\tabcellsep 6.22\tabcellsep 9.73\tabcellsep 2.97\\
11\tabcellsep 63\tabcellsep 19.95\tabcellsep 12.84\tabcellsep 3.53\end{longtable} \par
  {\small\itshape [Note: © 2013 Global Journals Inc. (US)]} 
\caption{\label{tab_7}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_8}Table 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_9}Table 5 :}\end{figure}
 			\footnote{© 2013 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Reddy]{b3}\label{b3} 	 		\textit{},  		 			Prasad Reddy 		,  		 			PV G 		.  		 	 
\bibitem[Sudha and R; Rama Sree]{b4}\label{b4} 	 		\textit{},  		 			K Sudha 		,  		 			P R; Rama Sree 		.  		 	 
\bibitem[ Gaussian Membership Function. Journal of software]{b14}\label{b14} 	 		\textit{},  	 	 		\textit{Gaussian Membership Function. Journal of software}  		4  (5)  p. .  	 
\bibitem[Karunanitthi et al. ()]{b10}\label{b10} 	 		\textit{},  		 			N Karunanitthi 		,  		 			D Whitely 		,  		 			Y K Malaiya 		.  		1992.  	 
\bibitem[Rao et al. ()]{b7}\label{b7} 	 		‘A Novel Neural Network Approach for Software Cost Estimation using Functional Link Artificial Neural Network (FLANN)’.  		 			Tirimula Rao 		,  		 			B Sameet 		,  		 			B Kiran Swathi 		,  		 			G Vikram Gupta 		,  		 			K Ravi Teja 		,  		 			; Ch 		,  		 			S Sumana 		.  	 	 		\textit{International Journal of Computer Science and Network Society}  		2009. 9  (6)  p. .  	 
\bibitem[Molokken and Jorgensen ()]{b17}\label{b17} 	 		‘A review of software surveys on software effort estimation’.  		 			K Molokken 		,  		 			M Jorgensen 		.  	 	 		\textit{Proceedings of IEEE International Symposium on Empirical Software Engineering ISESE},  				 (IEEE International Symposium on Empirical Software Engineering ISESE)  		2003. p. .  	 
\bibitem[Reddy and Raju ()]{b13}\label{b13} 	 		\textit{An Improved Fuzzy Approach for COCOMO's Effort Estimation using},  		 			C S Reddy 		,  		 			Kvsn Raju 		.  		2009.  	 
\bibitem[Huang and Chiu ()]{b18}\label{b18} 	 		‘Applying fuzzy neural network to estimate software development effort’.  		 			S Huang 		,  		 			N Chiu 		.  	 	 		\textit{Proceedings of Applied Intelligence Journal}  		2009. 30  (2)  p. .  	 
\bibitem[Idri et al. ()]{b1}\label{b1} 	 		‘Design of radial basis function neural networks for software effort estimation’.  		 			A Idri 		,  		 			A Zakrani 		,  		 			A Zahi 		.  	 	 		\textit{IJCSI International Journal of Computer Science}  		2010. 7  (4)  p. .  	 
\bibitem[Idri et al. ()]{b2}\label{b2} 	 		 			A Idri 		,  		 			A Zahi 		,  		 			E Mendes 		,  		 			A Zakrani 		.  		\textit{Software Cost Estimation Models using Radial Basis Function Neural Networks, International Conference on Software process and product measurements},  				2007. p. .  	 
\bibitem[Khoshgoftaar et al. ()]{b12}\label{b12} 	 		‘Predicting testability of program modules using a neural network’.  		 			T M Khoshgoftaar 		,  		 			E B Allen 		,  		 			Z Xu 		.  	 	 		\textit{Proceedings of 3rd IEEE Symposium on Application Specific Systems and Software Engineering Technology},  				 (3rd IEEE Symposium on Application Specific Systems and Software Engineering Technology)  		2000. p. .  	 
\bibitem[Sivanandam and Deepa ()]{b16}\label{b16} 	 		 			S N Sivanandam 		,  		 			S N Deepa 		.  		\textit{Principles of Soft Computing},  				 (India)  		2007. Wiley.  	 
\bibitem[Venkatachalam ()]{b15}\label{b15} 	 		‘Software Cost Estimation using artificial neural networks’.  		 			A R Venkatachalam 		.  	 	 		\textit{Proceedings of the International Joint Conference on Neural Networks},  				 (the International Joint Conference on Neural Networks)  		1993. p. .  	 
\bibitem[Kumar et al. ()]{b6}\label{b6} 	 		‘Software development cost estimation using wavelet neural networks’.  		 			Vinay Kumar 		,  		 			K Ravi 		,  		 			V Carr; Raj Kiran 		,  		 			N 		.  	 	 		\textit{The Journal of Systems and Software}  		2008. 81  (11)  p. .  	 
\bibitem[Software Development Effort Journal of Information Systems]{b9}\label{b9} 	 		‘Software Development Effort’.  	 	 		\textit{Journal of Information Systems}  		1  (2)  p. .  	 
\bibitem[Ramesh ()]{b5}\label{b5} 	 		‘Software Effort Estimation using Radial Basis and Generalized Regression Neural Networks’.  		 			S N S V S Ramesh 		.  	 	 		\textit{Journal of computing}  		2010. 2  (5)  p. .  	 
\bibitem[Boehm ()]{b0}\label{b0} 	 		\textit{Software Engineering Economics},  		 			B W Boehm 		.  		1981. Englewood Cliffs, NJ: Prentice Hall.  	 
\bibitem[Witting and Finnie ()]{b8}\label{b8} 	 		\textit{Using Artificial Neural Networks and Function Points to estimate 4GL},  		 			G Witting 		,  		 			G Finnie 		.  		1994.  	 
\bibitem[Using Neural Networks in Reliability Prediction IEEE Software Engineering]{b11}\label{b11} 	 		‘Using Neural Networks in Reliability Prediction’.  	 	 		\textit{IEEE Software Engineering}  		9  (4)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
