Search or add a thesis

Advanced Search (Beta)
Home > Empirical Analysis of Traditional and Agile Requirements Engineering Process

Empirical Analysis of Traditional and Agile Requirements Engineering Process

Thesis Info

Access Option

External Link

Author

Sidra Arshad

Institute

Virtual University of Pakistan

Institute Type

Public

City

Lahore

Province

Punjab

Country

Pakistan

Thesis Completing Year

2012

Thesis Completion Status

Completed

Subject

Software Engineering

Language

English

Link

http://vspace.vu.edu.pk/detail.aspx?id=43

Added

2021-02-17 19:49:13

Modified

2024-03-24 20:25:49

ARI ID

1676720951371

Similar


User satisfaction is vital for the success of a project. To guarantee user satisfaction the user?s perspective of the required system should be well understood before embarking upon the development of the software. Requirements engineering (RE) is the branch of software engineering that consists of all those activities that leads to a successful development of the software by categorizing the users with their needs and bringing all this in an appropriate outline of citations.The most preliminary step in RE is requirement ?Elicitation phase? that is based on gathering necessities of the users before taking any step in the development of software. The Researchers performed research on requirement ?Elicitation phase? to discover the problems faced throughout elicitation. Thesis research is based upon questionnaire that is, obtained by a survey, which is conducted on students of a public University in Pakistan. A framework is used to analyze and resolve the problems those were identified by the students during survey. The framework is based on Extreme Programming (XP), the agile methodology. The concept of story card is introduced for the students with the idea of acceptance test criteria. This framework provides instruction to students through, which problems can be reduced for them during elicitation up to greater extent.
Loading...
Loading...

Similar Books

Loading...

Similar Chapters

Loading...

Similar News

Loading...

Similar Articles

Loading...

Similar Article Headings

Loading...

2۔قتل شبہ عمد

2۔قتل شبہ عمد
کوئی شخص ، کسی کو ایسے ہتھیار سے مارے جس کی ضرب سے عام طور پر انسان نہیں مرتاجیسے کوڑا ، معمولی ڈنڈالیکن اگر مضروب اس چیز کی ضرب سے مرجاتا ہے تو یہ قتل شبہ عمد ہوگا۔

Health Care and Cleanliness in Tertiary Care Hospitals in Peshawar, Khyber Pakhtunkhwa

The present study was conducted to probe the cleanliness in the tertiary healthcare hospitals in Peshawar-Pakistan. The data was collected through a structured questionnaire from 600 sampled respondents admitted in three tertiary healthcare hospitals in Peshawar i.e. Khyber Teaching hospital, Hayatabad Medical Complex and Lady Reading Hospital through proportional allocation method. The patients were very critical about the healthcare and cleanliness in the above three major hospitals of Khyber Pakhtunkhwa. The Bi-variate analysis was made and the results reveal that hospital has clean and hygienic environment (P=0.006), Medical OPD, s were clean and tidy (P=0.000), wards were clean and well maintained (P=0.000), Toilets were clean and well maintained (P=0.000). The study recommended that hospital administration should keep focus on cleanliness in washroom, clean water and clean food to the patients.

Shape from Geometric Regularities

3D shape reconstruction is a well-studied problem in Computer Vision literature and robust algorithms exist for 3D reconstruction using multiple photographs of rigid environments such as buildings and man-made objects. However, rigid 3D reconstruction using just one photograph is an ill-posed problem as we need to estimate 3D data from 2D observations. On the other hand, recovery of non-rigid 3D structure underlying human motion and clothing, from one or more videos is also a fundamentally challenging problem. In this thesis we propose novel geometric approaches for Single View Reconstruction using an abundance of orthogonal angles in urban environments, and non-rigid 3D reconstruction using limited spatiotemporal deformations due to natural motion constraints. Rigid man-made structures, such as buildings, are characterized by a profusion of mutually orthogonal line-pairs. Previous literature uses this regularity by grouping lines into orthogonal vanishing directions to rectify the projectively distorted images of planes. Unfortunately, this is a global constraint since all lines must follow a grid structure. Instead, we use locally adjacent orthogonal line-pairs for 2D Metric Rectification and demonstrate a robust solution wider applications. We pose the problem as explicit plane pose recovery which easily extends to Single View Reconstruction (SVR) of a multi-planar scene if plane boundaries are known. Moreover, we propose the first automated line based SVR algorithm with automatic segmentation for arbitrary plane and camera orientations. We only use the local angle regularity assumption combined with a 2.5D multi-planar layout. This is in contrast to the previous line-based algorithms that worked exclusively in either indoor or outdoor scenarios; restricted line, plane and camera orientations globally; and required ground plane or ceiling to be visible. We also extend the angle regularity idea into 3D where projectively distorted multi-planar structures, recovered using uncalibrated cameras, are rectified using locally adjacent orthogonal plane-pairs. Natural motion of humans, animals and clothing results in deformable shapes but these deformations are not arbitrary due to physical constraints. These regularities are typically posed as compactness of shape and trajectory bases so the deformable structure can be represented with far fewer parameters. This compact representation is useful when recovering non-rigid 3D structure using a single camera - otherwise an ill-posed problem since we need to recover 3D points from an equal number of 2D observations. Traditional algorithms require all feature points to be tracked at all times, stack them together in an observation matrix, and use matrix factorization to recover the 3D structure using rank constraints arising from shape or trajectory compactness. However, tracking all feature points at all times is not practical due to occlusions and deformations in the local patches being tracked. Therefore, we formulate these regularities as Local Rigidity constraints in space and time, resulting in a robust algorithm which reconstructs much shorter tracked sequences in the presence of missing data. In typical commercial applications known as Motion Capture, multiple static infrared cameras are required to track and reconstruct the deformable shapes. We extend the shape and trajectory compactness idea to multiple static cameras and propose an elegant factorization algorithm that works in the trajectory and shape subspaces directly. In contrast with previous single and multi-camera approaches, the proposed algorithm handles considerable amounts of noise and missing data, allowing for applications where specialized infrared cameras and markers are not available to aid in feature tracking. Ubiquitous nature of geometric regularities restricts the solution space for several geometric vision problems but investigating all possible applications of geometric regularities is intractable. Nonetheless, we present a wide range of novel algorithms for 2D, multi-planar 3D, and non-rigid 3D problems, using one or more cameras, while extending beyond the stability and applicability of previous solutions. We believe this provides sufficient evidence in favor of using geometric regularities for shape recovery.