<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Methodology for Estimating Working Time Effort of the Software Project</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Jakub</forename><surname>Štolfa</surname></persName>
							<email>jakub.stolfa@vsb.cz</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Computer Science V ŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava-Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Department of Computer Science VŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava -Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Svatopluk</forename><surname>Štolfa</surname></persName>
							<email>svatopluk.stolfa@vsb.cz</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Computer Science V ŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava-Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Department of Computer Science VŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava -Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ondřej</forename><surname>Koběrský</surname></persName>
							<email>ondrej.kobersky@vsb.cz</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Computer Science V ŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava-Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Department of Computer Science VŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava -Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Martin</forename><surname>Kopka</surname></persName>
							<email>martin.kopka@c4u.cz</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Computer Science V ŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava-Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Department of Computer Science VŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava -Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Jan</forename><surname>Kožuszník</surname></persName>
							<email>jan.kozusznik@vsb.cz</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Computer Science V ŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava-Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Department of Computer Science VŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava -Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Václav</forename><surname>Snášel</surname></persName>
							<email>vaclav.snasel@vsb.cz</email>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Department of Computer Science V ŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava-Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department" key="dep1">Department of Computer Science VŠB -Technical</orgName>
								<orgName type="department" key="dep2">Faculty of Electrical Engineering and Computer Science</orgName>
								<orgName type="institution">University of Ostrava</orgName>
								<address>
									<addrLine>17.listopadu 15</addrLine>
									<settlement>Ostrava -Poruba</settlement>
									<country key="CZ">Czech Republic</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Methodology for Estimating Working Time Effort of the Software Project</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">6F483A1E7FB868B022658768A97604D6</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T11:15+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The precise estimation of the time effort of the project is one of the key limits of its success. One of the ways how to achieve a correct valuation of the project is developing of a detailed analysis, which output is a structured solution that uses use cases. This paper focuses on developing a methodology for estimating working time effort of the project for one particular company. An important part of the methodology is to build up and maintain comparative database of valued use cases and time progress of realized projects. The aim of the methodology is to deliver data for evaluating a new project.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1">Introduction</head><p>The proper estimation of the project is a goal which wants to achieve almost every project manager. It is not easy quest and it is not essential. It is hard task which takes a lot of effort to do it right. And the question is how to do it right. There are several ways how to fulfill this task. Which one is the best is depending on the concrete company, concrete types of the projects etc.</p><p>However, one thing is clear, if we know supposed project progress (supposed project progress of its activities), we can find out in which phase the project is. Thereby we can figure out if the project plan is in time, late or ahead. So, we can determine the effort and plan resources of the project. For example, since some point of time we know that project will not need analyst activities anymore, so we can move analysts (they do analyst activities) out of the project, to the another project.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.1">State-of-the-art of estimation project approach</head><p>Many formal methods were published in the area of effort estimation for software development projects. Heemstra wrote down the basic ideas why, when and how to estimate projects in paper "Software cost estimation .In Information and Software Technology" <ref type="bibr" target="#b10">[12]</ref> in early 90s. This paper speaks about importance of estimation of the project. One of the mentionable information is that lot of companies do not make an estimation. And even if they make estimation, it is mainly not corresponding with a reality. Since our method is based on the use cases, we will mention only some methods utilizing the use case approach here (referenced also as parametric models).</p><p>The COCOMO methodology <ref type="bibr" target="#b0">[1]</ref> computes the effort of the software projects as a function of program size and a set of cost drivers on separate project phases. It is the Constructive Cost Model, which has been originally developed by Dr. Barry Boehm and Publisher in 1981 <ref type="bibr" target="#b11">[13]</ref>. He found out a formula computing the classification of separate cost drivers.</p><p>Similar access as COCOMO basic is used in <ref type="bibr" target="#b1">[2]</ref> where author estimates that size of a project is a function of the size of definition that was written into the use cases definition. Function points are popular method to estimate size of proposed application. The ISO/EIR organization [6] created functional size metric standard which supports that method.</p><p>Methodology introduced by <ref type="bibr" target="#b2">[3]</ref> computes the project estimation using complexity of use cases and its transactions applying the set of adjustment factors. Building the database from really measured projects with several technologies is important approach.</p><p>J. Smith in 1999 speaks about use cases and their complexity <ref type="bibr" target="#b3">[4]</ref>. It thinks about how big should a use case be and about the complexity of the big or small use cases and how much effort particular use case takes. It brings us an idea that we used for categorizing standardized use cases in our assessed company.</p><p>Almost all methods, which use estimation based on use case points, are based on method of Gustav Karner. He first described use case points. <ref type="bibr" target="#b1">[2]</ref> Use case point is described like function of the following:</p><p> the number and complexity of the use cases in the system,  the number and complexity of the actors on the system,  various non-functional requirements (such as portability, performance, maintainability) that are not written as use cases,  the environment in which the project will be developed (such as the language, the team's motivation, and so on). Like Gustav Karner says, the basic formula for converting these parameters into single measure, which is mentioned use case point, there is that it is necessary to weight the complexity of the use cases and actors and then to adjust their combined weight to reflect the influence of the nonfunctional and environmental factors.</p><p>The case studies, which are based even on use case points, are described in the paper of Bente Anda <ref type="bibr" target="#b9">[11]</ref>.</p><p>We can say that our methodology is even based on the use case point, but it looks more precisely on the use case realization, that means text of the use case. It evaluates rows, words and paragraphs of the standardized use case realization. How it works, there is described later in our paper.</p><p>Our paper is organized as follows: Section 2 introduces the problem of the project estimation in the particular company; Section 3 describes the concept of our methodology: filling of the database by the data from finished projects, categorization of the use cases and example that describes new project effort estimation. Concluding Section 4 provides a summary and discusses the planned future research.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2">Definition of the problem</head><p>Our goal was to set up an estimation working time effort of projects in the particular company. Even that the company has 130 workers and lot of finished projects, people in that company were not used to estimate a new project by some methodology. The common issue was to estimate a new project working time effort by theirs own decisions. That decisions are based on experiences obtained by solving past projects. The problem of that solution of the estimation of the project's working time effort is that it is so much human dependable. For example it means that an estimation can be wrong because the particular worker had not enough experience to do that, or he simply don't know how to make the particular estimation. The solution to this problem is the supporting tool for estimating time effort of new projects based on our methodology. This can help workers to estimate a new project by showing them average project progress of similar projects. Thanks to that methodology, worker simply knows the progress of projects with similar working time effort and can easily estimate a new one.</p><p>It is important to mention that out methodology is based on particular company and their software developing standards. The methodology was supposed to use only in that particular company at the beginning. It means we do not declare that this is general approach which can essentially work in other companies. On the other hand the aim of this paper is to provide also the guidance for other companies, which develop software in same way like our one. They can apply our methodology to their processes as well as we did it in that particular company.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1">Initial state</head><p>Initial state of the estimation in the company was described before. Thorough it is important to mention how the company makes analysis and how is a progress of the project captured.</p><p>The analysis in the company is made by use cases. These use cases are standardized. That means, if the use case deals with same repeatable issue, then it is almost similar to other use cases that are dealing with the same issue. It gives us the possibility to use these standardized use cases for the projects comparisons.</p><p>The capturing of the project progress is made by CRM system. In the CRM system you can see how much time was spent on each activity. More information about captured activities is written in next sections.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>3</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Proposal of the methodology</head><p>The following chapter is focusing on the logical principles of the methodology. Methodology consists of two main processes. Rectangle is an activity; oval is input or output data to the activity. The first process is named "Filling of the database" (Fig. <ref type="figure" target="#fig_0">1</ref>). It is a process where data about a recent project are filled into the database. It starts with data of recent projects in particular company. These data are separately executed in two main methods. First one is the "Method for finding progress" and second one is the "Method for determining the difficulty of a Use case".</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>New project</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Method for determining the dificulty of a Use case</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Database</head><p>Comparing with former projects in the database</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Estimation of a working time effort of the new project</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Fig. 2. Estimation of the new project</head><p>In case, that database is filed by the first process, the second process can be run. The Name of that process is "Estimation of the new project". The input of that process is a new project. The exact input is the finished analysis of that new project. It means that we have all required use cases. These use cases are elaborated in the activity "Method for determining the difficulty of a Use case". It is the same method like in the process named "Filling of the database". After that, process continues with the method named "Comparing with former projects in the database. The method compares former project in the filled database with data of the new project, finds similar project and estimate working time effort based on the similar projects progress. When the project is finished, the database could be extended by the new finished project. Next sections of this paper introduce particular steps of both processes.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1">Method of finding Progress</head><p>The supposed project progress, it means how much effort and time particular tracked activities should consume, is discovered by the comparison to the data of finished projects in the company. According to these data, we can find out if the company is following project methodology. If it is true, than all projects have the same or almost same progress of tracked activities.</p><p>Our method tracks progress of five main activities of the project.</p><p> Consultation (in the system(CRM) like PORA)</p><formula xml:id="formula_0"> Analysis (ANAL)  Programming (PROG)  Testing (TEST)  Implementation (IMPL)</formula><p>Steps of the method finding progress. 1) Input project data. We need to know number of worked hours in each day for particular activities, when that activity was practiced (see the table below). 2) Setting number of segments to which we will split timeline of the project.</p><p>Methodology set default number of segments to 10, but we can set even another number (5, 20, 100, etc.). The reason why to split timeline to the same segments is that, we need to normalize timelines of projects. So that we can compare projects whit each other. For example, one project last 10 months a second one last 1 month. If it is slip up only to the weeks, then first project is split to the 40 segments and second one to the 4 segments. Comparing these two projects is impossible in this way. If we split up these two projects to the same number of segments, we can compare them. First project has a 10 segments and one segments contains data of 28 days (project last 40 weeks = 280 days, we split up to 10 segments = 28 to each segment). Second project contains in one segment 2,8 days. This example shows that the last segment is not same as the others every time. It depends on the technique in the methodology, if we round up (default) or down. If we round up, one segment contains 3 days (2,8 days &gt; 3 days). A it means that last segment contains only 1 day (28 -28/3 = 1). It was proved by the experiments that this is not significantly important for the comparison of the projects. It is only good to have in on your mind for later refinement of the method. 3) Choosing the technique of the evaluation. Our methodology has two types of evaluation of the project duration, which is later split up to the, before mentioned, segments.</p><p>a. Counting all days. It means that we count all daysfrom the first day to the last day, when some of tracked activities were performed.</p><p>Then the duration of the project (number of days) is counted. Number of days is divided by number of segments (default 10). So that we know how many days the segment contains. After that calculation we add to first date number of days in segment. That date is border line. Then we add number of day in the segment to that border line and establish second border line. We have second segment. This technique has one week aspect. When we reach the end of the segment, actual summary of hours in that segment is 9 and next date contains for example 3 hours, so we close segment with actual summary 9 hours. Because we do not want to past out the limit of the segment (limit is 11, 9+3=12, 12&gt;11). It has an effect that segments could contain various numbers of hours. This might be a problem if we count projects with low number of total hours. The affection is minimal to the projects with big number of total hours. 4) Calculation. Inputs are fulfilled segments (day o hour method). Then we need to count number of hours spent on particular activity in each segment. 5) Saving a result to the database. Saving the result of the methodology is made by vectors. We can group these vectors and so that we can find out similar projects. Vectors are easily transferable to the graph. a. Structure of the vector (5 segments): First is a name of the project. Then three numbers of particular difficultly of use cases. And then are worked hours of the activity in particular segment. First is consultation, then analysis, programming, testing and last implementation. Each activity has 5 numbers divided by semicolon. It shows how much hours was worked in each segment.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Name of the project</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Difficulty of Use cases</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Hours of consultation per each segment</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Hours of analysis per each segment</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2">Method for determining the difficulty of a Use case</head><p>Following chapter describes how we evaluate particular use case.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Basic complexity according to the number of rows.</head><p>Complexity of a project is given by the difficulty of UC realizations. The difficulty of UC is hard to determine, there is no easy benchmark for their comparison. Simplest way is determining the complexity based on number of rows in every UC. We have set 3 levels of difficulty based on number of rows:</p><p> E (easy)number of rows &lt; 70  M (medium)number of rows ԑ &lt;70;110&gt;  H (hard)number of rows &gt; 110</p><p>We can obtain number of hard, medium and easy use cases for one project with this type of evaluation.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Extended complexity.</head><p>In terms of our method objectivity we decided to extend complexity with number of paragraphs and number of words in each UC. The overall difficulty of UC is then derived from the individual complexities.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Difficulty according the number of words.</head><p> E (easy)number of words &lt; 200  M (medium)number of words ԑ &lt;200;500&gt;  H (hard)number of words &gt; 500</p><p>Difficulty according the number of paragraphs.  E (easy)number of paragraphs &lt;= number of paragraphs + X -&gt; easy  M (medium) -number of paragraphs &gt; number of paragraphs + X AND number of rows &lt; number of paragraphs + Y -&gt; medium  H (hard)number of paragraphs =&gt; number of paragraphs + Y -&gt; hard</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Where X=10, Y=25</head><p>The overall difficulty.</p><p>Overall difficulty of UC can be determined as follows. Difficulty of words has the highest weight, then difficulty of rows and difficulty of paragraphs. First of all we compare difficulty of words with difficulty of rows, If they are in the same level, then the overall difficulty is in this level. If not, we compare the difficulty of words with difficulty of paragraphs, if they are on same level, then the overall difficulty is in this level. If any of them differs then we compare the difficulty of rows with paragraphs in the same way. If the comparison does not help us, overall difficulty is difficulty of words, because we consider it the most important aspect. The difficulty types and levels were checked by the correlation matrix. The result was that the actual dependency setting varies between 60-100 %. Most of the difficulty types and levels more than 2/3) are more than 95% dependable.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3">Comparing to former projects in the database</head><p>Input of this activity is evaluated by use cases of a new project. This overall difficultness of project use cases was determined in the activity Method for determining the difficulty of a Use case.</p><p>After that we find recent project are in the database which have almost similar difficultness of a use cases. The similarity is determined by next proclamation. We proclaim that two projects are similar if their particular difficulties differ by +/-2. This simple differ was set up by several experiments made on real data in the company.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4">Example</head><p>This section describes an example of using a described methodology. Inputs are analysis of four projects (Project1, Project2, Project3, Project4). It is only the example so that's why, we show only four representative projects. We cannot publish the names of the project, and that is the reason why we call them like that. Important is that all of these projects are development projects. That means they include all steps of the life cycle of the project (consultation, analysis, programming, testing, implementation).</p><p>We fulfill the database by data (vectors) of these projects. After that we take a new project, evaluate its use cases (by difficultness of UC) and find out estimated progress and difficulty.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>1) Determination of difficultness of UC of particular projects:</head><p>Difficulty according to the number of rows At the table 5 we can see the total difficultness of particular projects. This view is most important for further processing. The section 3.2 describes how the particular difficultness was set up.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>2) Compilation of vectors and graphical representation of these vectors for the projects progress</head><p>This section shows the vector for the project progress of the particular project. Structure of these vectors was described in the -Finding similar projects in database: o 4+-2; 6+-2; 13+-2we find out project with difficultness of UC +-2 according a new project. From these specified projects we make average of their progress. And that is set as estimation of the new project. o In our example it is only Project3, so we do not need to do average. o Estimated progress of the Project5 is:     These figures show progress of particular activities of the Project5. We can see estimation of working hours of particular activity in particular segments of the Project5. We can have a look for example on activities consultation and programming. It is interesting to note that estimation of working hours of consultation activity is almost stable for every segment. On the other hand estimation of working hours of programming activity is divided to the two parts. At the beginning of the project are hour spend on programming activity minimal, but at the end are major. It is essential because at the begging is not too much programming work.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4">Conclusion and Future Work</head><p>Our methodology was tested on the 20 past projects made by the company. Fifteen projects were taken to the process of filling the database. Five projects were proclaimed as new projects. The result of our methodology -supposed project progress (effort of each activity) was compared to the historical data of these projects. The difference between the predicted progress and the actual data for the tested projects was approximately 30%. The 30% inaccuracy seems not to be a good, but the previous ad-hoc human based estimation had inaccuracy 40%. We found out these data by comparing their original estimations on the beginning of the projects with result of these projects at their end. In 40 percent there was huge deflection of estimation and the real execution. Therefore our methodology brings approximately 10% improvement, which is a good result of the methodology. But we know that 30% is still huge number of inaccuracy, so that there is place to improve our methodology in future.</p><p>In the future, we plan to improve our methodology by neuron nets as tools which find out groups of similar projects. Otherwise, we plan to elaborate parameters describing the influence of the customer to every single project. Then we have to elaborate if is better to use more parameters to describe particular use cases for an execution of the methodology. At least but not last we have to have on our mind that we estimate project after first steps of analysis. Especially, after the use cases are finished. That's important to mention, because we have to include that work to the estimation of the project.</p><p>I any case the topic of estimation project's effort is huge place for research and improvements. The methodology that works for one company does not have to work for others. Our goal is to overcome that gap by trying to develop methods and that will be used in more companies than one and the results will be more accurate.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Fig. 1 .</head><label>1</label><figDesc>Fig. 1. Filling of the database.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Fig. 3 .</head><label>3</label><figDesc>Fig. 3. Progress of the consultation activity. It shows estimation of working hours of current activity in particular segments of the project.</figDesc><graphic coords="10,46.52,322.07,345.00,100.50" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Fig. 4 .</head><label>4</label><figDesc>Fig. 4. Progress of the analysis activity. It shows estimation of working hours of current activity in particular segments of the project.</figDesc><graphic coords="10,46.52,455.57,345.45,102.40" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Fig. 5 .</head><label>5</label><figDesc>Fig. 5. Progress of the programming activity. It shows estimation of working hours of current activity in particular segments of the project.</figDesc><graphic coords="11,46.52,58.41,345.40,104.45" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Fig. 6 .</head><label>6</label><figDesc>Fig. 6. Progress of the testing activity. It shows estimation of working hours of current activity in particular segments of the project.</figDesc><graphic coords="11,46.52,196.41,345.00,107.50" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Fig. 7 .</head><label>7</label><figDesc>Fig. 7. Progress of the implementation activity. It shows estimation of working hours of current activity in particular segments of the project.</figDesc><graphic coords="11,46.52,337.41,345.00,109.45" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Counting only days, where there was some work done. It</head><label></label><figDesc>That technique we have to do same way to the penult segment. To the last segment we put remaining days of the project. For example first date is 1.7.2010 and one segment has 14 days. First segment contains data of dates from 1.7.2010 to 14.7.2010. Second segment from 15.7.2010 to 28.7.2010, etc. b.</figDesc><table /><note>means that, we count on only days, when some of the tracked activities were performed. We do not count empty days. Days where there was not done any work on tracked activities. We count all effort hour and divide them by number of segments. Then, there is a difference from the first technique, we count only days, where there was some work. So segment of size 11 hours may contain for example 1.7.2011 5 hours of analysis, 13.7.2011 6 hour of programming.</note></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 1 .</head><label>1</label><figDesc>Structure of the vector. Table shows structure of the vector. It is one log table, but for that paper was divided to two.</figDesc><table /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 2 .</head><label>2</label><figDesc>Difficulty according to the number of rows.</figDesc><table><row><cell></cell><cell>T</cell><cell>S</cell><cell>L</cell></row><row><cell>Project1</cell><cell>6</cell><cell>8</cell><cell>57</cell></row><row><cell>Project2</cell><cell>1</cell><cell>1</cell><cell>12</cell></row><row><cell>Project3</cell><cell>4</cell><cell>0</cell><cell>17</cell></row><row><cell>Project4</cell><cell>0</cell><cell>2</cell><cell>4</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_3"><head>Table 3 .</head><label>3</label><figDesc>Difficulty according to the number of paragraphs.</figDesc><table><row><cell cols="3">Difficulty according to the number of words</cell><cell></cell></row><row><cell></cell><cell>T</cell><cell>S</cell><cell>L</cell></row><row><cell>Project1</cell><cell>16</cell><cell>11</cell><cell>44</cell></row><row><cell>Project2</cell><cell>3</cell><cell>7</cell><cell>4</cell></row><row><cell>Project3</cell><cell>5</cell><cell>3</cell><cell>13</cell></row><row><cell>Project4</cell><cell>2</cell><cell>2</cell><cell>2</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_4"><head>Table 4 .</head><label>4</label><figDesc>Difficulty according to the number of words.</figDesc><table><row><cell></cell><cell cols="2">Total difficultness</cell><cell></cell></row><row><cell></cell><cell>T</cell><cell>S</cell><cell>L</cell></row><row><cell>Project1</cell><cell>12</cell><cell>15</cell><cell>44</cell></row><row><cell>Project2</cell><cell>1</cell><cell>9</cell><cell>4</cell></row><row><cell>Project3</cell><cell>3</cell><cell>4</cell><cell>14</cell></row><row><cell>Project4</cell><cell>0</cell><cell>4</cell><cell>2</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_5"><head>Table 5 .</head><label>5</label><figDesc>Total difficultness.</figDesc><table /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_6"><head></head><label></label><figDesc>table 1 above.</figDesc><table><row><cell>-Pro-</cell></row><row><cell>ject3;3;4;14;5,25;13;18,25;5;12,75;7,5;8,5;11,25;8,25;5;2;10,75;1,5;0;10;6;5,5;0,5;0;5,5;3,75;1,</cell></row><row><cell>5;2;0;0;1;0;6;9;8,25;5,75;9,75;10,25;0;3,25;0,5;3;0;0;1,75;0;0;1,5;1;0;0;0;0;0;0;0;0;0;0;0,5</cell></row><row><cell>-Pro-</cell></row><row><cell>ject4;0;4;2;12;8;6;14;12,25;31,25;5;2;1;10,50;3;7,75;20,50;9,75;15;13,50;5;7,75;3,25;5;10,75;3</cell></row><row><cell>0,50;26;42;20;10,25;2,75;29;18;2;5,5;2,25;9,75;4,75;1;8;16;29,25;4,25;1;6,75;6,50;2,25;3;1;0,0;</cell></row><row><cell>0;25;13,50;18,25</cell></row><row><cell>3) Estimation of a new project -Project5</cell></row><row><cell>-Input is the new project -Project5</cell></row><row><cell>-Determination of difficultness of UC of the Project5:</cell></row><row><cell>o Hard; Medium; Easy = 4;6;13</cell></row><row><cell>-Pro-</cell></row><row><cell>ject1;12;15;44;284,75;28;48;36,75;29;60,5;27,55;2,5;0;122,5;0,75;8,25;19;27,5;27,25;22,2;2;4,</cell></row><row><cell>5;0;52,5;444,75;332,75;317,5;341;320,5;256,75;275,25;259;0;0;10,5;93,25;109,5;91,25;7;9,5;1</cell></row><row><cell>60;188,75 ;185,5;0;24,25;3;9,25;1,75;0;0,5;27,25;16;37;0</cell></row><row><cell>-Pro-</cell></row><row><cell>ject2;1;9;4;23,75;20;12;30;15;40,25;20;10,5;1;130,50;20;10;18;25,5;20,25;10,25;1;3;2;2;20,25;</cell></row><row><cell>130,75;256;432;203;150,75;25,25;259;30;0;14,5;23,25;19,75;19,75;10;17;163;129,75;174,25;2;</cell></row><row><cell>12,25;6;10,25;4,75;0;3,5;20,25;13;20;35</cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_0">J. Pokorný, V. Snášel, K. Richta (Eds.): Dateso 2012, pp. 25-37, ISBN 978-80-7378-171-2.</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_1">J. Štolfa, S. Štolfa, O. Koběrský, M. Kopka, J. Kožuszník, and V. Snášel</note>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Software Cost Estimation with COCOMO II</title>
		<author>
			<persName><forename type="first">B</forename><surname>Boehm</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Ch</forename><surname>Abts</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Brown</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Chulani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Clark</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Horowitz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Madachy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Reifer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Steece</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2000">2000</date>
			<publisher>Prentice-Hall</publisher>
			<pubPlace>Englewood Cliffs, NJ</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Estimating With Use Case Points, Methods and Tools</title>
		<author>
			<persName><forename type="first">M</forename><surname>Cohn</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Fall</title>
		<idno type="ISSN">1661-402X</idno>
		<imprint>
			<biblScope unit="volume">13</biblScope>
			<biblScope unit="issue">3</biblScope>
			<date type="published" when="2005">2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Simplifying effort estimation based on Use Case Points</title>
		<author>
			<persName><forename type="first">M</forename><surname>Ochodek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Nawrocki</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Kwarciak</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Information and Software Technology</title>
		<imprint>
			<biblScope unit="volume">53</biblScope>
			<biblScope unit="issue">3</biblScope>
			<biblScope unit="page" from="200" to="213" />
			<date type="published" when="2011">2011</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<monogr>
		<title level="m" type="main">The Estimation of Effort Based on Use Cases, Rational Software white paper</title>
		<author>
			<persName><forename type="first">J</forename><surname>Smith</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1999">1999</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Using web objects for estimating software development effort for Web applications</title>
		<author>
			<persName><forename type="first">M</forename><surname>Ruhe</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Jeffery</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Wieczorek</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the ninth international software metrics symposium</title>
				<meeting>the ninth international software metrics symposium<address><addrLine>Sydney, Australia</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2003-09-05">3-5 September 2003</date>
			<biblScope unit="page">30</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<monogr>
		<title level="m" type="main">Estimating Object-Oriented Software Projects with Use Cases</title>
		<author>
			<persName><forename type="first">K</forename><surname>Ribu</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2001">2001. 2001</date>
		</imprint>
		<respStmt>
			<orgName>University of Oslo, Department of Informatics</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Master of Science Thesis</note>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Enhancing use-case-based effort estimation with transaction types</title>
		<author>
			<persName><forename type="first">M</forename><surname>Ochodek</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Nawrocki</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Foun-dations of Computing and Decision Sciences</title>
		<imprint>
			<biblScope unit="volume">35</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="91" to="106" />
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">An empirical validation of software cost estimation models</title>
		<author>
			<persName><forename type="first">Ch</forename><surname>Kemerer</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Communications of the ACM</title>
		<imprint>
			<biblScope unit="volume">30</biblScope>
			<biblScope unit="issue">5</biblScope>
			<date type="published" when="1987">1987</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Comparing Effort Estimates Based on Use Case Points with Expert Estimates</title>
		<author>
			<persName><forename type="first">B</forename><surname>Anda</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Empirical Assessment in Software Engineering</title>
				<meeting><address><addrLine>Staffordshire</addrLine></address></meeting>
		<imprint>
			<publisher>EASE</publisher>
			<date type="published" when="2002">2002</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Estimating Software Development Effort Based on Use Cases-Experiences from Industry</title>
		<author>
			<persName><forename type="first">A</forename><surname>Bente</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Hege</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">K</forename><surname>Dag</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Magne</forename><surname>Sjoberg</surname></persName>
		</author>
		<author>
			<persName><surname>Jorgensen</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools (UML&apos;01</title>
				<meeting>the 4th International Conference on The Unified Modeling Language, Modeling Languages, Concepts, and Tools (UML&apos;01<address><addrLine>London</addrLine></address></meeting>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="2001">2001. 2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Software cost estimation</title>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">J</forename><surname>Heemstra</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Information and Software Technology</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="issue">10</biblScope>
			<date type="published" when="1992-10">October 1992</date>
			<publisher>Elsevier</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<monogr>
		<author>
			<persName><forename type="first">B</forename><surname>Boehm</surname></persName>
		</author>
		<title level="m">Software Engineering Economics</title>
				<imprint>
			<publisher>Prentice Hall</publisher>
			<date type="published" when="1981">1981</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
