Index Link

  • RootNode
    • Co-operative College, Mandalay
    • Cooperative College, Phaunggyi
    • Co-operative University, Sagaing
    • Co-operative University, Thanlyin
    • Dagon University
    • Kyaukse University
    • Laquarware Technological college
    • Mandalay Technological University
    • Mandalay University of Distance Education
    • Mandalay University of Foreign Languages
    • Maubin University
    • Mawlamyine University
    • Meiktila University
    • Mohnyin University
    • Myanmar Institute of Information Technology
    • Myanmar Maritime University
    • National Management Degree College
    • Naypyitaw State Academy
    • Pathein University
    • Sagaing University
    • Sagaing University of Education
    • Taunggyi University
    • Technological University, Hmawbi
    • Technological University (Kyaukse)
    • Technological University Mandalay
    • University of Computer Studies, Mandalay
    • University of Computer Studies Maubin
    • University of Computer Studies, Meikhtila
    • University of Computer Studies Pathein
    • University of Computer Studies, Taungoo
    • University of Computer Studies, Yangon
    • University of Dental Medicine Mandalay
    • University of Dental Medicine, Yangon
    • University of Information Technology
    • University of Mandalay
    • University of Medicine 1
    • University of Medicine 2
    • University of Medicine Mandalay
    • University of Myitkyina
    • University of Public Health, Yangon
    • University of Veterinary Science
    • University of Yangon
    • West Yangon University
    • Yadanabon University
    • Yangon Technological University
    • Yangon University of Distance Education
    • Yangon University of Economics
    • Yangon University of Education
    • Yangon University of Foreign Languages
    • Yezin Agricultural University
    • New Index

Item

{"_buckets": {"deposit": "fcaf2523-a96b-43f7-b645-527369f1ebd3"}, "_deposit": {"id": "2037", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "2037"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/2037", "sets": ["user-uy"]}, "communities": ["ccm", "ccp", "kyauksetu", "ltc", "maas", "miit", "mlmu", "mmu", "mtlu", "mtu", "mub", "mude", "mufl", "pathein", "scu", "suoe", "tcu", "tgu", "tuh", "tum", "ucsm", "ucsmtla", "ucsmub", "ucspathein", "ucstaungoo", "ucsy", "udmm", "udmy", "uit", "um", "um1", "um2", "umkn", "umm", "uphy", "urj", "uvs", "uy", "yau", "ydbu", "ytu", "yude", "yueco", "yufl", "yuoe"], "control_number": "2037", "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "SOLUTION TO THE SUBSETSUMPROBLEM USING THE FRAMEWORK OF SPIKING NEURAL P SYSTEMS WITH STRUCTURAL PLASTICITY", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Spiking neural P systems (in short, SNP systems) are parallel, distributed models of computations based on the structure and function of neural cells or neurons. Neurons process only a single type of signal or object known as the spike. The neurons are placed on vertices of a directed graph, where each edge in the graph is called a synapse. Information cannot be discerned from the spikes, as spikes are indistinct signals. Instead, information is obtained\r from the time intervals between spikes, or the presence (absence) of spikes at certain time steps. Time therefore is a means to encode information, rather than simply being a background of the computations. It is known that SNP systems and their variants are Turing universal, i.e. they can simulate any Turing machine, and thus can carry out any effective computation that we know of.\r Since the introduction of SNP systems in 2006 (see [3]), many theoretical and practical problems have been solved using SNP systems. See e.g. [4] and the SNP systems chapter in [5]. In this extended abstract we use the variant known as SNP systems with structural plasticity (in short, SNPSP systems). SNPSP systems were introduced in [6] to include the neuroscience feature of structural plasticity in the SNP systems framework. In SNPSP systems, plasticity rules allow neurons to create or delete synapses.\r We use SNPSP systems in this work to provide a constant time, nondeterministic solution to the Subset sum problem. This problem is a well-known computationally hard problem with important use in cryptography. The hardness of the Subset sum problem is applied to practical use in order to secure many systems requiring encryption, see e.g. [1, 2]. Briefly, the Subset sum problem has as its inputs a set of natural numbers V = {vi, v2,..,. vn} and a\r natural number S. The task is to find a subset B of V where the elements of B sum exactly to S, see e.g. [7].\r An SNPSP system solving Subset sum is given in graphical form in Figure 1. Using plasticity rules (see Figure 1), we are able to reduce the number of neurons in our system by a linear amount (with respect to problem input size n) compared to the number of neurons in the SNP system given in [8]."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Spiking neural P systems"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-05-05"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Solution to the Subset Sum problem using the Framework of Spiking Neural P Systems with structural plasticity.pdf", "filesize": [{"value": "1108 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 1108000.0, "url": {"url": "https://meral.edu.mm/record/2037/files/Solution to the Subset Sum problem using the Framework of Spiking Neural P Systems with structural plasticity.pdf"}, "version_id": "bcb27ef5-0d2c-4b79-99f0-d1c75fdba4b0"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_journal_title": "8th AUN/SEED-Net Regional Conference on Electrical and Electronics Engineering"}]}, "item_1583103147082": {"attribute_name": "Conference papaers", "attribute_value_mlt": [{}]}, "item_1583103211336": {"attribute_name": "Books/reports/chapters", "attribute_value_mlt": [{}]}, "item_1583103233624": {"attribute_name": "Thesis/dissertations", "attribute_value_mlt": [{"subitem_supervisor(s)": []}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Cabarle, Francis George C."}, {"subitem_authors_fullname": "Adorna, Henry N."}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Other"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Other"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2015"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "https://uyr.uy.edu.mm/handle/123456789/388"}, "item_title": "SOLUTION TO THE SUBSETSUMPROBLEM USING THE FRAMEWORK OF SPIKING NEURAL P SYSTEMS WITH STRUCTURAL PLASTICITY", "item_type_id": "21", "owner": "1", "path": ["1582967549708"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000002037", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-03-05"}, "publish_date": "2020-03-05", "publish_status": "0", "recid": "2037", "relation": {}, "relation_version_is_last": true, "title": ["SOLUTION TO THE SUBSETSUMPROBLEM USING THE FRAMEWORK OF SPIKING NEURAL P SYSTEMS WITH STRUCTURAL PLASTICITY"], "weko_shared_id": -1}

SOLUTION TO THE SUBSETSUMPROBLEM USING THE FRAMEWORK OF SPIKING NEURAL P SYSTEMS WITH STRUCTURAL PLASTICITY

http://hdl.handle.net/20.500.12678/0000002037
689ba4ed-e1be-4eba-ae89-c820acbd3d68
fcaf2523-a96b-43f7-b645-527369f1ebd3
None
Name / File License Actions
Solution Solution to the Subset Sum problem using the Framework of Spiking Neural P Systems with structural plasticity.pdf (1108 Kb)
Publication type
Other
Upload type
Other
Title
Title SOLUTION TO THE SUBSETSUMPROBLEM USING THE FRAMEWORK OF SPIKING NEURAL P SYSTEMS WITH STRUCTURAL PLASTICITY
Language en
Publication date 2015
Authors
Cabarle, Francis George C.
Adorna, Henry N.
Description
Spiking neural P systems (in short, SNP systems) are parallel, distributed models of computations based on the structure and function of neural cells or neurons. Neurons process only a single type of signal or object known as the spike. The neurons are placed on vertices of a directed graph, where each edge in the graph is called a synapse. Information cannot be discerned from the spikes, as spikes are indistinct signals. Instead, information is obtained
from the time intervals between spikes, or the presence (absence) of spikes at certain time steps. Time therefore is a means to encode information, rather than simply being a background of the computations. It is known that SNP systems and their variants are Turing universal, i.e. they can simulate any Turing machine, and thus can carry out any effective computation that we know of.
Since the introduction of SNP systems in 2006 (see [3]), many theoretical and practical problems have been solved using SNP systems. See e.g. [4] and the SNP systems chapter in [5]. In this extended abstract we use the variant known as SNP systems with structural plasticity (in short, SNPSP systems). SNPSP systems were introduced in [6] to include the neuroscience feature of structural plasticity in the SNP systems framework. In SNPSP systems, plasticity rules allow neurons to create or delete synapses.
We use SNPSP systems in this work to provide a constant time, nondeterministic solution to the Subset sum problem. This problem is a well-known computationally hard problem with important use in cryptography. The hardness of the Subset sum problem is applied to practical use in order to secure many systems requiring encryption, see e.g. [1, 2]. Briefly, the Subset sum problem has as its inputs a set of natural numbers V = {vi, v2,..,. vn} and a
natural number S. The task is to find a subset B of V where the elements of B sum exactly to S, see e.g. [7].
An SNPSP system solving Subset sum is given in graphical form in Figure 1. Using plasticity rules (see Figure 1), we are able to reduce the number of neurons in our system by a linear amount (with respect to problem input size n) compared to the number of neurons in the SNP system given in [8].
Keywords
Spiking neural P systems
Identifier https://uyr.uy.edu.mm/handle/123456789/388
Journal articles
8th AUN/SEED-Net Regional Conference on Electrical and Electronics Engineering
Conference papaers
Books/reports/chapters
Thesis/dissertations
0
0
views
downloads
Views Downloads

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats