Professional Documents
Culture Documents
CIRCULAR
PROJECT PHASE-II
CIRC/2013-14/PH2/C7 Dt: 03.03.2014
All the Students of 8th semester ECE are here by informed that Project
Phase II Third Review has been scheduled on 17.03.2014 (Monday) and
18.03.2014(Tuesday) it is compulsory for all to deliver a presentation that
should contain necessary slides.
SCHEDULE:
Note:
ANNEXURE-I
For Contents, Abstract, List of Abbreviations, List of figures, and list of tables the
page numbers (dummy page numbers) should be in the format (i), (ii),(iii).. (i.e
Roman Letters) And centered at the bottom of the page.
Total no of actual pages for report should be 60-80.
Soft copy of all formats (like certificates etc.) are available in the Department.
The References must be in the following format for both paper and presentation. Name
of the conference, place of the conference and pages are must for conference paper
citation. Journal name, volume number and pages are must for journal citation. All the
references should be uniformly numbered starting from 1.
TEMPLATES
Conference Template:
<Name-1>, <Name-2> and <Name-3>, Paper Title, Proceedings of the <conference name>,
<Place of conference>, pages. <Page Numbers>, <Place>, <Month, Year>.
Journal Template:
<Name-1>, <Name-2> and <Name-3>, Paper Title, <Name of the Journal>, Vol. <Volume
Number> No. <Issue Number>, pages. <page numbers>, <Month, Year>.
Book Template:
<Name-1>, <Name-2> and <Name-3>, Book Title, <Edition>, <Publisher>, <Place>, <Year>
Website Template:
EXAMPLES
Conference-Example
Makino K. and Uno T, New Algorithms for Enumerating all Maximal Cliques, Proceedings of
the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), pages. 260-272,
Humlebaek, Denmark, 2004.
Journal-Example
Cerf Loic, Besson Jeremy, Robardet Ceiline, and Boulicaut J.F, Closed Patterns meet nary
Relations, ACM Transactions on Knowledge Discovery from Data, Vol. 3, No. 1, pages. 1-36,
March, 2009.
Book-Example
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to
Algorithms, Third Edition, MIT Press, New Delhi, 2009.
Website Example
B-trees: http://en.wikipedia.org/wiki/B-tree
1. Makino K. and Uno T, New Algorithms for Enumerating all Maximal Cliques,
Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004),
pages: 260-272, Humlebaek, Denmark, 2004.
2. Cerf Loic, Besson Jeremy, Robardet Ceiline, and Boulicaut J.F, Closed Patterns meet n
ary Relations, ACM Transactions on Knowledge Discovery from Data, Vol. 3, No. 1,
pages: 1-36, March, 2009.
4. B-trees: http://en.wikipedia.org/wiki/B-tree