The exact gossiping problem for 5 messages / (Record no. 186)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01458nam a2200241 4500 |
| 001 - CONTROL NUMBER | |
| control field | UPMIN-00000009112 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | UPMIN |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20230208141627.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 230208b |||||||| |||| 00| 0 eng d |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | DLC |
| Transcribing agency | UPMin |
| Modifying agency | upmin |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) | |
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) | LG993.5 2001 |
| Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) | A64 P37 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Paredes, Jonathan T. |
| 9 (RLIN) | 2170 |
| 245 00 - TITLE STATEMENT | |
| Title | The exact gossiping problem for 5 messages / |
| Statement of responsibility, etc. | Jonathan T. Paredes |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Date of publication, distribution, etc. | 2001 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 16 leaves |
| 502 ## - DISSERTATION NOTE | |
| Dissertation note | Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2001 |
| 520 3# - SUMMARY, ETC. | |
| Summary, etc. | This paper studies a variation of the gossiping problem, where there are n persons, each of whom initially has a unique message. A pair of persons can pass to each other all the messages they have by making one telephone call. The exact gossiping problem is to determine the minimum number E(n,k) of calls for each of the n persons to know exactly k messages. Chang and Tsay (1995) studied and gave a solution to E(n,k) for k 4 based from earlier studies done by Richards and Liestman (1988) on partial gossiping. This is an extension of Chang and Tsay's paper where the methods and techniques used by then were utilized for k=5. The study was to obtain the minimum number of E(n,k) calls required for each person to know exactly k messages, for k = 5 only, for all values of n. |
| 658 ## - INDEX TERM--CURRICULUM OBJECTIVE | |
| Main curriculum objective | Undergraduate Thesis |
| Curriculum code | AMAT200, |
| Source of term or code | BSAM |
| 905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
| a | Fi |
| 905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
| a | UP |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Library of Congress Classification |
| Koha item type | Thesis |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Status | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Accession Number | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Library of Congress Classification | Not For Loan | Preservation Copy | University Library | University Library | Archives and Records | 2002-05-27 | donation | UAR-T-gd113 | LG993.5 2001 A64 P37 | 3UPML00020927 | 2022-09-21 | 2022-09-21 | ||||
| Library of Congress Classification | Not For Loan | Room-Use Only | College of Science and Mathematics | University Library | Theses | 2003-06-20 | donation | CSM-T-1048 | LG993.5 2001 A64 P37 | 3UPML00010963 | 2022-09-21 | 2022-09-21 |