A research report in partial fulfillment of the requirements for the degree of Master of Engineering Management, School of Engineering and Applied Science, The George Washington University

Manama, Kingdom of Bahrain

To my beloved parents

Acknowledgements

I would like to take this opportunity to thanks my supervisor Prof. X Y. …

Table of Contents

Acknowledgements

List of Tables

List of Figures

List of Abbreviations

Abstr

Chapter 1. Introduction

1.1 First Section

1.2 Second Section

Chapter 2. Literature Review

2.1 First Section

2.2 Second Section

2.3 Third Section

Chapter 3. An Example of Citation

References

Appendix

Appendix B

List of Tables

Table 1: List your tables here if you have any ………………………………………. 10

List of Figures

Table 1: List your figures here if you have any ………………………………………. 20

List of Abbreviations

Abstract

Write the abstract here. Make it short, precise and accurate. It should summarize the report in two to three paragraphs.

Second paragraph starts here. Notice the font type and size, the line spacing and the vertical space between paragraphs. All paragraphs are fully justified in the whole report.

The abstract should not exceed 1 page. Notice also the roman numbing of pages from table of contents to the abstract, all should be in roman. Table of Contents stats with page i and it continues in the next pages. Before the Table of Contents there are no page numbers in the cover page or the title page. With the exception of the cover-page and title-page, the Titles in this and previous Pages are bold, Small Caps, in Times New Roman with font of size 16pt.

Chapter 1

Introduction

1.1 First Section

This chapter should be an introduction to your report. If you have written a good research proposal then its content could be put in this chapter. You should introduce your research problem, background, history and motivation, research objectives, research methodology, any limitations or restrictions, and the structure/organization of this research report. The reader should be really motivated to read your next chapters in this report.

Regarding the format of your report (margins, font type and size, line spacing, etc), please use the same settings as the one defined in this template. Students are not allowed to use their own settings. Those who are using other software than Microsoft, please make sure that the settings are defined exactly as it shown here.

Notice the page numbers, and starting from this page, is Arabic and starts from 1. The page numbers are in the bottom right corner.

There is one defined margins for the whole report as shown in Figure 1 which is in next page.

Figure 1: How the margins are defined in MS Word.

1.2 Second Section

All text should be written in Times New Roman with font size 12pt, 1.5 line spacing, and 18pt vertical space before and after each paragraph. Please note that the title of each chapter is bold, small caps and font size 24pt. Notice the empty line space before and after the chapter’s title. The section titles are written in bold and font size 14pt. Please try to avoid sub-sections unless you find really necessary. If you have sub-sections then please, do not use sub-section number with them, like 1.2.1.

You can see how the setting for paragraphs is defined in Figure 2.

Figure 2: The setting of the paragraphs in the whole report.

Chapter 2

Literature Review

2.1 First Section

Clearly every chapter is started in a new page. However, please make sure that the page numbers continues in Arabic and continuously. So this page is 4 and not 1.

2.2 Second Section

Notice that in this report we have followed one standard of writing titles where every word is capitalized (with the exception of small words like of, to, in, on, with, the, a, etc).

Here is a title of a sub-section

It is without a number, bold and in font size 12pt. You can use colors if you wish within your report. Anywhere you like. However, please make sure that they are clearly readable and printable.

2.3 Third Section

It is really crucial to use one international standard for citation and referencing. Please see the example of references shown at the end of this report. This is just one of the examples. You are free to use other international standards. However, you HAVE TO be consistent, precise, accurate and complete. Journal papers should be written differently from conference papers which are different from books which are different from dissertations. Every reference should have author names, title, publisher, publication year. Every journal paper should be written with the same style. Same for conference papers, books, chapters, dissertations, etc. Be consistent and complete. I cannot emphasize this more. One more advice, your report becomes week if you use websites as your main references. Try to minimize the use of websites as references and if you even to be better do not use websites at all.

Turnitin is programmed carefully so it does not consider the references as part of the plagiarized content. However, if you misspell the word REFERENCES in the references section then Turnitin will count the references as part of the plagiarized content. Thus, please remember to spell the word REFERENCES correctly.

The next chapter is showing a simple example of correct citation.

.

Chapter 3

An example of Citation

In this example we cite some research conducted by others. All references are shown in the references section which is written in IEEE format.

In classical uniform hashing with chaining, a set of s keys is inserted into a hash table with n separate chains (or linked lists) via a uniform hash function. The insertion time is constant, and the average search time is proportional to the load factor of the hash table α := s/n. However, even for a constant load factor, the worst-case search time (the length of the longest chain) is asymptotic to log n/log log n in probability [18, 27].

Azar et al. [3] suggested a novel approach called the greedy two-way chaining paradigm. It uses two independent uniform hash functions to insert the keys, where each key is inserted on-line into the shorter chain, with ties broken randomly. The insertion time is still constant, while the average search time cannot be more than twice the average search time of classical uniform hashing. However, the expected maximum search time is only 2 log2 log n+2α+O(1) [3, 4, 24]. The two-way chaining paradigm has been effectively used to derive many efficient algorithms [5, 6, 7]. A further variant of on-line two-way chaining [28] improves the maximum search time by a constant factor.

On the other hand, one can show that the off-line version of two-way chaining, where all the hashing values of the keys are known in advance, yields better worst-case performance [3, 8, 25]. Czumaj and Stemann [8] proved that if s ≤ 1.67545943 …×n, one can find an assignment for the keys such that the maximum chain length is at most 2 w.h.p. (with high probability, i.e., with probability tending to one as n→∞).

Appendix A: Title of the Appendix

Here you should append any appendices. The appendix title should follow same style as your chapter titles. If the titles of your appendices are long then you can write the appendices in font size 20pt instead of 24pt but you should do it for all appendices and not just one. You can also number your appendices in capital roman numbers, I, II, III, etc.

Appendix B: Title of the Appendix

Here is the second appendix.

References

Alon and J. H. Spencer, The Probabilistic Method, 2nd ed., John Wiley, New York, 2000.

Angluin and L. G. Valiant, “Fast probabilistic algorithms for Hamiltonian paths and matchings,” Journal of Computer and Systems Science, vol. 18, pp. 155—193, 1979.

Azar, A. Z. Broder, A. R. Karlin and E. Upfal, “Balanced allocations,” SIAM Journal on Computing, vol. 29 (1), pp. 180—200, 2000. A preliminary version of this paper appeared in Proceedings of the 26th ACM Symposium on Theory of Computing (STOC), pp. 593—602, 1994.

Berenbrink, A. Czumaj, A. Steger, and B. VÄocking, “Balanced allocations: the heavily loaded case,” in: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pp. 745—754, 2000.

Broder and M. Mitzenmacher, “Using multiple hash functions to improve IP lookups,” in: Proceedings of the IEEE INFOCOM 2001 Conference, Anchorage, Alaska, USA, April 2001. Full version available as Technical Report TR–03–00, Department of Computer Science, Harvard University, Cambridge, MA, 2000.

Byers, J. Considine, and M. Mitzenmacher, “Simple load balancing for distributed hash tables,” in: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems, pp. 80—87, 2003.

Czumaj, F. Meyer auf der Heide, and V. Stemann, “Contention resolution in hashing based shared memory simulations,” SIAM Journal on Computing, vol. 29, No. 5, pp. 1703–1739, 2000.

Czumaj and V. Stemann, “Randomized allocation processes,” Random Structures and Algorithms, vol. 18, Issue 4, pp. 297–331, June 2001.

Devroye, “Branching processes and their applications in the analysis of tree structures and tree algorithms,” in: Probabilistic Methods for Algorithmic Discrete Mathematics, ed. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed, pp. 249–314, 1998.

Devroye and P. Morin, “Cuckoo hashing: further analysis,” Information Processing Letters, vol. 86, pp. 215–219, 2004.

Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. Tarjan, “Dynamic perfect hashing: upper and lower bounds,” SIAM Journal on Computing, vol. 23 (4), pp. 738–761, 1994. A preliminary version appeared in: Proceedings of the 29th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 524–531, 1988.

Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in: Proceedings of the 17th International Colloquium on Automata Languages and Programming, LNCS 443, Springer-Verlag, pp. 6–19, 1990.

Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in: Data Structures and Efficient Algorithms, LNCS 594, Springer-Verlag, pp. 250–269, 1992.

Erdos, “Some remarks on the theory of graphs,” Bulletin of the American Mathematical Society, vol. 53, pp. 292–294, 1947.

ErdÄos and A. Renyi, “On the evolution of random graphs,” Publ. Math. Ins. Hunger. Acad. Sci., Vol. 5, PP. 17-61, 1960.

Fredman, J. Koml¶os, E. Szemer¶edi, “Storing a sparse table with O(1) worst case access time,” Journal of the ACM, vol. 31, pp. 538–544, 1984.

Gajewska and R. E. Tarjan, “Deques with heap order,” Information Processing Letters, vol. 22(4), pp. 197–200, 1986.

H. Gonnet, “Expected length of the longest probe sequence in hash code searching,” Journal of the ACM, vol. 28, pp. 289–304, 1981.

Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American Statistical Association, vol. 58, pp. 13–30, 1963.

Janson, D. E. Knuth, T. ÃLuczak, and B. Pittel, “The birth of the giant component,” Random Structures and Algorithms, vol. 4 (3), pp. 233–358, 1993.

Janson, T. ÃLuczak and A. Ruci¶nski, Random Graphs, John Wiley & Sons, New York, 2000.

M. Karp, “The transitive closure of a random digraph,” Random Structures and Algorithms, vol. 1, PP. 73-93, 1990.

Malalla, Two-way Hashing with Separate Chaining and Linear Probing, Ph.D. thesis, School of Computer Science, McGill University, 2004.

Mitzenmacher, A. Richa, and R. Sitaraman, “The power of two random choices: A survey of the techniques and results,” in: Handbook of Randomized Computing, (P. Pardalos, S. Rajasekaran, and J. Rolim, eds.), pp. 255–305, 2000.

Pagh, “On the cell probe complexity of membership and perfect hashing,” in: Proceedings of 33rd ACM Symposium on Theory of Computing (STOC), pp. 425–432, 2001.

Pagh and F. F. Rodler, “Cuckoo hashing,” in: Proceedings of the European Symposium on Algorithms, LNCS 2161, Springer-Verlag, pp. 121–133, 2001. A previous version is available as BRICS Report Series RS–01–32, Department of Computer Science, University of Aarhus, 2001.

Raab and A. Steger, ““Balls into bins”|a simple and tight analysis,” in: Proceedings of the 2nd Workshop on Randomization and Approximation Techniques in Computer Science, vol. 1518, Lecture Notes in Computer Science, Springer-Verlag, pp. 159–170, 1998.

Vocking, “How asymmetry helps load balancing,” in: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 131–141, 1999.

## Thanks for taking a look at our sample papers

### Do you need any help with your assignment?

Our aim is to help you get the best grades for your Coursework.

We are very confident in our quality of work that we offer you 100% Money back guarantee

Header Button Label: Get StartedGet Started