OKAN University Ph.D. Thesis Format
11
ISTANBUL OKAN UNIVERSITYINSTITUTE OF SCIENCES AND ENGINEERING
COMPUTER ENGINEERING DEPARTMENT
FIRST LINE OF TITLESECOND LINE OF TITLETHIRD LINE OF TITLE
A Dissertationsubmitted byYOUR NAME
in partial fulfillment of the requirements for the degree ofDOCTOR OF PHILOSOPHY
December 2000Program: Computer Engineering
i
FIRST LINE OF TITLESECOND LINE OF TITLETHIRD LINE OF TITLE
A DissertationbyYOUR FULLNAMEsubmitted to Institute of Sciences and EngineeringISTANBUL OKAN UNIVERSITYin partial fulfillment of the requirements for the degree ofDOCTOR OF PHILOSOPHY
Approved by:
Chair
Name
Surname
Supervisor
Member's
Name
Member
(Other University Name)
Member's
Name
Member
Member's
Name
Member
Member's
Name
Member
December 2000
Program: Computer EngineeringABSTRACTFIRST LINE OF TITLESECOND LINE OF TITLETHIRD LINE OF TITLE
Place your abstract between these braces. The text of your abstract must not exceed 350 words. Place your abstract between these braces. The text of your abstract must not exceed 350 words. Abstract and Keywords must be within one page.
Keywords: Keywords
KISA ÖZETFISRT LINE OF TITLE SECOND LINE OF TITLE THIRD LINE OF TITLE
Çalışmanızın özetini bu parantezler arasına yazınız. Özet 350 kelimeyi geçmemelidir. Anahtar kelimeler ve özet bir sayfa içinde kalmalıdır.
Anahtar Kelimeler: Anahtar Kelimeler
To Nameacknowledgment
Place your acknowledgment
TABLE OF CONTENTS
LIST OF TABLESvii
LIST OF FIGUREsviii
SYMBOLSix
I. INTRODUCTION1
1.1. Queuing theory Background1
1.1.1.1. Queuing theory background comes here3
1.2. Network Applications3
1.2.1. Application details come here3
1.3. Solutions4
1.3.1. Solutions come here4
1.3.2. Closure approximations in the tandem queue4
1.3.3. The Kolmogorov Solution4
1.3.3.1. Approximations for the tandem queue4
II. implementation and results5
2.1. Test Conditions5
2.2. Results5
III. SUMMARY AND CONCLUSIONS6
REFERENCES7
APPENDIX A8
Appendix B9
VITA10
LIST OF TABLES
Table VIII.100.Test most attractive table ever composition is never going to end it looks like a beautiful combination1
Table II.1.Tablo 2 Test most attractive table ever composition is never going to end it looks like a beautiful combination6
Table II.2.Tablo 3 Test most attractive table ever composition is never going to end it looks like a beautiful combination6
LIST OF FIGUREs
Figure I.1. Okan Logo.2
Figure I.2. Okan Logo Repeat.2
Figure I.3. Okan Logo Repeat 2.2
Figure II.1. Okan Logo 2.6
SYMBOLS
Alpha
Beta
ABBREVIATIONS
TV Television
TL Turkish Lira
INTRODUCTIONQueuing theory Background
Add a footnote
This is a footnote[footnoteRef:1] [1: This is a footnote]
This is another footnote [footnoteRef:2] [2: Test2]
Put your equations in invisible Table I.1 tables.
(1.1)
(I.1)
(I.2)
Table I.1.Test most attractive table ever composition is never going to end it looks like a beautiful combination
Test
Test
Test
Test
Figure I.1. Okan Logo.
Figure I.2. Okan Logo Repeat.
Figure I.3. Okan Logo Repeat 2.
Queuing theory background comes here
This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first (I.1) chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter [1].
.
(I.3)
This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the Figure I.1 first chapter. This is the first chapter. This is the first (I.3) chapter. This is the first (I.2) chapter. This is the first chapter. This is the first Figure I.2 chapter. This is the first chapter [2].
Network Applications
This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the Figure I.1 first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first Figure I.2 chapter. This is the first chapter [2].
Application details come here
This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the Figure I.1 first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first Figure I.2 chapter. This is the first chapter [2].
Solutions
On the Insert tab, the galleries include items that are designed to coordinate with the overall look of your document. You can use these galleries to insert tables, headers, footers, lists, cover pages, and other document building blocks. When you create pictures, charts, or diagrams, they also coordinate with your current document look. Use =rand(1) or use =rand(1,3)
Solutions come here Closure approximations in the tandem queueThe Kolmogorov SolutionApproximations for the tandem queue
This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first Table I.1 chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter [3].
This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter [4].
This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the Figure II.1 first chapter. This is the first chapter. This is the first chapter [5].
This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first Table II.1 chapter. This is the first chapter. This is the first chapter. This is the first Table II.2 chapter [6].
implementation and resultsTest Conditions
(II.1)
Results
Figure II.1. Okan Logo 2.
Table II.1.Tablo 2 Test most attractive table ever composition is never going to end it looks like a beautiful combination
Test
Test
Test
Test
Table II.2.Tablo 3 Test most attractive table ever composition is never going to end it looks like a beautiful combination
Test
Test
Test
Test
SUMMARY AND CONCLUSIONS
This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter. This is the first chapter.
(III.1)
(III.2)
REFERENCES
[1]S. B. Ozturk, W. C. Alexander, and H. A. Toliyat, “Direct torque control of four-switch brushless dc motor with non-sinusoidal back emf,” IEEE Trans. Power Electron., vol. 25, no. 2, pp. 263–271, 2010.
[2]B. Akin, S. B. Ozturk, H. A. Toliyat, and M. Rayner, “DSP-based sensorless electric motor fault diagnosis tools for electric and hybrid electric vehicle powertrain applications,” IEEE Trans. Veh. Technol., vol. 58, no. 5, pp. 2150–2159, 2009.
[3]S. B. Ozturk and H. a. Toliyat, “Direct Torque Control of Brushless DC Motor with Non-sinusoidal Back-EMF,” 2007 IEEE Int. Electr. Mach. Drives Conf., vol. 1, pp. 165–171, 2007.
[4]S. B. Ozturk, W. C. Alexander, and H. A. Toliyat, “Direct Torque Control of Brushless DC Motor with Non-sinusoidal Back-EMF,” 2008 IEEE Power Electron. Spec. Conf., vol. 25, no. 2, pp. 263–271, 2007.
[5]S. B. Ozturk and H. A. Toliyat, “Direct torque and indirect flux control of brushless DC motor,” IEEE/ASME Trans. Mechatronics, vol. 16, no. 2, pp. 351–360, 2011.
[6]S. B. Ozturk and H. A. Toliyat, “Sensorless direct torque and indirect flux control of brushless DC motor with non-sinusoidal back-EMF,” in Proceedings - 34th Annual Conference of the IEEE Industrial Electronics Society, IECON 2008, 2008, pp. 1373–1378.
APPENDIX A
C-Code
for (int i=0; i<1; i++) { }
for (int i=0; i<1; i++) { }
for (int i=0; i<1; i++) { }
MATLAB Code
for (int i=0; i<1; i++) { }
for (int i=0; i<1; i++) { }
for (int i=0; i<1; i++) { }
Appendix B
(B.1)
VITA
Write your vita here
