\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={Performance Evaluation of Non Functional Requirements},
 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-01-15 (revised: 15 January 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-01-15}
\title{Performance Evaluation of Non Functional Requirements}
\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]{K.  Mahalakshmi}

             \affil[1]{  Dept. of CSE Surya Group of Institutions}

\renewcommand\Authands{ and }

\date{\small \em Received: 14 December 2012 Accepted: 31 December 2012 Published: 15 January 2013}

\maketitle


\begin{abstract}
        


Requirement engineering (RE) concerns goal identification by a system, operationalization of such goals into services and constraints, and assigning responsibilities, needs to agents including humans, devices/software. RE processes include negotiation, documentation, domain analysis, specification, elicitation, assessment, and evolution. It is difficult and critical to get high quality requirements. The paper gives a synopsis of the field of requirements engineering. RE is defined, and a brief history of main concepts and techniques is presented. The result got by using the method is very promising. It was evaluated extensively on Non Functional Requirements (NFR) dataset obtained from PROMISE repository, which is publicly accessible.

\end{abstract}


\keywords{requirement engineering, functional require-ments, non function requirements, performance.}

\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
equirements engineering (RE) \hyperref[b0]{[1]} is activities set concerning identifying/communicating a software-intensive system's purpose and contexts of use. So, RE spans users real-world needs, customers, and other constituencies affected by software systems and capabilities/opportunities provided by software-intensive technology. An abstract description of how a specific organization conducts activities, resource usage focused and dependencies between activities is a process model. Methods and process models difference is that while methods focus on technical activities (activities content), process models focus on activities management (how activities can be measured/improved).\par
A software system's success measure \hyperref[b1]{[2]} is the degree to which it meets its intended purpose. Generally, software systems requirements engineering discovers that purpose through identification of stakeholders, their needs and documenting them in a process amenable to analysis, communication, and implementation. There are many difficulties in this. Stakeholders (paying customers, users and developers) could be numerous and distributed. "Requirements engineering is that branch of software engineering dealing with real-world goals for, functions of, and constraints on software systems. It concerns these factors, relationship to precise software behavior and to its evolution with time across software families."\par
A requirement is a condition/capability to be met/fulfilled by a system satisfying a contract, specification, standard, or formally imposed documents. Requirements for a system should be verifiable, consistent, correct, and traceable. RE specifies, understands, elicits, and validates customers/users requirements. It identifies technological restrictions through which an application should be built/run. An iterative/co-operative process, it aims to analyze a problem, document results in various formats, evaluating results precision. RE iterative process includes 3 activities \hyperref[b3]{[3]}:? Requirements elicitation ? Requirements specification ? Requirements validation\par
The process starts with requirements elicitation. A developers' set collect users and customers information. Information is got from documents, legacy applications, interviews used in preparation of requirements catalogue. Finally, requirements validation finds out if there are inconsistencies/mistakes/undefined requirements. Specification-validation is iterative being executed many times in complex projects. Activities which are basic to all RE processes \hyperref[b4]{[4]}: ? Elicitation : Identify information sources about system and discover requirements from them.\par
? Analysis : Understand requirements, their overlaps, and conflicts. Functional requirements [5] capture a system's intended behavior which could be expressed as services, tasks or functions the system has to perform. It is useful to distinguish between baseline functionality required for a system to compete in that product domain, in product development. Features differentiate a system from competitors' products, and from the company's own product line/family variants. Features may be added functionalities, or differ from basic functionality along some quality attribute (performance or memory utilization). Functional requirements of early (nearly concurrent) releases need to be considered. Later releases can be accommodated through architectural qualities like extensibility and flexibility. 
\section[{b) Non Functional Requirements}]{b) Non Functional Requirements}\par
A semantic definition would be "any requirement that is not functional" [6]. Non -functional requirements are those which cannot be categorized in Functional, Data or Process requirements. Generally, ? They are requirements ? They are not functional, data or process requirements Non-functional requirements define overall qualities/attributes of the system that results. Nonfunctional requirements restrict product under development, development process, specifying external constraints to be met by that product. Some of the non-functional requirements are, Usual approaches to information retrieval system evaluation include relevant and non-relevant documents notion. Regarding user information need, a test collection document is provided a binary classification either as relevant/non relevant. This decision is called the gold standard or ground truth relevance judgment.? Availability Requirements ? Capacity Requirements ? Performance Requirements ? Reliability Requirements ? Security Requirements\par
NFR Locator extracts NFR sentences in unconstrained natural language documentation. The process takes project related natural language document as input. The former parses natural language into an internal representation based upon relevant features, to classify sentences into particular NFR categories or returns "not applicable" when it does not specify a NFR \hyperref[b7]{[7]}.\par
Step 1 : Parse Natural Language\par
The process enters text into a system, parsing it and converting parsed representation into NFR Locator's sentence representation (SR). SR represents every sentence as directed graph where vertices are words and edges the relationships between them.\par
Step 2 : Classify Sentences Once parsing and initial sentence analysis is finished, a k-NN classification algorithm classifies every sentence into one/more NFR categories. Sentences classified other than "not applicable" appear on generated reports for use outside the system. A k-NN classifier predicts classification by taking a majority vote of existing k nearest neighbors' classification to the item under test. It should identify all non-functional requirements of stakeholders. Many approaches are unavailable for this. Rao and Gopich and \hyperref[b8]{[8]} suggested a 4 layered analysis approach to identify non-functional requirements. The approach has advantages over nonlayered approach. Rules were proposed for use in each layer as part of the approach which was successfully applied on 2 case studies. The identified non-functional requirements were validated through the use of a check list. Also, a metric ensured computation of completeness of the identified non-requirements. 
\section[{II.}]{II.} 
\section[{Related Works}]{Related Works}\par
Functionality and non-functional characteristics determine a software system's utility. Also usability, flexibility, performance, interoperability and security add to the score. There is currently a lop-sided emphasis on software functionality, though it was not useful or usable without non-functional characteristics. Chung and do Prado Leite \hyperref[b9]{[9]} reviewed state of the art on treating nonfunctional requirements (NFRs), when providing prospects for future directions.\par
Liu et al \hyperref[b10]{[10]} proved that continuous randomization spectrum existed where most existing tree randomizations operated around the spectrum's two ends leaving a major portion of the spectrum unexplored. The authors proposed A base learner VR-Tree generating trees with variable-randomness. VR-Trees spanned from conventional deterministic trees to complete-random trees by using a probabilistic parameter. Using VR-Trees as base models, the spectrum of randomized ensembles was explored along with Bagging and Random Subspace. It discovered that spectrum's two halves have distinct characteristics; understanding which led to the proposal of a new approach to build better decision tree ensembles. It was named Coalescence, as it coalesces many points in spectrum's random-half. Coalescence behaves like an experts committee to cater to unforeseeable conditions in training data. Coalescence performed better than the spectrum's any single operating point, without needing to tune in to a specific randomness level. The proposed empirical study ranks Coalescence top among benchmarking ensemble methods including Random Forests, Random Subspace and C5 Boosting. Coalescence was significantly better than Bagging and Max-Diverse Ensemble when compared with other methods. Though Coalescence was not greater than Random Forests, it identified conditions under which one can perform better than the other.\par
Pavlovski and Zou \hyperref[b11]{[11]} proposed application of 2 new artifacts to model linked with a business process. This was operating condition denoting a business process constraint. Control case defined controlling criteria to mitigate the risk associated with an operational condition. Modeling constraints thus was an opportunity to capture such business process characteristics early in a systems development cycle. This contributes to a model providing a more through overall business process representation. The methods assist in risk mitigation and facilitate non-functional requirements early recovery during systems development.\par
Though all systems have non-functional requirements (NFRs), they are not clearly stated in formal specification requirements. Further, NFRs may be externally imposed through government regulations/industry standards. Slankas and Williams \hyperref[b12]{[12]} examined document types (data use agreements, installation manuals, regulations, proposals requests, requirements specifications, and user manuals) containing NFRs categorized in 14 NFR categories (capacity, reliability, and security) measuring how to effectively identify/classify NFR statements in those documents. In documents evaluated, NFRs were present. Using a NFR word vector representation, a support vector machine algorithm performed twice as effectively compared to the same input on a multinomial Naïve Bayes classifier. The k nearest neighbor classifier with a unique distance metric had an F1 measure of 0.54, outperforming in experiments, optimal Naïve Bayes classifier which had a F1 measure of 0.32. It was also found that stop word lists beyond common determiners lacked minimal performance effect.\par
Asghar and Umar \hyperref[b13]{[13]} discussed/critically evaluated RE challenges highlighted by researchers and provided a model encapsulating 7 major challenges recurring in a RE phase. The challenges were further categorized as problems. Further, the model was linked to earlier research elaborating challenges not specified earlier. Anticipating RE challenges could help RE engineers prevent software tower from destruction.\par
RE is an effective phase in software development aiming to collect good requirements from stakeholders correctly. It is important for an organization to develop quality software products satisfying user needs. RE for software development is a complex exercise taking into account product demands from many viewpoints, roles, responsibilities, and objectives. Hence, it is necessary to apply RE practices in all software development phases. Pandey et al \hyperref[b14]{[14]} proposed an effective RE process model to produce quality software development requirements. Requirement management/planning were executed independently for effective requirements management. It was iterative for better RE and maintenance later. Successful implementation of the proposed RE process has good impact on quality software production. 
\section[{III.}]{III.} 
\section[{Methodology}]{Methodology}\par
For classifier validation, NFR dataset available in the promise data repository \hyperref[b15]{[15]}  Features extraction was from each requirement document using word occurrence criteria. Extracted data was used to investigate bagging and boosting methods. 
\section[{a) Boosting}]{a) Boosting}\par
Boosting \hyperref[b16]{[16]} is a method to improve learning algorithms accuracy. Given a training set of labeled examples, \{( x 1; y 1); (x 2; y2),?,(xm; ym)\}, where each xi is drawn from an underlying distribution D on a universe X, and yi ? \{+1,-1\}, a learning algorithm produces a hypothesis h : X ? \{+1,-1\}. Ideally, h "describes" not just given samples, but also underlying distribution. Boosting converts a weak learner, producing a hypothesis that is slightly better than random guessing, into a strong/accurate learner. Many boosting algorithms share a basic structure. First, the sample set is given an initial (typically uniform) probability distribution. Computation proceeds in rounds. In each round t: (1) base learner is run on current distribution Dt, producing a classification hypothesis ht; and (2) the hypotheses h1,?, ht reweight samples, defining Dt+1.\par
The process halts after predetermined rounds or when combining of hypotheses is accurate. Main design decisions on how to modify probability distribution from one round to next, and how to combine hypotheses \{ht\} t=1,..,T to form a final output hypothesis.\par
Bagging \hyperref[b17]{[17]} is based on bootstrapping and aggregating. Bootstrapping is based on random sampling with replacement. Hence, taking a bootstrap replicate S i = (X i 1 ,X i 2 , ...,X i n ) of the training set S = (X 1 ,X 2 , ... E E ? 0 for i = 1 to B do S i ? BootstrapSample (S ) C i ? ConstructClassifier (S i ) E ? E ? \{C i \} end for return E c) Random Forest\par
Random forests \hyperref[b18]{[18]} are a recursive partitioning method suiting small n large p problems. They involve a classification ensemble (aka: set) or regression trees calculated on random data subsets, using a randomly restricted and selected predictor's subset for splits in each classification tree.\par
The posterior probability that a random tree predicts class j at X, given the training data (xi, yi), i = 1,?, n, is ( ) ( ) ( ) , j Q X P h X j ? ? = =\par
Note that h depends on training data. In practice, Qj is estimated using( ) ( ) ( ) 1 1 ?, N j k k Q X I h X j N ? = = = ?\par
where I denotes indicator function. The ensemble predicts class at X by( ) ( ) arg max j j h X Q X = ? ? d) REP TREE\par
Reptree uses regression tree logic to create multiple trees in varied iterations. It then selects the best from generated trees which is then considered as representative. In tree pruning the measure used is mean square error on the tree's predictions. 
\section[{IV.}]{IV.} 
\section[{Experimental Results}]{Experimental Results}\par
The classification accuracy and the Root Mean Squared Error (RMSE) are shown in Table \hyperref[tab_0]{1}.   
\section[{Experimental Results}]{Experimental Results}\par
RE activities occur across multiple phases. Of the 7 suggested activities, only elicitation is performed clearly in all projects. Interpreting \& Structuring, and Negotiation were also performed in the projects, but they varied between implicit and explicit performance. When RE was considered as a continual task through the project, RE process model was iterative. RE activities occurred across multiple phases, making process models appear iterative. Boosting and Bagging classifiers were used in experiments with Reptree, Random forest and resampling. The results showed the performance variation between classifiers. Bagging with Random Forest and resampling achieves the best performance accuracy of 82.37\%. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}?Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-4.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}C}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_4}}\end{figure}
  \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.06696969696969696\textwidth}P{0.43787878787878787\textwidth}P{0.34515151515151515\textwidth}}
\tabcellsep under consideration\tabcellsep \\
Classifiers\tabcellsep Classification accuracy \%\tabcellsep Root mean squared error\\
\tabcellsep 59.29\tabcellsep 0.23\\
\tabcellsep 62.82\tabcellsep 0.2174\\
\tabcellsep 70.83\tabcellsep 0.197\\
\tabcellsep 82.37\tabcellsep 0.1562\\
\tabcellsep 59.94\tabcellsep 0.228\\
\tabcellsep 60.42\tabcellsep 0.2232\\
\tabcellsep 71.47\tabcellsep 0.1972\\
\tabcellsep 78.37\tabcellsep 0.1739\\
In\tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_0}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.85\textwidth}}
013\\
2\\
Year\end{longtable} \par
 
\caption{\label{tab_1}table 1 ,}\end{figure}
 			\footnote{© 2013 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Pandey et al. (2010)]{b14}\label{b14} 	 		‘An effective requirement engineering process model for software development and requirements management’.  		 			D Pandey 		,  		 			U Suman 		,  		 			A K Ramani 		.  	 	 		\textit{Advances in Recent Technologies in Communication and Computing (ARTCom), 2010 International Conference on},  				2010. October. IEEE. p. .  	 
\bibitem[John and Laurie ()]{b7}\label{b7} 	 		\textit{Automated Extraction of Non-functional Requirements in Available Documentation},  		 			S John 		,  		 			W Laurie 		.  		2013.  	 
\bibitem[John and Laurie ()]{b12}\label{b12} 	 		\textit{Automated Extraction of Non-functional Requirements in Available Documentation},  		 			S John 		,  		 			W Laurie 		.  		2013. IEEE.  	 
\bibitem[Dwork et al. (2010)]{b16}\label{b16} 	 		‘Boosting and differential privacy’.  		 			C Dwork 		,  		 			G N Rothblum 		,  		 			S Vadhan 		.  	 	 		\textit{Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on},  				2010. October. IEEE. p. .  	 
\bibitem[Beauchamp ()]{b6}\label{b6} 	 		‘Business Analysis -Delivering the Right Solution for the Right Problem’.  		 			G Beauchamp 		.  		 \url{www.smart-ba.com/articles/ba\textunderscore chain\textunderscore of\textunderscore reasoning.pdf}  	 	 		\textit{Smart BA}  		2009. February 20. 2007.  	 
\bibitem[Pance and Saso ()]{b17}\label{b17} 	 		\textit{Combining Bagging and Random Subspaces to Create Better Ensembles},  		 			P Pance 		,  		 			D Saso 		.  		2007. Berlin Heidelberg: Springer-Verlag.  	 
\bibitem[Malan et al. (1999)]{b5}\label{b5} 	 		\textit{Functional requirements and use cases. functreq. pdf, 39k},  		 			R Malan 		,  		 			D Bredemeyer 		,  		 			B Consulting 		.  		1999. June.  	 
\bibitem[Sommerville ()]{b4}\label{b4} 	 		\textit{Integrated requirements engineering: A tutorial. Software},  		 			I Sommerville 		.  		2005. IEEE. 22 p. .  	 
\bibitem[Pavlovski and Zou (2008)]{b11}\label{b11} 	 		‘Nonfunctional requirements in business process modeling’.  		 			C J Pavlovski 		,  		 			J Zou 		.  	 	 		\textit{Proceedings of the fifth Asia-Pacific conference on Conceptual Modelling-Volume},  				 (the fifth Asia-Pacific conference on Conceptual Modelling-Volume)  		2008. January. Australian Computer Society, Inc. 79 p. .  	 
\bibitem[Nuseibeh and Easterbrook (2000)]{b1}\label{b1} 	 		 			B Nuseibeh 		,  		 			S Easterbrook 		.  		\textit{Requirements engineering: a roadmap},  				2000. May.  	 
\bibitem[Chung and Do Prado Leite ()]{b9}\label{b9} 	 		‘On non-functional requirements in software engineering’.  		 			L Chung 		,  		 			J C S Do Prado Leite 		.  	 	 		\textit{Conceptual modeling: Foundations and applications},  				 (Berlin Heidelberg)  		2009. Springer. p. .  	 
\bibitem[Selvakumar and Rajaram ()]{b15}\label{b15} 	 		‘Performance Evaluation of Requirements Engineering Methodology for Automated Detection of Non Functional Requirements’.  		 			J Selvakumar 		,  		 			M Rajaram 		.  	 	 		\textit{International Journal}  		2011. p. 3.  	 
\bibitem[Proceedings of the Conference on the Future of Software Engineering]{b2}\label{b2} 	 		\textit{Proceedings of the Conference on the Future of Software Engineering},  				 (the Conference on the Future of Software Engineering)  		ACM. p. .  	 
\bibitem[Rao and Gopichand ()]{b8}\label{b8} 	 		 			A A Rao 		,  		 			M Gopichand 		.  		 arXiv:1201.6141.  		\textit{Four Layered Approach to Non-Functional Requirements Analysis},  				2012.  	 	 (arXiv preprint) 
\bibitem[Jayanthi and Sasikala ()]{b18}\label{b18} 	 		‘Reptree Classifier For Identifying Link Spam In Web Search Engines’.  		 			S K Jayanthi 		,  		 			S Sasikala 		.  	 	 		\textit{Ictact Journal On Soft Computing}  		2013. 3  (2) .  	 
\bibitem[Asghar and Umar ()]{b13}\label{b13} 	 		‘Requirement engineering challenges in development of software applications and selection of customer-off-the-shelf (COTS) components’.  		 			S Asghar 		,  		 			M Umar 		.  	 	 		\textit{International Journal of Software Engineering}  		2010. 1  (1)  p. .  	 
\bibitem[Escalona and Koch ()]{b3}\label{b3} 	 		‘Requirements engineering for web applications-a comparative study’.  		 			M J Escalona 		,  		 			N Koch 		.  	 	 		\textit{J. Web Eng}  		2004. 2  (3)  p. .  	 
\bibitem[Liu et al. ()]{b10}\label{b10} 	 		‘Spectrum of Variable-Random Trees’.  		 			F T Liu 		,  		 			K M Ting 		,  		 			Y Yu 		,  		 			Z H Zhou 		.  	 	 		\textit{Journal of Artificial Intelligence Research}  		2008. 32 p. .  	 
\bibitem[Easterbrook ()]{b0}\label{b0} 	 		\textit{What is Requirements Engineering?},  		 			S Easterbrook 		.  		2004.  	 
\end{bibitemlist}
 			 		 	 
\end{document}
