{"_buckets": {"deposit": "a140628d-c1ed-4b33-b5d1-687ea3991560"}, "_deposit": {"id": "3880", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3880"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3880", "sets": ["1597824273898", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Implementation of Finding Shortest Path for Fire Incidence Using Dijkstra’s Algorithm", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "The fire service mission is to assist the public inthe protection of life and properties by minimizing theimpact of fire, medical emergencies, and potentialdisasters or events that affect communities and theenviromnment.Implementation of the system is bases onthe Dijkstra’s algorithm which efficiently finds theshortest path from the fire station to the fire incidence.When a fire occurs, any delay of responding fire stationscan make the difference between the rescue of occupantsversus serious injury or death. Dijkstra’s algorithm is oneof the most effective algorithms to find the shortest pathbetween two points, fire station and the place of fireaccidence. It is simple, easy to understand and implement,yet impressively efficient. This system is also implementedby using the theory based on Dijkstra’s Algorithm."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-08-02"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Implementation of Traveler.pdf", "filesize": [{"value": "10 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 10000.0, "url": {"url": "https://meral.edu.mm/record/3880/files/Implementation of Traveler.pdf"}, "version_id": "8ffc02b9-d0af-44db-b169-696755b88dba"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Third Local Conference on Parallel and Soft Computing", "subitem_pages": "", "subitem_volume": ""}]}, "item_1583103147082": {"attribute_name": "Conference papers", "attribute_value_mlt": [{"subitem_acronym": "", "subitem_c_date": "", "subitem_conference_title": "", "subitem_part": "", "subitem_place": "", "subitem_session": "", "subitem_website": ""}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{"subitem_book_title": "", "subitem_isbn": "", "subitem_pages": "", "subitem_place": "", "subitem_publisher": ""}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_awarding_university": "", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Zeya, Kyaw"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2009-08-03"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1603"}, "item_title": "Implementation of Finding Shortest Path for Fire Incidence Using Dijkstra’s Algorithm", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003880", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-08-02"}, "publish_date": "2019-08-02", "publish_status": "0", "recid": "3880", "relation": {}, "relation_version_is_last": true, "title": ["Implementation of Finding Shortest Path for Fire Incidence Using Dijkstra’s Algorithm"], "weko_shared_id": -1}