\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={Backpropagation in HL7 in Medical Informatics to Analysis Speed of Sending Data},
 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{Backpropagation in HL7 in Medical Informatics to Analysis Speed of Sending Data}
\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]{kanika  sharma}

             \author[2]{Hardeep Singh  Kang}

             \affil[1]{  RIMT-IET , Mandi Gobindgarh}

\renewcommand\Authands{ and }

\date{\small \em Received: 8 April 2013 Accepted: 3 May 2013 Published: 15 May 2013}

\maketitle


\begin{abstract}
        


In this paper, analysis the speed of sending message in Healthcare standard 7 with the use of back propagation in neural network. Various algorithms are define in backpropagtion in neural network we can use trainlm algorithm for sending message purpose. This algorithm appears to be fastest method for training moderate sized feedforward neural network. It has a very efficient matlab implementation. The need of trainlm algorithm are used for analysis, increase the speed of sending message faster and accurately and more efficiently. The proposed work is used in healthcare medical data. With the use of backpropagation in health care standard seven (HL7) sending message between two systems. To increase the speed of the healthcare sending data we can use Train LM algorithm. Train LM algorithm is more fastest algorithm it can be increase efficiency and improve accuracy of the system and also provide real time application. To increase speed of sending message these algorithm used. With the use of this algorithm it can be decreasing time of sending message to the other system.

\end{abstract}


\keywords{medical informatics, HL7, backpropagation.}

\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
edical informatics is the sub-discipline of health informatics that directly impacts the patientphysician relationship. It focuses on the information technology that enables the effective collection of data using technology tools to develop medical knowledge and to facilitate the delivery of patient medical care. The goal of medical informatics is to ensure access to critical patient medical information at the precise time and place it is needed to make medical decisions. Medical informatics also focuses on the management of medical data for research and education. a) Healthcare Standards support clinical practice and the management, delivery, and evaluation of health services, and are recognized as the most commonly used in the world. Healthcare provides seven standards to perform various functionalities. The latest standard implement in Healthcare is Health Level Seven (HL1-7) is a standard series of predefined logical formats for packaging healthcare data into messages to be transmitted among computer system. 
\section[{b) Neural Networks}]{b) Neural Networks}\par
Are originally modelled as a computational model to mimic the way the brain works. Brain is made from small functional units called neurons. A neural has a cell body, several short dendrites and single long axon. By the dendrites and axon several neurons connected. Dendrites take various signals and pass to the other neurons as a input signal. These input increase or decrease to the electrical potential of the cell body and if it is reaches a threshold, a electric pulse is sent to the axon and the output occurs. 
\section[{II.}]{II.}\par
Types of Neural Network a) Biological Neural Network Are made up of real biological neurons that are connected or functionally related in a nervous system. In the field of neuroscience they often identified groups of neurons that perform a specific physiological function in laboratory analysis. 
\section[{b) Artificial Neural Network}]{b) Artificial Neural Network}\par
Are composed of interconnecting artificial neurons (programming constructs that mimic the properties of biological neurons).it is used for solving artificial intelligence problems without necessary creating a model of a real biological system. 3 layers in neural network I/P, hidden layer and O/P. 
\section[{Input}]{Input}\par
Hidden layer Output ii. Simulating Annealing It is a global minimum can guarantee of optimal solution but it is slower than gradient decent and also much more complicated implementation.\par
iii. Genetic Algorithm Faster than simulated annealing and also less like to get stuck in local minima but it is slower than gradient descent and also memory intensive for large network. 
\section[{iv. Simplex Algorithm}]{iv. Simplex Algorithm}\par
It is similar to gradient decent but faster and easy to implement but does not gurantee a global minima. 
\section[{v. Train LM Algorithm}]{v. Train LM Algorithm}\par
It is much faster than all algorithm and also used to calculate performance easily implement in matlab. It used to solve the fitting problem and also provide fastest many mode sizes feed forward network. 
\section[{III.}]{III.} 
\section[{Methodology a) Levenberg-Marquardt Algorithm}]{Methodology a) Levenberg-Marquardt Algorithm}\par
In order to make sure that the approximated Hessian matrix JTJ is invertible. 
\section[{Levenberg-Marquardt algorithm introduces another approximation to Hessian matrix:}]{Levenberg-Marquardt algorithm introduces another approximation to Hessian matrix:}\par
(1.1) where ? is always positive, called combination coefficient.\par
I is the identity matrix.\par
From Equation  {\ref 1}.1, one may notice that the elements on the main diagonal of the Hessian matrix will be larger than zero. Therefore, with this approximation (Equation  {\ref 1}.1), it can be sure that matrix H is always invertible.\par
(1.2) By combining Equations 1.1 and 1.2, the update rule of Levenberg-Marquardt algorithm can be presented as  {\ref (1.3)} As the combination of the steepest descent algorithm and the Gauss-Newton algorithm, the Levenberg-Marquardt algorithm switches between the two algorithms during the training process. When the combination coefficient ? is very small (nearly zero).\par
Equation (1.1) approaching to Equation (1.2) and Gauss-Newton algorithm is used. When combination coefficient ? is very large, Equation  {\ref 1}.1 approximates to  {\ref (1.4)} and the steepest descent method is used. If the combination coefficient ? in Equation  {\ref 12}.25 is very big, it can be interpreted as the learning coefficient in the steepest descent method (1.4).\par
The training process using Levenberg-Marquardt algorithm could be designed as follows:\par
i. With the initial weights (randomly generated), evaluate the total error (SSE). ii. Do an update as directed by Equation  {\ref 1}.1 to adjust weights. iii. With the new weights, evaluate the total error. iv. If the current total error is increased as a result of the update, then retract the step (such as reset the weight vector to the precious value) and increase combination coefficient ? by a factor of 10 or by some other factors. Then go to step ii and try an update again. v. If the current total error is decreased as a result of the update, then accept the step (such as keep the new weight vector as the current one) and decrease the combination coefficient ? by a factor of 10 or by the same factor as step iv. vi. Go to step ii with the new weights until the current total error is smaller than the required value. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XIII Issue III Version I  
\section[{Conclusion}]{Conclusion}\par
To analyzing the speed of sending messages between the systems. Improving the quality and accuracy of the message sending in HL7 standard. Less time require exchanging data between systems. It can be based on real time application. Provide efficient and accurate data. Train LM algorithm easily implement in matlab and provide better result as compare to all other backpropagation algorithms. Fastest method for training moderate sized feed forward neural network. In the future we can also work on Dicom images to increase the speed of sending image fastly and best quality with use of this algorithm.\par
V. 
\section[{Future Scope}]{Future Scope}\par
In future work, also more improve the speed of sending message with some another network and also more distortion measures and feature domains will be used as the image samples. Also, the relationship between the metrics adopted for the combination will be further investigated to find the best combination among them. More experiments are needed to validate properties of the network such as it optimum number of neurons in hidden layers, validation etc. Performance comparison of LMBP with other networks should also be discussed. \begin{figure}[htbp]
\noindent\textbf{2013}\includegraphics[]{image-2.png}
\caption{\label{fig_0}M © 2013 D}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}D}\end{figure}
 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Kong]{b1}\label{b1} 	 		\textit{},  		 			Hong Kong 		.  		 	 
\bibitem[ Artificial Neural Networks in Bioinformatics" Sri Lanka Journal of Bio-Medical Informatics ()]{b5}\label{b5} 	 		\textit{},  		 \xref{http://dx.doi.org/10.4038/sljbmi.v1i2.1719}{10.4038/sljbmi.v1i2.1719}.  	 	 		\textit{Artificial Neural Networks in Bioinformatics" Sri Lanka Journal of Bio-Medical Informatics}  		2010. 1  (2)  p. 104.  	 
\bibitem[A Layer-by-Layer Levenberg-Marquardt algorithm for Feed forward Multilayer Perceptron Received July 1 (2011)]{b6}\label{b6} 	 		‘A Layer-by-Layer Levenberg-Marquardt algorithm for Feed forward Multilayer Perceptron’.  	 	 		\textit{Received July 1}  		2011. August 15. 2011. 2011. January 2012.  	 	 (accepted September 5) 
\bibitem[Artificial Neural Networks in Medical Diagnosis IJCSI International Journal of Computer Science Issues (2011)]{b2}\label{b2} 	 		‘Artificial Neural Networks in Medical Diagnosis’.  		 \url{www.IJCSI.org}  	 	 		\textit{IJCSI International Journal of Computer Science Issues}  		March 2011. 8  (2)  p. .  	 
\bibitem[Corresponding Author: Dr. Jamal M. Nazzal (19328)]{b4}\label{b4} 	 		\textit{Corresponding Author: Dr. Jamal M. Nazzal},  				 (Amman, Jordan 546)  		19328.  		 			Al Ahliyya Amman University 		 	 
\bibitem[Mo Wilamowski and Yu ()]{b8}\label{b8} 	 		‘Improved Computation for Levenberg-Marquardt Training’.  		 			Bogdan Mo Wilamowski 		,  		 			Hao Yu 		.  	 	 		\textit{IEEE Trans. Neural Networks}  		2010. 21  (6)  p. .  	 
\bibitem[Multilayer Perceptron Neural Network (MLPs) For Analyzing the Properties of Jordan Oil Shale World Applied Sciences Journal ()]{b3}\label{b3} 	 		‘Multilayer Perceptron Neural Network (MLPs) For Analyzing the Properties of Jordan Oil Shale’.  	 	 		\textit{World Applied Sciences Journal}  		2008ISSN 1818-4952. 2008. IDOSI Publications. 5  (5)  p. .  	 
\bibitem[Lera and Pinzolas ()]{b7}\label{b7} 	 		‘Neighborhood Based Levenberg-Marquardt Algorithm for Neural Network Training’.  		 			G Lera 		,  		 			M Pinzolas 		.  	 	 		\textit{IEEE Trans. on Neural Networks}  		2002. 13  (5)  p. .  	 
\bibitem[Performance of Levenberg-Marquardt Backpropagation for Full Reference Hybrid Image Quality Metrics" International multiconference of engineers and computer scientists (2012)]{b0}\label{b0} 	 		\textit{Performance of Levenberg-Marquardt Backpropagation for Full Reference Hybrid Image Quality Metrics" International multiconference of engineers and computer scientists},  		 IMECS 2012.  		2012. March 14-16, 2012.  	 
\bibitem[Kermani et al. ()]{b9}\label{b9} 	 		‘Performance of the Levenberg-Marquardt neural network training method in electronic nose applications’.  		 			B G Kermani 		,  		 			S S Schiffman 		,  		 			H G Nagle 		.  	 	 		\textit{Science Direct, Sensors and Actuators B: Chemical}  		2005. 110  (1)  p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
