OKAN University Ph.D. Thesis Format · Web viewPlace your abstract between these braces. The text of your abstract must not exceed 350 words. Place your abstract between these braces

ISTANBUL OKAN UNIVERSITY

INSTITUTE OF SCIENCES AND ENGINEERING

COMPUTER ENGINEERING DEPARTMENT

FIRST LINE OF TITLE

SECOND LINE OF TITLE

THIRD LINE OF TITLE

A Thesis

submitted by

YOUR NAME

in partial fulfillment of the requirements for the degree of

MASTER OF SCIENCE

December 2000

Program: Computer Engineering

i

FIRST LINE OF TITLE


THIRD LINE OF TITLE

A Thesis

by

YOUR FULLNAME

submitted to Institute of Sciences and Engineering

ISTANBUL OKAN UNIVERSITY

in partial fulfillment of the requirements for the degree of

MASTER OF SCIENCE

Approved by:

ChairName

SurnameSupervisor

Member'sName

Member (Other University Name)

Member'sName

Member

Member'sName

Member

Member'sName

Member

December 2000

Program: Computer Engineering

ii

ABSTRACT

FIRST LINE OF TITLE


THIRD 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

iii

KISA ÖZET

FISRT 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

iv

To Name

v

ACKNOWLEDGMENT

Place your acknowledgment

vi

TABLE OF CONTENTS

LIST OF TABLES......................................................................................................VII

LIST OF FIGURES...................................................................................................VIII

SYMBOLS...................................................................................................................IX

I. INTRODUCTION......................................................................................................1

1.1. QUEUING THEORY BACKGROUND........................................................................1

1.1.1.1. Queuing theory background comes here...................................3

1.2. NETWORK APPLICATIONS....................................................................................3

1.2.1. Application details come here..................................................................3

1.3. SOLUTIONS...........................................................................................................4

1.3.1. Solutions come here.................................................................................4

1.3.2. Closure approximations in the tandem queue..........................................4

1.3.3. The Kolmogorov Solution........................................................................4

1.3.3.1. Approximations for the tandem queue......................................4

II. IMPLEMENTATION AND RESULTS....................................................................5

2.1. TEST CONDITIONS................................................................................................5

2.2. RESULTS...............................................................................................................5

III. SUMMARY AND CONCLUSIONS.......................................................................6

REFERENCES...............................................................................................................7

APPENDIX A................................................................................................................8

APPENDIX B.................................................................................................................9

VITA............................................................................................................................10

vii

LIST OF TABLES

Table VIII.100. Test most attractive table ever composition is never going to

end it looks like a beautiful combination.............................................1

Table II.1. Tablo 2 Test most attractive table ever composition is never

going to end it looks like a beautiful combination...............................6

Table II.2. Tablo 3 Test most attractive table ever composition is never

going to end it looks like a beautiful combination...............................6

viii

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

ix

SYMBOLS

Alpha

Beta

x

ABBREVIATIONS

TV Television

TL Turkish Lira

1

I. INTRODUCTION

I.1. Queuing theory Background

Add a footnote

This is a footnote1

This is another footnote 2

Put your equations in invisible Error: Reference source not found tables.

A=π r2 (1.1)

A=π r2 (I.1)

A=π r2 (I.2)

Table I.1. Test most attractive table ever composition is never going to end it

looks like a beautiful combination

Test TestTest Test

1 This is a footnote

2 Test2

2

Figure I.1. Okan Logo.

Figure I.2. Okan Logo Repeat.

Figure I.3. Okan Logo Repeat 2.

3

I.1.1.1. 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 Error: Reference source not

foundError: Reference source not foundError: Reference source not foundfirst (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].

A=π r2

y=a r2+bx.(I.3)

This is the first chapter. This is the first chapter. This is the

A first chapter. This is the first chapter. This is the first chapter.

This is y the Figure I.2 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 Error: Reference source not

found chapter. This is the first chapter [2].

I.2. Network Applications


the first chapter. This is the first chapter. This is the Figure I.2 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 Error: Reference source not found chapter. This is the first

chapter [2].

I.2.1. Application details come here


the first chapter. This is the first chapter. This is the Figure I.2 first chapter. This is

4


chapter. This is the first Error: Reference source not found chapter. This is the first

chapter [2].

I.3. 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)

I.3.1. Solutions come here

I.3.2. Closure approximations in the tandem queue

I.3.3. The Kolmogorov Solution

I.3.3.1. Approximations for the tandem queue


the first chapter. This is the first chapter. This is the first Error: Reference source not

found 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].



5


is the first chapter. This is the first chapter [4].



chapter. This is the first chapter. This is the first chapter. This is the Figure II.4 first

chapter. This is the first chapter. This is the first chapter [5].



chapter. This is the first chapter. This is the first Error: Reference source not found

chapter. This is the first chapter. This is the first chapter. This is the first Error:

Reference source not found chapter [6].

6

II. IMPLEMENTATION AND RESULTS

II.1. Test Conditions

A=π r2 (II.4)

II.2. Results

Figure II.4. Okan Logo 2.

Table II.2. Tablo 2 Test most attractive table ever composition is never going to

end it looks like a beautiful combination

Test TestTest Test

Table II.3. Tablo 3 Test most attractive table ever composition is never going to

end it looks like a beautiful combination

Test TestTest Test

7

III. SUMMARY AND CONCLUSIONS




is the first chapter.

A=π r2 (III.5)

A=π r2 (III.6)

8

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.

9

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++) { }

10

APPENDIX B

A=π r2 (B.1)

11

VITA

Write your vita here

Documents

OKAN University Ph.D. Thesis Format · Web viewPlace your abstract between these braces. The text of your abstract must not exceed 350 words. Place your abstract between these braces