Project Title

Under Graduate Final Year Project Report

STUDENT NAME1 FA15-BTE-00

STUDENT NAME2 FA15-BTE-00
STUDENT NAME3 FA15-BTE-00
STUDENT NAME4 FA15-BTE-00

Project Advisor: Dr.

Fall 2018

COMSATS UNIVERSITY ISLAMABAD,

LAHORE CAMPUS, PAKISTAN
 Submission Form for FYP Report

NUMBER OF
PROJECT ID
MEMBERS

TITLE

SUPERVISOR NAME TERNAL / EXTERNAL

MEMBER NAME REG. NO. EMAIL ADDRESS

CHECKLIST:
Number of pages in this report

I/We have enclosed the soft-copy of this document along-with the

YES / NO
codes and scripts created by myself/ourselves
My/Our supervisor has attested the attached document YES / NO

I/We confirm to state that this project is free from any type of
YES / NO
plagiarism and misuse of copyrighted material

MEMBERS’ SIGNATURES

Supervisor’s Signature

Note 1: This paper must be signed by your supervisor

Note 2: The soft-copies of your project report, source codes, schematics, and executables should be delivered in a CD

COMSATS University Islamabad, Lahore Campus Department of Electrical and Computer Engineering
 This work, entitled “Project Title” has been approved to fulfil partial
requirements for the award of
BS in Electrical (Telecommunication) Engineering to
STUDENT NAME1 FA15-BTE-00
and
BS in Computer Engineering to
STUDENT NAME2 FA15-BCE-00

Fall 2018

External Examiner:

Head of Department:

Department of Electrical and Computer Engineering

COMSATS UNIVERSITY ISLAMABAD
LAHORE CAMPUS– PAKISTAN

Declaration
“No portion of the work referred in this report has been submitted in fulfilment of another
degree or qualification for any other institute or university”.

MEMBERS’ SIGNATURES

iii
 Acknowledgements

It is usual to thank those individuals who have provided particularly useful assistance, technical or otherwise, during your project.
Your supervisor will obviously be pleased to be acknowledged as he or she will have invested quite a lot of time overseeing your
progress.

In the name of God, the most kind and most merciful

I would like to thank <RELATIVES & FRIENDS> who kept backing me up in all the times,
both financially and morally…

I would also like to thank <TECHNICAL HELPERS> for his guidance and encouraging me to
work hard and smart. I have found him very helpful while discussing the optimization issues in
this dissertation work. His critical comments on my work have certainly made me think of new
ideas and techniques in the fields of optimization and software simulation.

I am grateful to the God Almighty who provides all the resources of every kind to us, so that we
make their proper use for the benefit of mankind. May He keep providing us with all the
resources, and the guidance to keep helping the humanity.

iii
 Abstract

The abstract is a very brief summary of the report's contents. It should be about half a page long. Somebody unfamiliar with your

project should have a good idea of what it's about having read the abstract alone and will know whether it will be of interest to

them.

iv
 Table of contents
1 INTRODUCTION...............................................................................................................................1

2 LITERATURE REVIEW..................................................................................................................2

3 PROJECT DESIGN............................................................................................................................3

3.1 M..................................................................................................................................................3
3.2 AR.................................................................................................................................................4
3.3 DE.................................................................................................................................................4
3.3.1......................................................................................................................................................5
3.3.2......................................................................................................................................................5

4 IMPLEMENTATION........................................................................................................................6

4.1 DEVELOPMENT STAGES................................................................................................................6

4.1.1 <Component 1>......................................................................................................................6
4.1.2 <Component 2>......................................................................................................................6
4.2 USER INTERFACE..........................................................................................................................6
4.2.1 <UI Component 1>.................................................................................................................6
4.2.2 <UI Component 2>.................................................................................................................7

5 EVALUATION...................................................................................................................................8

5.1 UNIT TESTING...............................................................................................................................8

5.2 FUNCTION TESTING......................................................................................................................8
5.2.1 Testing Requirements < A, B, C>...........................................................................................8
5.2.2 Testing Requirements < A, B, C>...........................................................................................8
5.3 RESULTS.......................................................................................................................................8
5.3.1 Results of Development Stage 1..............................................................................................8
5.3.2 Results of Development Stage 2..............................................................................................8
5.4 COMPARISON................................................................................................................................8

6 CONCLUSIONS & FUTURE WORK.............................................................................................9

REFERENCES..........................................................................................................................................10

APPENDIX A: HDL OR C SOURCE CODE.........................................................................................12

APPENDIX B: HARDWARE SCHEMATICS.......................................................................................13

APPENDIX C: LIST OF COMPONENTS.............................................................................................14

Appendix D: Project Timeline.....................................................................................................................15

v
vi
 Table of Figures
FIGURE 2-1 AN EXAMPLE OF INSERTING FIGURE INTO YOUR PROJECT.........................................................2
FIGURE 3-1 EXAMPLE FIGURE FOR PROTOTYPE APPLICATION......................................................................3
FIGURE 3-2 ARCHITECTURE OVERVIEW DIAGRAM........................................................................................4
Figure 4-1 Example Figure for User Interface...............................................................................................7

vii
1 Introduction
This is one of the most important components of the report. It should begin with a clear statement of what the project is about so that
the nature and scope of the project can be understood by a lay reader. It should summarize everything you set out to achieve,
provide a clear summary of the project's background, relevance and main contributions. The introduction should set the scene for the
project and should provide the reader with a summary of the key things to look out for in the remainder of the report.
 The introduction itself should be largely non-technical.
 It is sometimes useful to state the main objectives of the project as part of the introduction.
 Concentrate on the big issues, e.g. the main questions (scientific or otherwise) that the project sets out to
answer.

The main goal of the project is to investigate …

The research includes devising possible improvements in …

The project includes development of hardware to …

The project includes development of software to …

Chapter 2 covers the background material and literature reviewed to understand the intricacies
of …

Chapter Error: Reference source not found

Chapter 3
Chapter Error: Reference source not found explains ...
Chapter 6

In the end, we briefly present the conclusions from this project and also the possible future
improvements and additions for better design/implementation and investigation of <PROJECT
NAME>.

1
2 Literature Review
The background section of the report should set the project into context by relating it to existing published work
which you read at the start of the project when your approach and methods were being considered. There are usually
many ways of solving a given problem, and you shouldn't just pick one at random. Describe and evaluate as many
alternative approaches as possible.

The background section can be included as part of the introduction but is usually better as a separate chapter,
especially if the project involved significant amount of prior research. The published work may be in the form of
research papers, articles, text books, technical manuals, or even existing software or hardware of which you have had
hands-on experience.

Figure 2-1 An Example of inserting Figure into your project

WARNING: Avoid plagiarism

If you take another person's work as your own and do not cite your sources of
information you are being dishonest; in other words you are cheating. When referring
to other pieces of work, cite the sources where they are referred to or used, rather than
just listing them at the end.

2
3 Project Design

3.1 M
A very basic prototype was developed … …

Figure 3-2 Example Figure for Prototype Application

The prototype was helpful in … … … shown in Figure 3 -2.

3
3.2 Ar
The design of the intended product is explained graphically with the help of a diagram shown in
Figure 3 -3. The diagram explains the overall interactions of the modules and their placements.

Network
Network
Serialization
Event
Graphical User Handlers Network
Interface Generation
(GUI)

Network
Editing

Objects Links Nodes

Nodes Nodes Nodes

Path Finder
Interface Network Decomposer

Zones
Zones
Zones
(Partition)
(Partition)
Path Finder (Partitions)
Implementers

Figure 3-3 Architecture Overview Diagram

3.3 De
Following are the modules constituting the product to be developed. Please note that we are
documenting only the salient properties and methods of each module to keep the description
simple and more readable.

4
3.3.1

3.3.2

5
4 Implementation
We have implemented the suggested design using … …

4.1 Development Stages

Following were the

4.1.1 <Component 1>

We have implemented …

4.1.2 <Component 2>

…

4.2 User Interface

User Interface is an extremely important consideration for any project that requires human-
machine interaction. However, this project doesn’t require human machine interaction and
therefore the product runs solely in the background without any user input. Besides this fact, we
have introduced an option to display the current status, orientation, and power production from
the requested solar panels. The user interface is… …

4.2.1 <UI Component 1>

…………

6
 Figure 4-4 Example Figure for User Interface

4.2.2 <UI Component 2>

………

7
5 Evaluation
This chapter includes the results obtained through the implementation of the suggested design
methodology and their detailed discussion …

5.1 Unit Testing

5.2 Function Testing

5.2.1 Testing Requirements < A, B, C>

5.2.2 Testing Requirements < A, B, C>

5.3 Results
Following were the

5.3.1 Results of Development Stage 1

We have implemented …

5.3.2 Results of Development Stage 2

5.4 Comparison
…

8
6 Conclusions & Future Work
In this project, we have investigated and developed … … …

There could be several improvements possible … Some of the ideas for future development is
mentioned below:

Idea 1

Idea 2

Idea 3

9
References
[1] Ross Sherlock, Peter Mooney, Adam Winstanley & Jan Husdal, "Shortest Path Computation: A
Comparative Analysis", GISRUK pp 91-94, Sheffield, UK, April 2002.

[2] S. Shekhar, M. Coyle, A. Kohli, Path Computation Algorithms for Advanced Traveller
Information Systems, IEEE Computer Society, 1993.

[3] R. Jacob, M. Marathe and K. Nagel, A Computational Study of Routing Algorithms for Realistic
Transportation Networks, invited paper appears in ACM J. Experimental Algorithmics, 4, Article
6, 1999. http://www.jea.acm.org/1999/JacobRouting/

[4] D. Wagner, T. Willhalm and C. D. Zaroliagis; Geometric Shortest Path Containers; Universit¨ at
Karlsruhe, Fakult¨ at f¨ ur Informatik 2004-5, 2004.

[5] John Taplin, Simulation Models of Traffic Flow, Proceeding of the 34th Annual Conference of the
Operational Research Society of New Zealand (ORSNZ'99), Keynote Paper, University of
Waikato, Hamilton NZ, December 1999, pp 175-184.

[6] S. Pallottino e M. G. Scutell`a, Shortest path algorithms in transportation models: classical and
innovative aspects, In (P. Marcotte and S. Nguyen, eds.) Equilibrium and Advanced Transportation
Modelling, Kluwer (1998) 245-281.

[7] Andrea Díaz, Verónica Vázquez, G. Wainer. "Vehicle routing in Cell-DEVS models of urban
traffic". In Proceedings of European Simulation Simulation. Marseille, France. 2001.

[8] Rong Zhou and Eric A. Hansen, Breadth-First Heuristic Search , 14th International Conference on
Automated Planning and Scheduling (ICAPS-04) Whistler, British Columbia, Canada, 2004.

[9] Jayadev Misra, A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point
computation. Information Processing Letters. Volume 77, Number 2-4, pp 197-200. February
2001.

[10] Matthias Schmidt, "Decomposition of a Traffic Flow Model for a Parallel Simulation", Proc. AI,
Simulation and Planning in High Autonomy Systems (AIS2000), March 6-8, 2000, Tucson, USA,
pp 199-202

[11] KLD Associates Inc. (last accessed on April, 2004). http://www.kldassociates.com/

[12] Peytchev E., Bargiela A., Parallel simulation of city traffic using PADSIM, Proceedings of
Modelling and Simulation Conference ESM'95, Prague, Eds. M Snorek, M Sujansky, A Verbraeck,
June 1995, ISBN 1-56555-080-3, pp. 330-334.

[13] Oscar Franzese and Shirish Joshi, Traffic Simulation Application to Plan Real-Time Distribution
Routes, Proceedings of the 2002 Winter Simulation Conference (WSC), E. Yücesan, C.-H. Chen,
J. L. Snowdon, and J. M. Charnes, eds.

[14] Polly Huang and John Heidemann, Minimizing Routing State for Light-Weight Network
Simulation, In Proceedings of the International Symposium on Modeling, Analysis and Simulation
of Computer and Telecommunication Systems, p. to appear. Cincinnati, Ohio, USA, IEEE. August,
2001. http://www.isi.edu/~johnh/PAPERS/Huang01b.html

[15] Yu Jiangsheng, Lecture on Single-Source Shortest Paths, Institute of Computational Linguistics,

Peking University, 2003

[16] Baruch Awerbuch , Bonnie Berger , Lenore Cowen , David Peleg, Near-Linear Time Construction
of Sparse Neighborhood Covers, SIAM Journal on Computing, v.28 n.1, p.263-277, Feb. 1999
10
[17] Vittorio Astarita, Vincenzo Punzo, Vincenzo Torrieri, Calibration and Comparison Of Simulation
Models For Road Network Planning: The Congested Network Of Pozzuoli, 9th Meeting of the
Euro Working Group on Transportation, Bari, Italy, June 2002.

[18] M.Herty And A.Klar, “Modeling, Simulation,And Optimization Of Traffic Flow Networks”,
SIAM Journal On Scientific Computing Volume 25, Number 3 Pp. 1066-1087

[19] Andrew V. Goldberg and Craig Silverstein, Implementation of Dijkstra’s Algorithm Based on
Multi-Level Buckets, Technical Report 95-187, NEC Research Institute, Princeton, NJ, 1995

[20] Ariel Orda and Raphael Rom, "Shortest path and minimum-delay protocols in networks with time-
dependent edge-length", Journals of the ACM, Volume 37 ,  Issue 3, pp 607-625, 1990,
ISSN:0004-5411

[21] A. Orda and R. Rom. Shortest-path and minimum-delay algorithms in networks with time-
dependent edge-length. Journal of the ACM, 37(3):607--625, 1990.

[22] Hermann Kaindl and Gerhard Kainz. Bidirectional heuristic search reconsidered. Journal of
Artificial Intelligence Research, 7:283--317, 1997.

[23] D. Wagner, T. Willhalm, C. Zaroliagis. Dynamic shortest path containers. Alberto Marchetti-
Spaccamela, Proc. Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003),
Volume 92 of Electronic Notes in Theoretical Computer Science, pages 65-84, 2004.

[24] P. W. Eklund, S. Kirkby, and S. Pollitt, A Dynamic Multi-source Dijkstra’s Algorithm for Vehicle
Routing, IEEE Transactions, Proceeding 1996 Australian New Zealand Conference on Intelligent
Information Systems, 18-20 November 1996, Adelaide, Australia.

[25] Öjvind Johansson. Graph decomposition using node labels. PhD thesis, Royal Institute of
Technology, Stockholm, 2001.

11
Appendix A: HDL or C Source Code

12
Appendix B: Hardware Schematics

13
Appendix C: List of Components

14
Appendix D: Project Timeline

DATE

TOTAL NUMBER
PROJECT ID OF WEEKS IN
PLAN

TITLE

STARTING
No. DESCRIPTION OF MILESTONE DURATION
WEEK
1

10

* You can provide Gantt chart instead of filling this form, if you like

15