{"_buckets": {"deposit": "66f47959-8add-4264-9e52-772dfa311b24"}, "_deposit": {"id": "4805", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4805"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4805", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Analyzing, Visualizing, and Searching for small size Balanced sets", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "We describe the design and implementation of a computer application that can search for a small size balanced set modulo p, with p prime. Additionally, the application can”analyze” and ”visualize” any given balanced set to show graphically the dependancies between the elements of the set. A nonempty set S of residues modulo N is balanced if for each x ∈ S, there is a d with 0 \u0026lt;d ≤ N/2 such that x ± d mod N both lie in S; we use α(N) to denote the minimum cardinality of a balanced set modulo N. Small size balanced sets are needed for a winning strategy in the Vector game which was introduced together with balanced sets in [5] ."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value": []}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value": []}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Eleventh International Conference On Computer Applications (ICCA 2013)", "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": "Cuong, Nguyen Phu"}, {"subitem_authors_fullname": "Nedev, Zhivko"}, {"subitem_authors_fullname": "Tin, Duong Trung"}, {"subitem_authors_fullname": "Tu, Le Anh"}]}]}, "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": "2013-02-26"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/701"}, "item_title": "Analyzing, Visualizing, and Searching for small size Balanced sets", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004805", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-11"}, "publish_date": "2019-07-11", "publish_status": "0", "recid": "4805", "relation": {}, "relation_version_is_last": true, "title": ["Analyzing, Visualizing, and Searching for small size Balanced sets"], "weko_shared_id": -1}