Threshold sequencing algorithms. (c2001)
Includes bibliographical references (p. 42).
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | masterThesis |
| منشور في: |
2001
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/756 https://doi.org/10.26756/th.2001.12 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513454867480576 |
|---|---|
| author | Naamani, Mohamad A. |
| author_facet | Naamani, Mohamad A. |
| author_role | author |
| dc.creator.none.fl_str_mv | Naamani, Mohamad A. |
| dc.date.none.fl_str_mv | 2001 2001-08 2011-10-13T08:19:11Z 2011-10-13T08:19:11Z 2011-10-13 |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10725/756 https://doi.org/10.26756/th.2001.12 |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | Lebanese American University |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer algorithms |
| dc.title.none.fl_str_mv | Threshold sequencing algorithms. (c2001) |
| dc.type.none.fl_str_mv | Thesis info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/masterThesis |
| description | Includes bibliographical references (p. 42). |
| eu_rights_str_mv | openAccess |
| format | masterThesis |
| id | LAURepo_737ecc862090129b112a0b5a9a5ea1bf |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/756 |
| publishDate | 2001 |
| publisher.none.fl_str_mv | Lebanese American University |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Threshold sequencing algorithms. (c2001)Naamani, Mohamad A.Computer algorithmsIncludes bibliographical references (p. 42).Response time in an infonnation system can be improved by reducing the number of blocks accessed when retrieving a document set. One approach is to restructure the document base in such a way that similar documents are placed close together in the file space. This ensures a greater probability that documents will be co-located within the same block. This thesis is based on a file sequencmg algorithm proposed by Lowden [Lowden 1985) and attempts to 1l'lodiiY and improve the algorithm proposed. A series of three sequencing algorithms are considered. The effect of associating weights to key tenns during document sequencing is the major area .of interest. Simulation with computer programs and statistical theories are used to analyze the performance of these algorithms.1 bound copy: vi, 42 leaves; tables, ill.; 30 cm. available at RNL.Lebanese American University2011-10-13T08:19:11Z2011-10-13T08:19:11Z20012011-10-132001-08Thesisinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesishttp://hdl.handle.net/10725/756https://doi.org/10.26756/th.2001.12eninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/7562020-05-18T14:53:53Z |
| spellingShingle | Threshold sequencing algorithms. (c2001) Naamani, Mohamad A. Computer algorithms |
| status_str | publishedVersion |
| title | Threshold sequencing algorithms. (c2001) |
| title_full | Threshold sequencing algorithms. (c2001) |
| title_fullStr | Threshold sequencing algorithms. (c2001) |
| title_full_unstemmed | Threshold sequencing algorithms. (c2001) |
| title_short | Threshold sequencing algorithms. (c2001) |
| title_sort | Threshold sequencing algorithms. (c2001) |
| topic | Computer algorithms |
| url | http://hdl.handle.net/10725/756 https://doi.org/10.26756/th.2001.12 |