Paper/ Journal TitleAuthorsPublication TypeName of Conference/ JournalPublished YearPublished Month & DayField of ResearchName of DepartmentKeywordsAbstractdepartment_hfiltername_of_lab_hfilterpublication_type_hfilterpublisher_hfilterpublished_year_hfilterfield_of_research_hfilter
Investigation of Students’ Listening Comprehension via Pre-Listening TestWin Yu Yu Maung, Myint Myint Khaing, Thi Thi HanJulypre-listening, IELTS listening test, listening comprehension, students, teachers role.Download
Listening is an imperious language skill developed in second language learning. Despite its importance, the feeble skills of EFL students experiencing different types of deafness. The main purpose of this study is to investigate the impact of pre-listening activities on student understanding of IELTS listening comprehension. Based on this aim, forty students from the University of Computer Studies (Mandalay) were selected for the study to take part in a listening test. Participants were randomly divided into two groups: an experimental group and a control group, each group consisting of 20 members. The experimental group contacted and accepted the IELTS test listening advice, the other groups were untreated, but all underwent a hearing test. Expressed quantitative data analysis by comparing the IELTS test and the average scores of the two groups. The results of this work show that students who take part in the listening activities do better in the test and can answer correctly. Moreover, the students become motivated to English Language Learning.

 

languagemyanmarjournal2020literature-learning-and-teaching
Some Straightforward Strategies for Teaching Language Skills via Online LearningNay Chi Oo, Malar Myint Thaung , Chaw Su HlaingSeptemberonline learning, teaching, learning, language skills, strategiesDownload
Online learning is presently being utilized as a decent technique all over the world. In Myanmar, using online learning system in all computer universities is infrequent and irregular. When the WHO pronounced the corona virus epidemic as a pandemic, universities all over the world including computer universities in Myanmar have deferred. The outbreak of corona virus has constrained a huge number of institutions to move quickly from face to face educating to web-based teaching. Online learning is the most flexible and interesting way to gain knowledge. It creates a lot of interaction between students and teachers or their peer. The author aims to improve the language skills through online learning during the pandemic period in universities, especially in University of Computer Studies (Magway).

 

languageenglishjournal2020literature-learning-and-teaching
Study Skills Development for Academic WritingNay Chi Oo9th-10th Julystudy Skills, Academic Writing, Development, Abilities, ApproachesDownload
This research paper is intended to enhance the study skills for academic writing of the first year students of computer universities in Myanmar. The aim of this research paper is to improve the students’ study skills for academic writing and learning abilities. The area of study skills is so wide that some approaches for academic writing that will suit for the first year students are only provided in this research paper. If these approaches are relevant to their needs, they can have skills in their study and overcome difficulties they face in their learning. Therefore, students who develop study skills can have success in their academic writing. Study skills for academic writing will enable students to plan and organize their studies and will provide them with as tools as and techniques to manage the experiences that they face during their study at college or university. Thus, this research paper is hoped to be of some help foe teachers and students in study skills development for academic writing.

 

languageenglishconference2015english-language
Developing the Reading Skill of the First Year B.Tech. Students at the Technological University (Kyaukse)Mon Mon Zin21-22 OctoberDeveloping, Reading Skill, Techniques, Approaches, ProcessesDownload
This paper is concerned with developing the reading skill of the First Year B-Tech students of the Technological Uiversity, Kyaukse. Some of the problems for reading, teachers encounter are: students are becoming more and more dependent on the teachers while doing fewer and fewer activities in the classroom. Since English is used as a medium of teaching, reading techniques are needed for the students to study their respective subjects. There are some difficulties for students in applying to a foreign language. To improve the students’ abilities of reading some various effective approaches are quoted in this paper. This paper mentions clearly the importance of reading, the different reading processes, the approaches to reading by using four skills and integrated skills approach. These important factors of the reading skills help the students to develop students’ reading speed and to catch the general meaning of the message. This paper also helps the students make good use of their reading skill.

 

languageenglishconference2010english-language
A Comparison of Online and Traditional Tests: Reading Comprehension of the Students at the University of Computer Studies, PyayMya Sandar , Kyu Kyi Win, Chaw Su HlaingMayonline, paper-based reading, pros, cons, comprehension, exactness, perspectiveDownload
This research intends to decide the fondness of Intermediate Students in performing Personal Computer and paper-based reading assignments, and to what extent PC and paper-based reading impact on their understanding rate, exactness and comprehension. The test was carried on at the University of Computer Science and Computer Technology. Two kinds of information were gathered in this research. First, the Questionnaires for Online Reading Comprehension were used to collect information about the members’ perspectives on their PC and paper-based reading exercises. Second, one test was conducted with 12 chipping subjects to comprehend their understanding rate, exactness and comprehension in both PC and paper-based reading tests. The consequences of the research proposed that almost all students preferred paper-based reading to PC reading. Moreover, the study shows that reading speed on the PC was almost 12% quicker than paper-based reading for these students.
languageenglishjournal2020literature-learning-and-teaching
The Importance of Learning Collocations in English Language Learning through Practical ActivitiesThaung Thaung New , Yin Yin Aye , Chaw Su HlaingJuneLearning collocations; Vocabulary development; Strategies; Language learningDownload
This research paper is about the importance of learning collocations in English language learning of the first-year students at the Computer University, Kalay. The aim is to develop students’ vocabulary skills and to share knowledge about the use of complex and difficult to learn. Effective uses of collocations make learners interested in fluency and meaningful depiction of literary texts. Knowledge of collocations is important for the students to take the responsibilities for their own learning and to use the acquired learning collocation strategies to tackle the various kinds of texts. Some various effective techniques are mentioned to improve the students’ abilities of vocabulary development. Through needs analysis survey, needs, lack, wants, and attitudes of various students and teachers can be found out. Hopefully, this paper can give some insights into the difficulties in learning collocations faced by students and teachers.
languageenglishjournal2020language-education
A Study on Students’ Perceptions of their Experiences in Making Oral PresentationPale Mon , Chaw Su Hlaing, Phyo Ei ThuMayperception, experiences, difficulties, oral presentationDownload
The study is concerned with students’ perceptions of their experiences in making oral presentation test at the University of Computer Studies, Thaton (UCST). The research aims to examine students’ attitudes towards making oral presentations by identifying benefits obtained and the challenges faced regarding the three perspectives: personal traits, deficiency in presentation skills, and apprehension of peers and teacher. The participants of the study were 85 fifth-year students from three sections and six teachers. A four-point Likert Scale questionnaire composed with 35 items and semi-structured interview were carried out to collect the data for analysis. The results obtained were described in percentages. The findings showed that students experienced a medium level of difficulties in conducting oral presentation. Analysis of qualitative data indicated students’ challenges such as stress and lack of practice in oral presentation skills. This study recommends that students need more exposure and experience of presentation skills in university.
languageenglishjournal2020literature-learning-and-teaching
Learning Strategies for Vocabulary: A Vital Element of Language LearningChaw Su Hlaing, Mya Sandar, Pale MonJunevocabulary, definition of vocabulary, strategies, vocabulary developmentDownload
The importance of developing vocabulary learning skills is the most essential skill for foreign language learners. Language is sequential _ speech is sequence of sounds whereas writing is a sequence of symbols. To produce an honest piece of writing, learners need to enrich their vocabularies. Therefore, it is needed, especially for language learners, to focus on the vocabulary and effective strategies. Through using a wide range of vocabulary and strategies, learners are able to develop their vocabulary and to produce a good piece of writing. Vocabulary knowledge is additionally one component of language skills, like reading and speaking. To be able to know and cope with a wide range of vocabulary, it is necessary for learners to know effective strategies for learning vocabulary.

 

languageenglishjournal2020language-education
Research and development of the stabilization of a closed-loop stepper motor control systemSoe Lin Aung--Download

ucsmgyinternational-journal2006information-security
Analyzing speed characteristics of a closed-loop stepper motor control systemSoe Lin Aung--Download

ucsmgyinternational-journal2006information-security
Design and implementation of the stepper motor devices in MatlabSoe Lin Aung--Download

ucsmgyinternational-paper2006information-security
Off-line Signature Verification using thresholding TechniqueHtight Htight Wai, Soe Lin Aung--Download

ucsmgyinternational-journal2014information-security
Perceptual Grouping with Region Merging for Automatic Image SegmentationTin Tin Htar, Soe Lin Aung--Download

ucsmgyinternational-journal2014information-security
Enhancement of region merging algorithm for image segmentationTin Tin Htar, Soe Lin Aung--Download

ucsmgyinternational-paper2014information-security
Feature Extraction for off-line Signature VerificationHtight Htight Wai, Soe Lin Aung--Download

ucsmgyinternational-journal2013information-security
Offline signature verification system using neural networkHtight Htight Wai, Soe Lin Aung--Download

ucsmgyinternational-paper2014information-security
Automatic image segmentation using marker-controlled watershed transform and region mergionTin Tin Htar, Soe Lin Aung--Download

ucsmgyinternational-paper2013information-security
Image Segmentation based on Region MergingTin Tin Htar ,Soe Lin Aung--Download

ucsmgyinternational-journal2013information-security
Meaningful region merging approach in image segmentationTin Tin Htar, Soe Lin Aung--Download

ucsmgyinternational-paper2013information-security
Offline signature verification systemHtight Htight Wai, Soe Lin Aung--Download

ucsmgyinternational-paper2013information-security
Automatic Closed-loop stepper motor control system with Intra Step-by-step discrete correction of speedsoe lin aung, Dubovoi N.D.,Demkin V.I--Download

ucsmgyinternational-journal2008information-security
Controlling the speed ratio of a closed-loop control system with two stepper motorssoe lin aung, Dubovoi N.D., Demkin V.I--Download

ucsmgyinternational-journal2007information-security
Designing Graphical User Interface for automatic control systems with stepper motorsSoe Lin Aung--Download

ucsmgyinternational-paper2008information-security
Research and Development of the stabilization of the speed of closed -loop stepper motors control systemwith intra-step- by-step correctionof speed algorithmSoe Lin Aung--Download

ucsmgyinternational-paper2007information-security
Research and Development of the ratio of the speeds of two closed- loop stepper motorsSoe Lin Aung--Download

ucsmgyinternational-paper2007information-security
Using factorial experiment for analyzing the speed stabilization closed-loop stepper motorSoe Lin Aung--Download

ucsmgyinternational-paper2007information-security
Research and development of closed-loop stepper motor control system in different types of switchingSoe Lin Aung--Download

ucsmgyinternational-paper2006information-security
Controlling the speed of stepper motor in non-contact direct current modeSoe Lin Aung--Download

ucsmgyinternational-paper2006information-security
Research and Development of Automatic Control Systems using Electronics Workbench and MatlabSoe Lin Aung--Download

ucsmgyinternational-paper2005information-security
Structure Analysis of 31S (ISSN-2707-0565)Myint Myint Than, Thida kyaw, Aye Aye MinMaysingle-particle energy levels, Numerov method, spin-orbit interaction, Woods-Saxon potentialDownload

The neutron single-particle energy levels and the root-mean-square radii of 31S have been studied theoretically in the framework of shell model approach. The one-body Schrödinger equation is solved by using Numerov method as a numerical calculation. The phenomenological Woods-Saxon central potential is applied in this research work. The spin-orbit interaction is also taken into account in this calculation.  By using Woods-Saxon central potential including spin-orbit interaction, the calculated shell structure is 1s1/2, 1p3/2, 1p1/2, 1d5/2, 2s1/2, 1d3/2, 1f7/2 and 2p3/2. The binding energies of neutron single-particle in 31S are 36.7 MeV, 26.2 MeV, 23.5 MeV, 14.7 MeV, 10.5 MeV, 9.4 MeV, 3.0 MeV and 0.5 MeV for each states respectively. The root-mean-square radius of 31S is found to be 3.8 fm. In addition, the physical quantities such as kinetic energies, potential energies and centrifugal potential energies have also been investigated.

nsuniversity-journal-paper2020hypernuclear-physics
Analysis of Cascade Hypernuclear Production from 16O(K-,K+) Ξ 16C ReactionSu Mon Kyaw, Aye Aye Min, Khin Swe MyintDecemberHypernucleus, Harmonic oscillator wavefunction, Woods-Saxon potentialDownload

Abstract

The formation probability of Ξˉ-hypernuclei,  from  reaction on the target16O by applying the plane wave impulse approximation has been investigated in this work.  In the calculation of hypernuclear production process, Woods-Saxon form for strong interaction and coulomb interaction are used. In addition, we apply the incident kaon momentum 1.65 GeV/c and also use the interaction strength of strong  Ξ-hypernucleus as -8.5 MeV which is deduced from the experimental binding energy of system from KISO event which was reported by Nakazawa et al[1].

 

Index Terms – Hypernucleus, Harmonic oscillator wavefunction, Woods-Saxon potential

nsuniversity-journalof-engineering-science-and-technology2019hypernuclear-physics
Structure Calculation of Neutron-Rich Hypernucleus Λ 7Hewith Brueckner Hartree-Fock MethodThiri Yadanar Htun, Theingi, Aye Aye Min, Khin Swe MyintDecemberneutron-rich hypernucleus, Brueckner Hartree-Fock method and Λ N-N mixingDownload

We perform the structure calculation of the neutron-rich hypernuclues within the Brueckner Hartree-Fock framework and study the effect of Λ N-SN coupling. The effective YN interactions are firstly computed by the Bethe-Goldstone equation with the use of Shinmura’s hyperon-nucleon (YN) interactions namely D0, D2 and NSC97f(s). In addition, Hartree-Fock hyperon-nucleus interactions are constructed by folding the effective YN interaction with single particles oscillator wavefunctions of core nucleus. As a result, Λ -binding energy using NSC97f model is generally agree with experimental data from all of models. No significant effect of the Λ N-SN coupling is found in p-shell hypernucleus .

 

nsmandalay-university-research-journal2019hypernuclear-physics
Binding Mechanism of Ξ208- Pb (ISSN 2520-0186)Nay Wah Aung, Aye Aye Min, Khin Swe MyintNovembershell model approach, Woods-Saxon potential, Ξ- -nuclear and Ξ- -atomic statesDownload

In this research work, the binding energy of 208 Ξ Pb have been evaluated within the frame work of Ξ single-particle model by solving nonrelativistic Schrödinger equation. The Gaussian wave function and phenomenological Woods-Saxon potential are applied in this calculation. For Woods-Saxon prescription, the interaction strength -8.5 MeV and the diffuseness parameter    0.65 fm which could give KISO event’s experimental datas, are used. The bound state energies of  Ξ  in each shell of 208 Ξ Pb   have been calculated by using the Power Inverse Iteration Method.  1s and 2s having 30.411 MeV and 21.738 MeV state are Coulomb-assisted nuclear Ξ  -bound states called hybrid states while the other states are Ξ  – atomic states.

 

nsproceeding-of-international-conference2018hypernuclear-physics
Relation between Effective Λ - Λ Interaction in Double- Λ Hypernuclei and Hyperon Superfluidity in Neutron Star ( ISSN 2520-0186)Su Mon Kyaw, Aye Aye Min, Khin Swe Myint,Y. AkaishiNovemberneutron-rich double - Λ hypernuclei, effective Λ - Λ interaction, superfluidity of Λ-hyperon in neutron starDownload

In this research work, neutron-rich double-Λ hypernuclei namely , ΛΛ6He, ΛΛ6He,ΛΛ6He  will be theoretically investigated to determine effective Λ-Λ interaction in double-Λ hypernuclei which is closely related to hyperon superfluidity in neutron star.  We will treat a double-Λ hypernucleus as a three-body system which is composed of two lambdas and a core nucleus.  In our three-body calculation, three rearrangement coupled channel Gaussian basis treatment of Kamimura will be applied.  One-boson exchange Nijmegen potential model baryon-baryon interaction will be used for our Λ-Λ and Λ-nucleons interactions.  In this calculation, the Pauli suppression effect and alpha formation effect will be taken into account when the coupled channel is considered.  We will also study the superfluidity of Λ hyperon in neutron star matter by solving the gap equation.

nsproceeding-of-international-conference2018hypernuclear-physics
Study on Ξ- hypernuclear Production Spectrum of 12C(K-,K+)Ξ- 12Be and 208Pb(K-,K+)Ξ- 208Hg (ISSN 2520-0186)Su Mon Kyaw, Aye Aye Min, Khin Swe MyintNovemberGreen function method, Woods-Saxon interaction, hypernuclear productionDownload

We have theoretically determined the formation probability of Ξ-  hypernucleus,  and  from  reaction on targets 12C and 208Pb respectively by employing Green function method.  For  Ξ- –nucleus interaction, we have taken into consideration both Woods-Saxon for strong interaction and coulomb interaction.  We use the interaction strength of strong Ξ-hypernucleus as -8.5 MeV which is deduced from the experimental binding energy of Ξ- –14N system from KISO event which was reported by Nakazawa et al [1].  It is shallower than that of potential previously used by Tadokoro et al [2].

 

[1]     K. Nakazawa, et al., Prog. Theor. Exp. Phys. (2015) 033D02.

[2]     S. Tadokoro, H. Kobayashi and Y. Akaishi, Nucl. Phys. A 585 (1995) 225c-228c

nsproceeding-of-international-conference2018hypernuclear-physics
Coherent Λ -S Coupling in Lithium Drip-Line Region ( ISSN 2520-0186)Kyi Pyar Htun, Aye Aye Min, Khin Swe MyintNovemberneutron rich Λ -hypernuclei, effective hyperon-nucleon interaction, Λ N-N coupling effectDownload

In this research work, the structure of neutron rich Λ  -hypernuclei,  are investigated by employing the Brueckner-Hartree-Fock method. The effective hyperon-nucleon interactions in nuclear medium have been formulated and determined by solving the Bethe-Goldstone equation. Shinmura’s free space hyperon-nucleon interactions which are phase equivalent local potentials of Nijmegen model D0, D2 and NSC97f are used in this calculation. The Λ  -nucleus Hartree-Fock potential is constructed by folding the effective Λ  -N interaction with the single-particle wave functions of corresponding core nucleus. The obtained Hartree-Fock hyperon-core nucleus interaction is transformed into equivalent local potential. Before going to study neutron-rich  isotopes, the average spin-isospin weight of Y-N interactions in , , , , and states are computed. Then, the coupled channel Schrödinger equation including Λ  and S channels is solved to understand the binding mechanism and Λ  N-SN coupling effect in neutron rich Λ  -hypernuclei, .

nsproceeding-of-international-conference2018hypernuclear-physics
Double-Λ hypernuclei observed in a hybrid emulsion experiment (DOI: 10.1103/PhysRevC.88.014003)ΛJ.K. Ahn, H. Akikawa, …,A.A. Min, …, K. Nakazawa et al.July-Download

A hybrid experiment with nuclear emulsion and scintillating-fiber detectors (KEK-E373) has been performed to search for double-strangeness systems. Among about 103 events of X- hyperons captured at rest by emulsion nuclei, we have observed four events which clearly show the topology of cascade weak decays of double-Λ hypernuclei including the “Nagara” event. Regarding the Nagara event, values of the two-L binding energy (BΛ Λ ) and the Λ -Λ interaction energy (DBΛ Λ ) of

Λ Λ 6He have been revised to 6.91±0.16 and 0.67±0.17 MeV, respectively, due to the recent change of the Ξ-   mass value (Particle Data Group). For another three events, we have determined possible species of double-Λ hypernuclei together with their binding energies.

DOI: 10.1103/PhysRevC.88.014003 PACS number(s): 21.80.+a, 21.10.Dr, 25.80.Pw, 27.20.+n

nsinternational-journal-paper2013hypernuclear-physics
Nucleon Single-Particle Energy Levels In 51Fe And 51Mn Mirror NucleiAye Aye Min, Nang Khaing Saw Aung and Khin Swe MyintJulymirror nuclei, single-particle energy levels, Numerov methodDownload

In this paper, both the neutron and proton single-particle energy levels of A=51 mirror nuclei, 51Fe and 51Mn have been investigated by solving non-relativistic Schrödinger equation within the framework of Numerov method. In this calculation, phenomenological Woods-Saxon potential with spin-orbit interaction has been applied. Coulomb interaction is also taken into account for proton single-particle model approach. We also found that proton single-particle energy levels are higher than the neutron single-particle energy levels due to the effect of Coulomb repulsion. Moreover, there is some energy discrepancy between 51Fe and 51Mn mirror nuclei for proton single-particle model. This is due to the fact that the number of protons and neutrons are interchanged in the mirror nuclei. Moreover, the total root-mean-square radii of these mirror nuclei have also been investigated and the calculated values are found to be 3.57 fm for 51Fe and 3.56 fm for 51Mn respectively. We also observed the peculiar behavior in the relation between the binding energies and root-mean-square radii. Furthermore, the one nucleon and two nucleons separation energies have been investigated.

nsjournal-ofthe-myanmar-academy-of-arts-and-science2020nuclear-physics
Structure Analysis of Ξ-12 BeAye Aye Min, Nay Wah Aung and Khin Swe MyintAugustmirror nuclei, single-particle energy levels, Numerov methodDownload

The binding mechanism of strangeness hypernucleus,Ξ-12 Be , have been investigated within the frame work of  single-particle model by solving the nonrelativistic Schrödinger equation. The Gaussian basis wave function and phenomenological Woods-Saxon central potential including coulomb interaction are applied in this calculation. For Woods-Saxon prescription, the interaction strength -8.5 MeV and the diffuseness parameter 0.65 fm which could give the experimental binding energy 4.38±0.25 MeV of –14N observed from KISO event of E373 experiment are used. The calculated bound state energy of  is     2.99 MeV and it is in good agreement with the other results; 3.1 MeV and 3.3 MeV calculated by Matsumiya with the use of Ehime potential and   NHC-D potential model. According to this calculation, only 1S state is Coulomb-assisted nuclear bound state called hybrid state and the other states are – atomic states. The behavior of wave function for various bound states are also studied. Moreover, the root-mean-square radii of  are also calculated for various bound states. The root-mean-square radii of -nuclear and -atomic states of –11B are 3.39 fm and 34.98 fm respectively.

 

 

nsuniversities-research-journal2019hypernuclear-physics
Resonant States of Mirror Nuclei 5He and 5Li with Complex Scaling Method (ISSN 2520-0186)Aye Aye Min, Wei Mar Myo, Khin Swe MyintDecembercomplex scaling method, mirror nuclei, resonant states, spin-orbit interaction, two-body Schrödinger equationDownload

In this present work, the resonant states of A=5 mirror nuclei, namely 5He and 5Li have been investigated within the frame work of two-body cluster model by applying complex rotation method. The nuclei 5He and 5Li were assumed as alpha-nucleon (a-N) two-body cluster system. In this calculation, the Gaussian basis wave function and the parity-dependent Kanada potential which contains the central term and spin-orbit interaction term have been employed for a-N system. In addition, coulomb interaction is also taken into account for the investigation of 5Li system. The calculated resonance energy and level width for 5He (3/2) ground state are (0.747, 0.598) MeV and that for 5He (1/2) first excited state are (2.150, 5.522) MeV respectively. For the 5Li case, the energies and level widths are found to be (1.64, 1.24) MeV for 3/2 state and (3.05, 6.84) MeV for 1/2 state. Our calculated energy values and level widths for 5He and 5Li are compared with the other theoretical results and experimental results. The calculated results are in consistent with the other results and experimental values.

nsproceeding-of-international-conference2018nuclear-physics
Production of LL5H by Stopping Ξ- on 7Li Target (ISSN 2520-0186)Aye Aye Min, Khin Swe Myint, Y. AkaishiDecembertwo-body cluster model, plane wave impulse approximation, hypernucleusDownload

In this research work, we propose theoretically a feasible reaction for the production of  via stopped  Ξ-reaction on target 7Li. The target 7Li will be considered as a two-body triton-alpha (t-a) cluster model. The Ξ- hyperon strongly interacts with one of the protons from the alpha cluster to produce two L-hyperons based on elementary process;Ξ-+p . In this calculation, the formation of  from atomic orbitals 2S, 2P and 3D of Ξ- -7Li  atom will be investigated by using plane wave impulse approximation method.  The results from reaction have also been compared that by using  reaction.

 

nsproceeding-of-international-conference2018hypernuclear-physics
Λ Single-particle Energy Levels in , Λ 13C, Λ 14C and Λ 15CAye Aye Min , Chit Oo and Khin Swe MyintOctobereffective Λ-nucleon interaction, Woods-Saxon potential, Λ single-particle energy, Λ-hypernucleiDownload

In this research work, the single-particle energy levels of Λ-hypernuclear carbon isotopes, namely , and  was investigated. The folding Λ-nucleus potential based on effective Λ-nucleon interaction which is constructed by Akaishi is used. The calculated binding energies of and by applying folding Λ-nucleus potential are two times larger than the experimental results. In the folding process, only Hartree potential called direct term is considered but Fock term which can give the repulsive effect is neglected. The correction term  of spin and charge dependence of the effective Λ-N interaction is not taken into account. In addition, we assume that the proton density distribution and neutron density distribution are the same. Moreover, the  single-particle energy levels of these hypernuclei have also been calculated by using Woods-Saxon potential including spin-orbit interaction. In this calculation, Λsingle particle energy levels of s-state and p-state are         -11.57 MeV, -1.32 MeV for , -12.10 MeV, -1.81 MeV for  respectively. The Λ single-particle energy levels of s-state for  and  are in good agreement with the experimental and theoretical results. The Λsingle-particle energy levels of are estimated to be                   -12.59 MeV for s-state and -2.29 MeV for p-state.

nsjournal-ofthe-myanmar-academy-of-arts-and-science2018hypernuclear-physics
Structure Analysis of Light Ξ- HypernucleiAye Aye Min , Phyo Wei Wei Lwin and Khin Swe Myint, , Februaryllight Ξ- hypernuclei, single-particle model, Gaussian basis wave function, bound State energy, Woods-Saxon potentialDownload

In this research work, the binding energies of  Ξ- in light nuclei namely  Ξ- –12C,Ξ- –14N and Ξ- –16O have been calculated within the frame work of  Ξ- single-particle model by solving nonrelativistic Schrödinger equation.  In this calculation, the Gaussian basis wave function and phenomenological Woods-Saxon central potential including coulomb interaction are used.  By using the commonly accepted strength of Woods-Saxon potential -14.0 MeV, the calculated bound state energy of Ξ- –14N is 3.07 MeV over binding than the recent experimental results, 4.38+- 0.25 MeV which is observed from E373 experiment, KEK, Japan.  Therefore, the binding energies of Ξ- –14N have been investigated by varying potential strength with the fitted range parameter.  At the potential depth -8.5 MeV, the calculated binding energy of  Ξ- –14N is in good agreement with the experimental result.  Therefore, this potential strength is applied to study the structure analysis of other two light Ξ- hypernuclei.  In addition, the root-mean-square radii of these light  Ξ- hypernuclei have also been investigated.

nsmyanmar pathein the-third-myanmar-japan-symposium2017hypernuclear-physics
Single-Particle Energy Levels of Neutron-Rich Potassium IsotopesAye Aye Min , Zin Mar Htay and Khin Swe MyintDecemberneutron-rich isotopes, spin-orbit interaction, neutron separation energiesDownload

In this research work, the single-particle energy level of neutron-rich potassium isotopes such as               and  have been investigated.  In this calculation, we assumed that a single neutron was moving in a potential well which results from the interaction between the neutron and the remaining nucleons.  One-body Schrödinger equation was solved by using Gaussian basis wave function and phenomenological Woods-Saxon potential including the spin-orbit interaction.  In addition, we have also calculated root-mean-square radii and the last neutron separation energies of potassium isotopes.

 

 

nsmandalay-university-research-journal2015nuclear-physics
Single-particle Energy Levels of 34Si, 35P and 36SAye Aye Min,Aye Moh Moh Theint , Khin Swe MyintFebruarysingle-particle energy level, neutron-rich nuclei, diffuseness parameter, Woods-Saxon potential, neutron starsDownload

The single-particle energy levels of neutron-rich isotones, 34Si, 35P and 36S have been investigated within the framework of shell model calculation.  The Gaussian basis wave function and phenomenological Woods-Saxon central potential including spin-orbit interaction are used.  For central term, two types of parameter set namely set. 1 and set. 2 are applied.  In set. 1, the potential strength and diffuseness parameter are   50 MeV and 0.53 fm.  In set. 2, potential depth depends on the neutron excess effect and diffuseness parameter a=0.67 fm are used.  The value of r0, 1.25 fm and 1.27 fm are used for set.1 and set.2.  In addition, the last neutron separation energies and root-mean square radii of these neutron-rich isotones are also investigated.

nsuniversities-research-journal2015nuclear-physics
Theoretical Investigation into Production of Double-Λ Hypernuclei from Stopped Ξ− on 6Li ( DOI 10.1007/s00601-012-0395-1)Aye Aye Min , Khin Swe Myint ,J. Esmaili , Y. AkaishiMarch-Download

We have investigated theoretically a feasible nuclear reaction to produce light double-Λ hypernuclei by choosing a suitable target. In the reaction from stopped Ξ− on 6Li target light doubly-strange nuclei, 5ΛΛH and 6ΛΛHe, are produced: we have calculated the formation ratio of 5ΛΛH to 6ΛΛHe for Ξ− absorptions from 2S, 2P and 3D orbitals of Ξ−–6Li atom by assuming a d-α cluster model for 6Li. From this cluster model the d-α relative wave functions has a node due to Pauli exclusion among nucleons belonging to d and α clusters. Two kinds of d-α wave functions, namely 1s relative wave function with a phenomenological one-range Gaussian (ORG) potential and that of an orthogonality-condition model (OCM) are used. It is found that the probability of 5ΛΛH formation is larger than that of 6ΛΛHe for all absorption orbitals: in the case of the major 3D absorption their ratio is 1.08 for ORG and 1.96 for OCM. The dominant low momentum component of the d-α relative wave function favors the 5ΛΛH formation with a low Q value compared to the 6ΛΛHe formation with a high Q value. We have also calculated momentum distributions of emitted particles, d and n, displaying continuum spectra for single-Λ hypernuclei, 4ΛH and 5ΛHe, and line spectra for the 5ΛΛH and 6ΛΛHe nuclei. Thus, our present theoretical analysis would be a significant contribution to experiments in the strangeness -2 sector of hypernuclear physics.

nsinternational-journal-paper2013hypernuclear-physics
‌ဗေဒါလမ်းကဗျာမှ ဘဝအားမာန်Thein Zaw Win, War War Soe, Htay Htay AungSeptemberအားမာန်၊ ခေတ်စမ်း၊ ဗေဒါ၊ ဒီ၊ ကျူ။Download

ဤစာတမ်းသည် ဆရာဇော်ဂျီ၏ ကဗျာပေါင်းချုပ်ကို အလေ့လာခံနယ်အဖြစ် သတ်မှတ်၍
(၁၉၆၀)ပြည့်နှစ် တက္ကသိုလ်အိုးဝေမဂ္ဂဇင်းတွင် ရေးသားခဲ့သော ဗေဒါလမ်းကဗျာ(၃)ပုဒ်မှ ဘဝ
အားမာန်ကို လေ့လာတင်ပြထားခြင်း ဖြစ်သည်။ ဗေဒါလမ်းကဗျာ(၃)ပုဒ်ပါ ဗေဒါပင်လေး၏ ရေယဉ်
ခရီးတွင် တွေ့ကြုံရသော အခက်အခဲ ပြဿနာများကို ဘဝခရီးတွင် လူသား ကြုံတွေ့ရသော အခက်
အခဲ ပြဿနာများအဖြစ် မြင်ယောင်စေပြီး ဗေဒါပင်ကလေးကဲ့သို့ ဘဝအမောများကို ဖြေတတ်၊
ပြေတတ်စေလိုခြင်း ဖြစ်သည်။ ဤစာတမ်းသည် ဗေဒါလမ်းကဗျာမှ ဘဝအားမာန်ကို အနက်အဓိပ္ပာယ်ရှုထောင့်မှ လေ့လာတင်ပြထားခြင်း ဖြစ်ပြီး ဆရာဇော်ဂျီ၏ ဗေဒါလမ်းကဗျာများ
ကို လေ့လာလိုသူများအတွက် တစ်စိတ်တစ်ဒေသ အထောက်အကူပြုနိုင်မည် ဖြစ်သည်။

languagemyanmarlocal-journal2020literature-poem
ခင်ခင်ထူး၏ 'ကျေးတစ်ရာ ရသစာစု များ'မှ ထိန်းသိမ်းအပ်သော မြန်မာ့ယဉ်ကျေးမှုများWar War Soe, Htay Htay Aung, Thein Zaw WinJulyရိုးရာ၊ ဓလေ့၊ ရသ၊ ယဉ်ကျေးမှု၊ ပွဲတော်။Download

ဤစာတမ်းသည် မြန်မာ့ရိုးရာ ယဉ်ကျေးမှု အမွေအနှစ်များ ထိန်းသိမ်း စောင့်ရှောက်သင့်ကြောင်း
ဖော်ပြလိုသော စာတမ်း ဖြစ်သည်။ မြန်မာ့မြေတွင်ကြီး၊ မြန်မာ့ရေသောက်ပြီး မြန်မာ့ရိုးရာယဉ်ကျေး
မှုကို မထိန်းသိမ်းနိုင်လျှင် စာပေနှင့် ယဉ်ကျေးမှုပျောက်၍ လူမျိုးပျောက်ကာ တိုင်းပြည်ပျောက်ရ
မည့် အဖြစ်ကို မရောက်လို၍ မိမိတို့ ယဉ်ကျေးမှုကို မြတ်နိုးလာစေရန် တင်ပြထားသည့် စာတမ်း
ဖြစ်သည်။ ယနေ့ခေတ်လူငယ်များအနေဖြင့် နည်းပညာပိုင်း ဖွံဖြိုးတိုးတတ်လာသော်လည်း ရသစာ
ပေကို ချစ်ခင်မှု အားနည်းလာကြသည်။ ထို့ကြောင့် ကိုယ့်နိုင်ငံ၊ ကိုယ့်လူမျိုး၊ ကိုယ်စာပေ၊ ကိုယ့်ယဉ်
ကျေးမှုကို အမြတ်တနိုး တန်ဖိုးထားတတ်စေရန် ရည်ရွယ်ပါသည်။

languagemyanmarlocal-journal2020literature-culture
ခင်ခင်ထူး၏ ဖက်စိမ်းကွမ်းတောင် ရွှေဝတ္ထုတိုများအနက် ခရီးဖော်ဝတ္ထုတို လေ့လာချက်Thein Zaw Win, War War Soe, Htay Htay AungJuneရည်ရွယ်ချက်၊ ဇာတ်လမ်း၊ ဇာတ်ဆောင်၊ နောက်ခံဝန်းကျင်။Download

ဤစာတမ်းသည် ခင်ခင်ထူး၏ ဖက်စိမ်းကွမ်းတောင် ရွှေဝတ္ထုတိုများအနက် ‘ခရီးဖော်’ဝတ္ထုကို
အလေ့လာခံနယ်အဖြစ် သတ်မှတ်၍ ဝတ္ထုတို အင်္ဂါရပ်များ ဖြစ်သော ရည်ရွယ်ချက်၊ ဇာတ်လမ်း၊
ဇာတ်ဆောင်၊ နောက်ခံဝန်းကျင်အဖွဲ့များဖြင့် ဝေဖန်သုံးသပ် တင်ပြထားပါသည်။

languagemyanmarlocal-journal2020literature-novel
Performance Analysis of a QAPF Scheduling Scheme in LTE NetworkZin Mar Myo, Zar Lwin Phyo, Aye Thida Win, DecemberLTE, Multimedia Services, OFDMA, QAPF, TDMADownload

Long Term Evolution (LTE) is a cellular network that operates completely in packet domain. It can also support multimedia services. Due to this nature, provisioning the Quality of Service (QoS) requirements has become a challenge to the design of scheduler. Especially, the scheduler must guarantee for transmitting the real-time traffics such as VoIP (voice over IP). In this paper, a scheduler that satisfies the different QoS requirements is presented. This scheduler considers the additional QoS consideration to the Proportional Fair (PF), which is a well-known scheduling algorithm. As the core work of this paper, its performance is evaluated by comparing with the existing well-known schedulers. For non-real-time traffics such as file download, the performance of the scheduling scheme is evaluated by comparing with PF scheduler. For real-time traffics such as video live streaming, its performance is compared with Frame Level Scheduler (FLS).

fcsonline-publication proceeding-book2019mobile-network-computing
မြန်မာကဗျာနှင့် သင်္ကေတအဖွဲ့War War Soe, Htay Htay Aung, Thein Zaw WinJuneကဗျာ၊ သင်္ကေတ၊ ရသ၊ ဖန်တီးသူ၊ ခံစားမှု။Download

ဤစာတမ်းသည် မြန်မာကဗျာများတွင် တွေ့ရသော သင်္ကေတအဖွဲ့ ထင်ဟပ်နေသည့် ကဗျာများကို
လေ့လာတင်ပြထားသော စာတမ်း ဖြစ်ပါသည်။ ရသစာပေအဖွဲ့ဖြစ်သော ကဗျာသည် စာရေးသူ၏ အ
တွေ့အကြုံမှ တစ်ဆင့် ပေါက်ဖွားလာသော အဖွဲ့အနွဲ့များ ဖြစ်သည်။ ထိုသို့ ဖွဲ့နွဲ့ထားသော ကဗျာများ
တွင် မိမိကဗျာကို ပိုမို အားကောင်းလာစေရန် သင်္ကေတအဖွဲ့များဖြင့် ဖန်တီးရေးဖွဲ့ခဲ့ကြပုံကို သိရှိ
စေလိုခြင်း ဖြစ်သည်။ လေ့လာတင်ပြရာတွင် ကဗျာ၊ သင်္ကေတ၊ မြန်မာကဗျာနှင့်သင်္ကေတဟူ၍
အပိုင်း(၃)ပိုင်းခွဲကာ လေ့လာပါမည်။

languagemyanmarlocal-journal2020literature-poem
Replacing Same Meaning in Sentences Using Natural Language UnderstandigTin Htar Nwe , Zar Lwin Phyo, Zin Mar Myo, Aye Thida WinAugustNLP, A chunk based syntax analyzer, Matching technique, Intelligence methodsDownload

NLP (Natural Language Processing) can be used to communicate with computers by means of intelligence methods in a natural language. In other words, it is very useful for classification and analysis. Although there are many natural language syntax analyzers that existed before, it still remains to fulfill the requirements for analyzing English text for English to English Machine Translation. In this paper, we have proposed a chunk-based analyzer for English to English Machine Translation System. The keyword search Technique is one of the techniques of Natural Language Understanding. A simple keyword based matching technique is used for classification. Domainspecific dictionaries of keywords are used to reduce the dimensionality of feature space. The output result is that the word matched to a known word will be replaced in the given sentence, which will not be changed the original meaning.

fcsonline-publication2019natural-language-processing
ခင်ခင်ထူး၏ 'ကျေးတစ်ရာ ရသစာစု များ'မှ ထိန်းသိမ်းအပ်သော မြန်မာ့ယဉ်ကျေးမှုများWar War Soe, Htay Htay Aung, Thein Zaw WinJulyရိုးရာ၊ ဓလေ့၊ ရသ၊ ယဉ်ကျေးမှု၊ ပွဲတော်။Download

ဤစာတမ်းသည် မြန်မာ့ရိုးရာ ယဉ်ကျေးမှု အမွေအနှစ်များ ထိန်းသိမ်း စောင့်ရှောက်သင့်ကြောင်း
ဖော်ပြလိုသော စာတမ်း ဖြစ်သည်။ မြန်မာ့မြေတွင်ကြီး၊ မြန်မာ့ရေသောက်ပြီး မြန်မာ့ရိုးရာယဉ်ကျေး
မှုကို မထိန်းသိမ်းနိုင်လျှင် စာပေနှင့် ယဉ်ကျေးမှုပျောက်၍ လူမျိုးပျောက်ကာ တိုင်းပြည်ပျောက်ရ
မည့် အဖြစ်ကို မရောက်လို၍ မိမိတို့ ယဉ်ကျေးမှုကို မြတ်နိုးလာစေရန် တင်ပြထားသည့် စာတမ်း
ဖြစ်သည်။ ယနေ့ခေတ်လူငယ်များအနေဖြင့် နည်းပညာပိုင်း ဖွံဖြိုးတိုးတတ်လာသော်လည်း ရသစာ
ပေကို ချစ်ခင်မှု အားနည်းလာကြသည်။ ထို့ကြောင့် ကိုယ့်နိုင်ငံ၊ ကိုယ့်လူမျိုး၊ ကိုယ်စာပေ၊ ကိုယ့်ယဉ်
ကျေးမှုကို အမြတ်တနိုး တန်ဖိုးထားတတ်စေရန် ရည်ရွယ်ပါသည်။

languagemyanmarlocal-journal2020literature-culture
မြန်မာကဗျာနှင့် သင်္ကေတအဖွဲ့War War Soe, Htay Htay Aung, Thein Zaw WinJuneကဗျာ၊ သင်္ကေတ၊ ရသ၊ ဖန်တီးသူ၊ ခံစားမှု။Download

ဤစာတမ်းသည် မြန်မာကဗျာများတွင် တွေ့ရသော သင်္ကေတအဖွဲ့ ထင်ဟပ်နေသည့် ကဗျာများကို
လေ့လာတင်ပြထားသော စာတမ်း ဖြစ်ပါသည်။ ရသစာပေအဖွဲ့ဖြစ်သော ကဗျာသည် စာရေးသူ၏ အ
တွေ့အကြုံမှ တစ်ဆင့် ပေါက်ဖွားလာသော အဖွဲ့အနွဲ့များ ဖြစ်သည်။ ထိုသို့ ဖွဲ့နွဲ့ထားသော ကဗျာများ
တွင် မိမိကဗျာကို ပိုမို အားကောင်းလာစေရန် သင်္ကေတအဖွဲ့များဖြင့် ဖန်တီးရေးဖွဲ့ခဲ့ကြပုံကို သိရှိ
စေလိုခြင်း ဖြစ်သည်။ လေ့လာတင်ပြရာတွင် ကဗျာ၊ သင်္ကေတ၊ မြန်မာကဗျာနှင့်သင်္ကေတဟူ၍
အပိုင်း(၃)ပိုင်းခွဲကာ လေ့လာပါမည်။

languagemyanmarlocal-journal2020literature-poem
‌ဗေဒါလမ်းကဗျာမှ ဘဝအားမာန်Thein Zaw Win, War War Soe, Htay Htay AungSeptemberအားမာန်၊ ခေတ်စမ်း၊ ဗေဒါ၊ ဒီ၊ ကျူ။Download

ဤစာတမ်းသည် ဆရာဇော်ဂျီ၏ ကဗျာပေါင်းချုပ်ကို အလေ့လာခံနယ်အဖြစ် သတ်မှတ်၍
(၁၉၆၀)ပြည့်နှစ် တက္ကသိုလ်အိုးဝေမဂ္ဂဇင်းတွင် ရေးသားခဲ့သော ဗေဒါလမ်းကဗျာ(၃)ပုဒ်မှ ဘဝ
အားမာန်ကို လေ့လာတင်ပြထားခြင်း ဖြစ်သည်။ ဗေဒါလမ်းကဗျာ(၃)ပုဒ်ပါ ဗေဒါပင်လေး၏ ရေယဉ်
ခရီးတွင် တွေ့ကြုံရသော အခက်အခဲ ပြဿနာများကို ဘဝခရီးတွင် လူသား ကြုံတွေ့ရသော အခက်
အခဲ ပြဿနာများအဖြစ် မြင်ယောင်စေပြီး ဗေဒါပင်ကလေးကဲ့သို့ ဘဝအမောများကို ဖြေတတ်၊
ပြေတတ်စေလိုခြင်း ဖြစ်သည်။ ဤစာတမ်းသည် ဗေဒါလမ်းကဗျာမှ ဘဝအားမာန်ကို အနက်အဓိပ္ပာယ်ရှုထောင့်မှ လေ့လာတင်ပြထားခြင်း ဖြစ်ပြီး ဆရာဇော်ဂျီ၏ ဗေဒါလမ်းကဗျာများ
ကို လေ့လာလိုသူများအတွက် တစ်စိတ်တစ်ဒေသ အထောက်အကူပြုနိုင်မည် ဖြစ်သည်။

languagemyanmarlocal-journal2020literature-poem
ခင်ခင်ထူး၏ ဖက်စိမ်းကွမ်းတောင် ရွှေဝတ္ထုတိုများအနက် ခရီးဖော်ဝတ္ထုတို လေ့လာချက်Thein Zaw Win, War War Soe, Htay Htay AungJuneရည်ရွယ်ချက်၊ ဇာတ်လမ်း၊ ဇာတ်ဆောင်၊ နောက်ခံဝန်းကျင်။Download

ဤစာတမ်းသည် ခင်ခင်ထူး၏ ဖက်စိမ်းကွမ်းတောင် ရွှေဝတ္ထုတိုများအနက် ‘ခရီးဖော်’ဝတ္ထုကို
အလေ့လာခံနယ်အဖြစ် သတ်မှတ်၍ ဝတ္ထုတို အင်္ဂါရပ်များ ဖြစ်သော ရည်ရွယ်ချက်၊ ဇာတ်လမ်း၊
ဇာတ်ဆောင်၊ နောက်ခံဝန်းကျင်အဖွဲ့များဖြင့် ဝေဖန်သုံးသပ် တင်ပြထားပါသည်။

languagemyanmarlocal-journal2020literature-novel
‌ဗေဒါလမ်းကဗျာမှ ဘဝအားမာန်Thein Zaw Win, War War Soe, Htay Htay AungSeptemberအားမာန်၊ ခေတ်စမ်း၊ ဗေဒါ၊ ဒီ၊ ကျူ။Download

ဤစာတမ်းသည် ဆရာဇော်ဂျီ၏ ကဗျာပေါင်းချုပ်ကို အလေ့လာခံနယ်အဖြစ် သတ်မှတ်၍
(၁၉၆၀)ပြည့်နှစ် တက္ကသိုလ်အိုးဝေမဂ္ဂဇင်းတွင် ရေးသားခဲ့သော ဗေဒါလမ်းကဗျာ(၃)ပုဒ်မှ ဘဝ
အားမာန်ကို လေ့လာတင်ပြထားခြင်း ဖြစ်သည်။ ဗေဒါလမ်းကဗျာ(၃)ပုဒ်ပါ ဗေဒါပင်လေး၏ ရေယဉ်
ခရီးတွင် တွေ့ကြုံရသော အခက်အခဲ ပြဿနာများကို ဘဝခရီးတွင် လူသား ကြုံတွေ့ရသော အခက်
အခဲ ပြဿနာများအဖြစ် မြင်ယောင်စေပြီး ဗေဒါပင်ကလေးကဲ့သို့ ဘဝအမောများကို ဖြေတတ်၊
ပြေတတ်စေလိုခြင်း ဖြစ်သည်။ ဤစာတမ်းသည် ဗေဒါလမ်းကဗျာမှ ဘဝအားမာန်ကို အနက်အဓိပ္ပာယ်ရှုထောင့်မှ လေ့လာတင်ပြထားခြင်း ဖြစ်ပြီး ဆရာဇော်ဂျီ၏ ဗေဒါလမ်းကဗျာများ
ကို လေ့လာလိုသူများအတွက် တစ်စိတ်တစ်ဒေသ အထောက်အကူပြုနိုင်မည် ဖြစ်သည်။

languagemyanmarlocal-journal2020literature-poem
ခင်ခင်ထူး၏ 'ကျေးတစ်ရာ ရသစာစု များ'မှ ထိန်းသိမ်းအပ်သော မြန်မာ့ယဉ်ကျေးမှုများWar War Soe, Htay Htay Aung, Thein Zaw WinJulyရိုးရာ၊ ဓလေ့၊ ရသ၊ ယဉ်ကျေးမှု၊ ပွဲတော်။Download

ဤစာတမ်းသည် မြန်မာ့ရိုးရာ ယဉ်ကျေးမှု အမွေအနှစ်များ ထိန်းသိမ်း စောင့်ရှောက်သင့်ကြောင်း
ဖော်ပြလိုသော စာတမ်း ဖြစ်သည်။ မြန်မာ့မြေတွင်ကြီး၊ မြန်မာ့ရေသောက်ပြီး မြန်မာ့ရိုးရာယဉ်ကျေး
မှုကို မထိန်းသိမ်းနိုင်လျှင် စာပေနှင့် ယဉ်ကျေးမှုပျောက်၍ လူမျိုးပျောက်ကာ တိုင်းပြည်ပျောက်ရ
မည့် အဖြစ်ကို မရောက်လို၍ မိမိတို့ ယဉ်ကျေးမှုကို မြတ်နိုးလာစေရန် တင်ပြထားသည့် စာတမ်း
ဖြစ်သည်။ ယနေ့ခေတ်လူငယ်များအနေဖြင့် နည်းပညာပိုင်း ဖွံဖြိုးတိုးတတ်လာသော်လည်း ရသစာ
ပေကို ချစ်ခင်မှု အားနည်းလာကြသည်။ ထို့ကြောင့် ကိုယ့်နိုင်ငံ၊ ကိုယ့်လူမျိုး၊ ကိုယ်စာပေ၊ ကိုယ့်ယဉ်
ကျေးမှုကို အမြတ်တနိုး တန်ဖိုးထားတတ်စေရန် ရည်ရွယ်ပါသည်။

languagemyanmarlocal-journal2020literature-culture
ခင်ခင်ထူး၏ ဖက်စိမ်းကွမ်းတောင် ရွှေဝတ္ထုတိုများအနက် ခရီးဖော်ဝတ္ထုတို လေ့လာချက်Thein Zaw Win, War War Soe, Htay Htay AungJuneရည်ရွယ်ချက်၊ ဇာတ်လမ်း၊ ဇာတ်ဆောင်၊ နောက်ခံဝန်းကျင်။Download

ဤစာတမ်းသည် ခင်ခင်ထူး၏ ဖက်စိမ်းကွမ်းတောင် ရွှေဝတ္ထုတိုများအနက် ‘ခရီးဖော်’ဝတ္ထုကို
အလေ့လာခံနယ်အဖြစ် သတ်မှတ်၍ ဝတ္ထုတို အင်္ဂါရပ်များ ဖြစ်သော ရည်ရွယ်ချက်၊ ဇာတ်လမ်း၊
ဇာတ်ဆောင်၊ နောက်ခံဝန်းကျင်အဖွဲ့များဖြင့် ဝေဖန်သုံးသပ် တင်ပြထားပါသည်။

languagemyanmarlocal-journal2020literature-novel
Face Recognition System Using Radial Basis Function Neural Network (RBFNN)Nilar Win Myint9 Februaryface modality, ,morphological erosion and dilation,,recognition, edge detection, RBFNNDownload

abc

fcstlocal-conference-paper2013digital-image-processing
Finding Shortest Path TCP Routing By Modified Dijkstra's AlgorithmZin Me Me Win16 DecemberRouting, Distance, OSPF and Dijkstra'sDownload

abc

fcstlocal-conference-paper2010simulation-and-modeling
Sign Detection and Classification System From Video ImageShwe Sin LattDecember, Road Sign, Template Matching, Thresholding, Color and ShapeDownload

abc

fcstlocal-conference-paper2010digital-image-processing digital-signal-processing
မြန်မာကဗျာနှင့် သင်္ကေတအဖွဲ့War War Soe, Htay Htay Aung, Thein Zaw WinJuneကဗျာ၊ သင်္ကေတ၊ ရသ၊ ဖန်တီးသူ၊ ခံစားမှု။Download

ဤစာတမ်းသည် မြန်မာကဗျာများတွင် တွေ့ရသော သင်္ကေတအဖွဲ့ ထင်ဟပ်နေသည့် ကဗျာများကို လေ့လာတင်ပြထားသော စာတမ်း ဖြစ်ပါသည်။ ရသစာပေအဖွဲ့ဖြစ်သော ကဗျာသည် စာရေးသူ၏ အတွေ့အကြုံမှ တစ်ဆင့် ပေါက်ဖွားလာသော အဖွဲ့အနွဲ့များ ဖြစ်သည်။ ထိုသို့ ဖွဲ့နွဲ့ထားသော ကဗျာများတွင် မိမိကဗျာကို ပိုမို အားကောင်းလာစေရန် သင်္ကေတအဖွဲ့များဖြင့် ဖန်တီးရေးဖွဲ့ခဲ့ကြပုံကို သိရှိစေလိုခြင်း ဖြစ်သည်။ လေ့လာတင်ပြရာတွင် ကဗျာ၊ သင်္ကေတ၊ မြန်မာကဗျာနှင့်သင်္ကေတဟူ၍
အပိုင်း(၃)ပိုင်းခွဲကာ လေ့လာပါမည်။

languagemyanmarlocal-journal2020literature-poem
Forecasting the Probabilities of Rainfall using Back-propagation AlgorithmThein Shan Soe,Sandar WinDecemberNeural Network, Back-propagation Algorithm, Weather ForecastingDownload

abc

fcstlocal-conference-paper2010modeling-and-intelligence-system
Green-Aware Cloud Datacenter SelectionKhin Swe Swe Myint Thandar Thein17-18 February, Renewable Energy, Datacenter, Power ManagementDownload

abc

fcstinternaional-conference-paper2014cloud-computing virtualization-technology
Energy and Cost Efficient Datacenter Selection for Cloud ServicesKhin Swe Swe Myint ,Thandar Thein11-12 FebruaryRenewable Energy, Datacenter selection strategyDownload

abc

fcstinternaional-conference-paper2014artificial-intelligence
Green Aware Geographically Distributed Datacenter SelectionKhin Swe Swe Myint22-23 DecemberGreen Aware Geographically Distributed Datacenter, Renewable Energy, Data center selection strategyDownload

abc

fcstinternaional-conference-paper2013renewable-energy-and-energy-management
Resource Management Strategy for Replication and MigrationKhin Swe Swe Myint26-27 FebruaryResource Management, Replication, MigrationDownload

abc

fcstinternaional-conference-paper2013virtualization-technology
Migration Policy for Virtualized Data CenterKhin Swe Swe Myint28-29 FebruaryResource Management, Virtualization, Data CenterDownload

abc

fcstinternaional-conference-paper2012virtualization-technology
Live Migration Decision based on Integrated Server-Storage VirtualizationKhin Swe Swe Myint5-6 May, Server-Storage Virtualization, Resource ManagementDownload

abc

fcstinternaional-conference-paper2011cloud-computing virtualization-technology
Digital Envelope System using Blowfish and NTRU Encryption AlgorithmMyat Hsu Mon, Ohn Mar MyaingFebruary, , Number theory research unit(NTRU), Public-key cryptosystemDownload

abc

fcstlocal-conference-paper2013cryptography network-security network-technology
Ultrasonic Range Finder using PIC MicrocontrollerShwe Yi Tun, Ohn Mar MyaingDecemberPopular ranging techniques, ultrasonic rangingDownload

abc

fcstlocal-conference-paper2011intelligent-control-system-electronic-circuit
Design and Implementation of PIC-based Door Control SystemMyat Thazin Hlaing, Ohn Mar MyaingDecemberSecurity System, microcontroller PICDownload

abc

fcstlocal-conference-paper2011intelligent-control-system-electronic-circuit
Using Cipher Message in Wave Audio File by using RSA and LSB AlgorithmCho Cheery Aung, Ohn Mar MyaingFebruary, , Steganography, RSA, random key generatorDownload

abc

fcstlocal-conference-paper2013cryptography network-security network-technology
Design and Implementation of Green House Control System using Fuzzy LogicAye Moh Moh, Ohn Mar MyaingDecember, Fuzzy control system, green house temperature control systemDownload

abc

fcstlocal-conference-paper2011computing simulation-modeling
Hiding Data In Digital Images by using SteganographyKhin Lae Phyo Aung, Ohn Mar Myaing29 SeptemberDigital watermarking techniques, steganographyDownload

abc

fcstlocal-conference-paper2009cryptography
Fuzzy Expert System for Integrated Pest Management System in SoybeanThuzar Win, Ohn Mar Myaing16 DecemberFuzzy Expert System, Integrated Expert SystemDownload

abc

fcstlocal-conference-paper2010fuzzy-logic-and-intelligent-control-system
Fuzzy – Based Recommendation System for Consumer ProductAye Mon Tun, Ohn Mar Myaing29 SeptemberAutomatic prediction, recommendation systemDownload

abc

fcstlocal-conference-paper2009fuzzy-logic-and-intelligent-control-system
Documents Clustering by Growing HierarchicalnSelf-Organization Map (GHSOM)Hteik Hteik Kyaw, Ohn Mar Myaing18 SeptemberSelf-organizing Map(SOM), Growing Hierachicai SOM( GHSOM)Download

abc

fcstlocal-conference-paper2008information-retrieval-techniques
Design and Construction of PIC-Based Excitation Control System for GeneratorOhn Mar MyaingJulyswitch mode power supply, field excitation, digital excitation control system, pulse skipping modulationDownload

abc

fcstinternational-paper2011power-control-system
Study on Cds. Cu2 S Photovoltaic CellNwe Nwe TunDecemberCdS-Cu2S photovoltaic cell, Pyrex glass, Electroplating, Heterojunction, Photovoltage, Light intensity, Power Conversion Efficiency.Download

In this paper the CdS-Cu2S photovoltaic cell has been prepared and characterized by using evaporation method on glass substrate. CdS film was deposited on the Pyrex glass substrate by evaporation and Cu2S layer was obtained by electroplating in a dilute aqueous solution of CuSO4 at room temperature. Silver electrode was applied to the electroplated surface The results of electrical and optical characteristic of the CdS-Cu2S heterojunction were investigated. The photovoltaic response has been observed under various illuminated intensity for different wavelengths in visible region. It was found to be the photovoltage and photocurrent varying with different light intensities. It can be concluded that the formation of low resistivity CdS film and Cu2S layer play a big role in obtaining a high efficiency cell.

nsinternational-paper2011material-science
Structure Analysis of 31 SMyint Myint Than,Thida Kyaw,Aye Aye MinMaysingle-particle energy levels, Numerov method, spin-orbit interaction, Woods-Saxon potentialDownload

The neutron single-particle energy levels and the root-mean-square radii of 31S have been studied theoretically in the framework of shell model approach. The one-body Schrödinger equation is solved by using Numerov method as a numerical calculation. The phenomenological Woods-Saxon central potential is applied in this research work. The spin-orbit interaction is also taken into account in this calculation. By using Woods-Saxon central potential including spin-orbit interaction, the calculated shell structure is 1s1/2, 1p3/2, 1p1/2, 1d5/2, 2s1/2, 1d3/2, 1f7/2 and 2p3/2. The binding energies of neutron single-particle in 31S are 36.7 MeV, 26.2 MeV, 23.5 MeV, 14.7 MeV, 10.5 MeV, 9.4 MeV, 3.0 MeV and 0.5 MeV for each states respectively. The root-mean-square radius of 31S is found to be 3.8 fm. In addition, the physical quantities such as kinetic energies, potential energies and centrifugal potential energies have also been investigated.

nsuniversity-journal-paper2020nuclear
Structure Analysis of 31 SMyint Myint Than,Thida Kyaw,Aye Aye MinMaysingle-particle energy levels, Numerov method, spin-orbit interaction, Woods-Saxon potentialDownload

The neutron single-particle energy levels and the root-mean-square radii of 31S have been studied theoretically in the framework of shell model approach. The one-body Schrödinger equation is solved by using Numerov method as a numerical calculation. The phenomenological Woods-Saxon central potential is applied in this research work. The spin-orbit interaction is also taken into account in this calculation. By using Woods-Saxon central potential including spin-orbit interaction, the calculated shell structure is 1s1/2, 1p3/2, 1p1/2, 1d5/2, 2s1/2, 1d3/2, 1f7/2 and 2p3/2. The binding energies of neutron single-particle in 31S are 36.7 MeV, 26.2 MeV, 23.5 MeV, 14.7 MeV, 10.5 MeV, 9.4 MeV, 3.0 MeV and 0.5 MeV for each states respectively. The root-mean-square radius of 31S is found to be 3.8 fm. In addition, the physical quantities such as kinetic energies, potential energies and centrifugal potential energies have also been investigated.

nsuniversity-journal-paper2020nuclear
Document Clustering by using EM clustering algorithm based on K-MeansTheingi AungFebruary, -Download

This paper implements a clustering approach that explores both the content and the structure of XHTML and XML documents for determining similarity among them. A conventional web page clustering technique is utilized to reveal the functional similarity of web pages. In this system, the content and the structure information of the documents are handled by using two different similarity measuring methods. The similarity values produced from these two methods are then combined with weightings to measure the overall document similarity. Text files, HTML, XHTML and XML documents are used as the inputs in this system. Clustering of the text files and HTML documents is based on the content–only information. Both the content and structural information are retrieved according to the XML and XHTML documents clustering processes. Expectation Maximization (EM) clustering algorithm based on k-Means is employed to obtain the document clusters.

fcsproceeding-book2013data-mining web-mining
Mobile Price Range ClassificationMyat Mon Kyaw,Phyo Theingi Khaing, Ei Ei MoeJune, CfsSubsetEval, Decision Table, WekaDownload

Mobile phones have become a necessity for many people throughout the world. The price of mobile phones is different according to their features. Mobile Price Range Classification system can support to classify mobile pricerange according to mobile phone’s features. This system is useful for mobile industries to estimate the cost of a new product. Decision Table algorithm is applied for price range classification by testing with Weka tool. Feature reduction is an important issue in classification that is intended to remove irrelevant data to improve accuracy. The feature reduction framework is used to simplify high dimensional data to low dimensional data with non-correlated attributes. CfsSubsetEval algorithm is applied for feature selection. This system classifies the mobile price range as Low, Medium, High and Very high. This system can help to classify the mobile phones’ cost level according to related features to produce a new mobile phone in industries. This system can be useful for consumers to verify that they are paying the best price for a mobile phone with given features.

fcsproceeding-book2020data-mining database
Text Classification using Vector Space Model and K-Nearest Neighbor AlgorithmHnin Wut Yee, Khin Sein HlaingDecember, frequency, euclidean distance, svmDownload

Text classification is one of the well-studied problems in data mining and information retrieval. Text classification which aims to assign a document to one or more categories based on its content is a fundamental task for web and/or document data mining application. Text classification makes the classification process fast and more efficient since it automatically categorizes documents. In text classification, term weighting between different words is calculated with vector space model. All documents are processed by vector space model to form tf-idf and documents are assigned to the class that corresponds to its least value of distance vector, as measured by k-nearest neighbor algorithm.

fisuniversity-journal-paper2019data-mining machine-learning
Review on continuous speech recognition systemZaw Win Myint, Yin Win Chit, Phyo Theingi KhaingMarchDeep Belief Network, Deep Neural Network, Support Vector Machine, Convolutional Neural Network, Artificial IntelligenceDownload

Automatic Speech Recognition System is based on the voice as the research area as a
cross-disciplinary. Speech Recognition is the high-tech that allows the machine to turn the speech signal into the text through the process of identification and understanding and also make the function of natural voice communication. It has a very close relationship with acoustics, phonetics, linguistics, information theory, pattern recognition theory and neurobiology disciplinary. Over the past decades, a tremendous amount of research has been done on the use of machine learning for speech application areas, especially speech recognition step. However, in the past few years, many types of research have developed on the deep learning approach for speech-related application areas such as speech emotion recognition system, speaker recognition, and motor sound classification system. Nowadays, this development of deep learning approach has yielded better results when compared to the other various applications including speech. A deep learning algorithm has been mostly used to further enhance the capabilities of computers so that it understands what humans can do, which includes speech recognition. Deep Learning classifier is used in many research areas of the speech recognition system and speech recognition system to improve the accuracy of the system. The extracted features and converted feature images are used as the input of the various Deep learning classifiers to get a higher accuracy for the speech recognition system. This paper provides various result based on the different analysis of different speech recognition process when deep learning become a newly popular area of machine learning for speech applications. As the experimental results of the system, the various recognition results of different deep learning classifiers in the recognition step of the speech recognition system.

fcsonline-publication2020digital-signal-processing
Dimensional Reduction By Using Wrapper ApproachAye Aye Thin,Yin Ko LattDecemberDimensional Reduction, Stepwise Forward Selection, Decision Tree, Wrapper Approach.Download

Dimensional reduction is the process of removing irrelevant features. The feature selection process is very important in selecting a subset of the original features, so that the selected subset is sufficient to perform the classification task. In this paper, the implemented system presents an efficient feature selection method which can maximize the accuracy of classifier. Features that are relevant for decision tree classifiers are selected by using wrapper method. Wrapper method requires a predetermined
mining algorithm applied on the selected subset to determine which features are selected. This system is intended to develop the wrapper approach by using stepwise forward selection for features subset selection and decision tree for evaluation of the selected subset. To estimate the accuracyperformance of the classifier, this system evaluates the selected features subset by using the k-fold cross-validation accuracy method.

fislocal-conference-paper2010data-mining
Clustering of Data Objects By Using Hirerarchical Clustering MethodsPhyo Theingi Khaing,Khin Myat Myat MoeDecember, , Clusters, KDD, agglomerative clustering method, divisive clustering methodDownload

Clustering is a division of data into groups of similar objects. Clustering is the subject of active research in several fields such as statistics, pattern recognition, and machine learning. This paper focuses on clustering in data mining. This imposes unique computational requirements on relevant clustering algorithms. A variety of algorithms have recently emerged that meet these requirements and were successfully applied to real-life data mining problems. They are subject of the paper. Clustering analysis has been used in many applications such as market analysis, pattern recognitions, data analysis, biological studies, spatial data analysis, medical data analysis, web document classification and many others. The quality of clustering can be accessed based on dissimilarity measures of objects. In this paper, two methods of hierarchical clustering are used for cluster of any data objects.

fcsproceeding-book2010artificial-intelligence data-mining knowledge-discovery
Retrieving Text Documents by using Vector Space ModelKhaing Min Kyu, Renu27 DecemberInformation retrieval, vector space model, Cosine similarityDownload

The rapid growth of world-wide information systems results in new requirements for text indexing and retrieval. In traditional Information Retrieval (IR), detecting similarities within a group of text documents is used widely. For efficient query processing, an indexing mechanism is required. The system in this work is a search engine for retrieving documents by using vector space model. Vector Space Model incorporates local and global information using weighting formula known as term frequency-inverse document frequency model. In this system, the user can search documents similar to the user query. Cosine similarity method is used to compute the similarity between query vector and document vector. The system not only can search texts from *.doc files also gives link to author’s web site to perform further searching. The system is also analyzed with precision, recall and mean average precision of retrieved results.

fisconference-paper2010knowledge-discovery-and-artificial-intelligent
Solving Concurrency Problem by Using Semaphore SignalOhnmar Hlaing, Ingyin OoDecember-Download

abc

fcsproceeding-book2010operating-system
Encrypted Session Key Exchange and Authentication (ESKEA) Based on DIFFIE-Hellman ProtocolThidar Htun, Than Naing SoeDecemberpseudorandom number generator(PRNG), encrypted session key exchange and authentication protocol(ESKEA), public key encryption(RSA), pseudorandom number generator(RC4)Download

Key management plays a fundamental role in cryptography as the basis for securing cryptographic techniques providing confidentiality, entity authentication,data origin authentication, data integrity, and digital signatures. And the key exchange protocol is also an essential mechanism for any symmetric cipher. The strength of any cryptographic system relies on efficient key distribution technique. However the main benefit of conventional (symmetric) encryption is its processing speed, the major drawback becomes its secret-key distribution. So, combining Diffie-Hellman protocol with public key encryption and using pseudorandom number generator (PRNG) for generating secret random numbers and random test strings will enhance security level of session key distribution. In our proposed system, the Encrypted Session Key Exchange and Authentication protocol (ESKEA) will be developed, based on Diffie-Hellman key exchange protocol to distribite the generated session key in secure manner by using RSA public key encryption (for secure key exchange) and RC4 pseudorandom number generator (for generating secret random numbers and random test strings).

fislocal-conference-paper2010cryptography
Mining Quatitative Characteristics Rule By Using Attribute-Oriented InductionEi Mon Than,Ingyin Oo10 DecemberData Mining, attribute oriented induction, data generalizationDownload

Data mining or knowledge discovery in database is the search for relationship and global patterns that exists in large database. Domain konwledge in the form of concept hierarchies helps to organize the concepts of the attributes in the database relations. Data generalization summarizes data by replacing low level values with higher level concepts. In this paper, the student data set is generalized by using attribute-oriented induction. This method helps to organize the concepts of the attributes in the student database. This paper is intended to develop an attribute-oriented induction method for knowledge discovery in database and to discover quantitative characteristics rules using the attribute-oriented approach. The output is presented in the form of generalized relations or rule forms.

fcsproceeding-book2010data-mining
Sense based Information Retrieval SystemK Kaye, Win Thandar AungMayWord Sense Disambiguation (WSD), Information Retrieval (IR), WordNetDownload

Nowadays, Word sense disambiguation (WSD) is an important technique for many NLP applications such as machine translation, grammatical analysis, content analysis and information retrieval. Information retrieval (IR) is to provide users with documents that will satisfy their information need based on the query. In the IR system, ambiguous words are damaging effect on the precision of this system. In this situation, WSD process is useful for automatically identifying the correct meaning of an ambiguous word. Therefore, this system proposes the optimal concept-based word sense disambiguation algorithm to increase the precision of the IR system about technology domain. This system provides additional semantics as conceptually related words with the help of glosses to the query words and keywords in the documents by disambiguating their meanings. In this system, various senses that are provided by concept-based WSD algorithm have been used as semantics for indexing the documents to improve performance of IR system.

fisinternational-journal-paper2014web-data-mining
Concept-based Information Retrieval by using Optimal Word Sense DisambiguationK Kaye, Win Thandar AungJanuaryWord Sense Disambiguation (WSD), Information Retrieval (IR), WordNetDownload

Nowadays, Word sense disambiguation (WSD) is an important technique for many NLP applications such as machine translation, grammatical analysis, content analysis and information retrieval. Information retrieval (IR) is to provide users with documents that will satisfy their information need based on the query. In the IR system, ambiguous words are damaging effect on the precision of this system. In this situation, WSD process is useful for automatically identifying the correct meaning of an ambiguous word. Therefore, this system proposes the optimal concept-based word sense disambiguation algorithm to increase the precision of the IR system about technology domain. This system provides additional semantics as conceptually related words with the help of glosses to the query words and keywords in the documents by disambiguating their meanings. In this system, various senses that are provided by concept-based WSD algorithm have been used as semantics for indexing the documents to improve performance of IR system.

fisinternational-journal-paper2013web-data-mining
Word Sense Disambiguation: A Briefly SurveyK Kaye, Win Thandar AungNovemberSupervised, Semi-supervised, Unsupervised, Knowledge-based WSDDownload

Nowadays, Word sense disambiguation (WSD) is an important technique for many NLP applications such as machine translation, grammatical analysis, content analysis and information retrieval. Word sense disambiguation is the essence of communication in a natural language. WSD process is useful for automatically identifying the correct meaning of an ambiguous word in the sentence or the query when it has multiple meanings. This paper will furnish an idea of few of the WSD algorithms. In this paper, the supervised, semi-supervised, unsupervised and knowledge-based approaches for WSD are discussed.

fisinternational-journal-paper2013web-data-mining
Implementation of Word Sense Disambiguation for Information Retrieval SystemK Kaye, Win Thandar Aung7 JanuaryWord Sense Disambiguation (WSD), Information Retrieval (IR), WordNetDownload

In many NLP applications such as machine translation, content analysis and information retrieval, word sense disambiguation (WSD) is an important technique. In the information retrieval (IR) system, ambiguous words are damaging effect on the precision of this system. In this situation, WSD process is useful for automatically identifying the correct meaning of an ambiguous word. Therefore, this system proposes the optimal concept-based word sense disambiguation algorithm to increase the precision of the IR system. This system provides additional semantics as conceptually related words with the help of glosses to each keyword in the query by disambiguating their meanings. This system uses the WordNet as the lexical resource that encodes concepts of each term. In this system, various senses that are provided by optimal concept-based WSD algorithm have been used as semantics for indexing the documents to improve performance of IR system. This system is implemented by using C# programming language.

fisinternaional-conference-paper2014web-data-mining
CLUSTERING ENHANCEMENT FOR BLOG CATALOGNu Yee Win, Nwe Nwe, 29 September, , Blog , blogosphere , web mining , text mining comments, clustering.Download

Blogs are new form of internet phenome-non and vast ever increasing information resource. Mining blog files for information is a very new research direction in data mining. The blog discus-sion page can be clustered by counting the occur-rence of each word in the author/ reader comm-ents. The clustering datasets include the title, body and comment parts of the blog document from blog pages. The word-page matrix was constructed by downloading from a well-known website and ex-perimented a k-means clustering algorithm with different weights assigned to the title, body and comments parts. The k-means algorithm is used to cluster the blog page comments. This system is to develop the information retrieval for more similar blog user comments search based on Web. The goal is to look more similar page to the users on their own interest user comments and to show this information how to retrieve on the web pages.

fcsconference proceeding-book2009artificial-intelligence data-mining knowledge-discovery
Concept-based Word Sense Disambiguation for Information Retrieval SystemK Kaye, Win Thandar Aung26-27 FebruaryWord Sense Disambiguation (WSD), Information Retrieval (IR), WordNetDownload

Word sense disambiguation (WSD) is an important technique for many NLP applications such as machine translation, content analysis and information retrieval. In the information retrieval (IR) system, ambiguous words are damaging effect on the precision of this system. In this situation, WSD process is useful for automatically identifying the correct meaning of an ambiguous word. Therefore, this system proposes the optimal concept-based word sense disambiguation algorithm to increase the precision of the IR system about technology domain. This system provides additional semantics as conceptually related words with the help of glosses to each keyword in the documents by disambiguating their meanings. This system uses the WordNet as the lexical resource that encodes concepts of each term. In this system, various senses that are provided by concept-based WSD algorithm have been used as semantics for indexing the documents to improve performance of IR system. This system is implemented by using C# programming language.

fisinternaional-conference-paper2013web-data-mining
Finding Shortest Path Using Heuristic Search Techniquewin cherry koDecemberOPEN/CLOSE LIST, Multilevel linked list,heuristic methods, A* algorithmDownload

The purpose of this paper is to find the shortest distances between each pair of cities. Heuristic methods apply problem-specific understanding to find compelling choices. These methods use the assessment highlight to choose the best node in
the technique of achieving the targetstate.The shortest way tofind out can be linked to a variety of problems. Leaving heuristics to look at calculations that are Line execution plot,OPEN/CLOSE LIST utilization plot, Requested list executionand generalized connection list method. It is easy to use the A *
algorithm and the heuristic calculation to look the most limitedway between matching the necessary node. In this paper,heuristic methods are shown using the multilevel linked list as a data structure to find the shortest possible path. The path to be found shows that the full search space is reduced and that the shortest path is always an optimal solution and a successful completion.

fcsproceeding-book2019artificial-intelligence
Implementation of Distributeed Query Processing System using Mobile AgentsK Kaye, San San TintSeptemberMobile Agent, Distributed Database, Query ProcessingDownload

Mobile agent technology has the ability to travel from host to host in a network and to places of their own choosing at times. It has been an effective choice for parallel and distributed computing. In mobile agent based application, both code and data can be transferred from one machine to another in the form of class .In this paper, it is intended to collect data from many distributed computers in which data stored several sites that are formed as distributed manner. It is implemented distributed query frame that will process the user queries and retrieve the necessary information. It will accept the user input and the result output will be handled by Master agent. The computing process will be done by worker agent. Meanwhile, mobile-agent architecture is one of the alternatives for distributed database system.

fisinternaional-conference-paper2009artificial-intelligence
Development of Recommendation System for Access to Web SitesEi Ei Han,Than Nwet AungDecember-Download

Web usage mining is one of the categories of web mining task to provide recommendation. Building profiles of registered users is important for collecting information. User profiling is to provide users with what they want without asking for it explicitly. From previous browsing history, the user can know which sites he or she accessed and log-in time for the web sites. From the recommendation systems, web users can know which sites are suitable for them and can save searching time. Collaborative filtering is one type of recommendation systems. It groups users with similar interests and recommends the active user who has the same group based on these neighbor’s interest items. In this paper, we propose a recommendation system for a web site to deliver relevant information and to effectively access data from worldwide sources. The user can reduce searching time and reduce information overload.

fcscd-local-conference2008web-mining
Analyzing and Classifying Web Application AttacksEi Ei Han, February-Download

Web application attack detection is one of the popular research areas during these years. SQL injection, XSS and path traversal attacks are the most commonly occurred types of web application attacks. The proposed system effectively classifies three attacks by random forest algorithm to ensure reasonable accuracy. Request length module is computed based on the certain length of the URL to analyze each record as normal or attack. Regular pattern analysis is emphasized on the content of URL and other features to analyze the certain attack patterns. ECML/PKDD standard web attack dataset is used in this system. Combination of random forest algorithm with request length and regex pattern analysis is proposed to outperform the accuracy.

fcsconference proceeding-book2015mining-and-security
Classification of SQL Injection, XSS and Path Traversal for Web Application Attack DetectionEi Ei Han,Thae Nu Phyu, February-Download

This paper compares two approaches of random forests and K-Means+ID3 algorithms for classifying web application attacks. In the first method, Random Forest algorithm is used for the classification of web attacks. In the second method, the k-Means clustering method first partitions the training instances into k clusters using Euclidean distance similarity. On each cluster, an ID3 decision tree is built. To obtain a final decision on classification, the decision of the k-Means and ID3 methods are combined using two rules: (1) the Nearest-neighbor rule and (2) the Nearest-consensus rule. This paper also describes comparison results of these two approaches.

fcsconference proceeding-book2016mining-and-security
Detection of Web Application Attacks with Request Length Module and Regex Pattern AnalysisEi Ei Han, August-Download

Web application attack detection is one of the popular research areas during these years. Security for web application is necessary and it will be effective to study and analyze how malicious patterns occur in web server log. This system analyzes web server log file, which includes normal and malicious users’ access patterns with their relevant links. This uses web server log file dataset for the detection of web application attacks. This system intends to analyze normal and attack behaviors from web server log and then classify attack types which are included in the dataset. In this system, three types of attacks are detected namely, SQL injection, XSS and directory traversal attacks. Attack analysis stage is done by request length module and regular expressions for various attack patterns.

fcsconference proceeding-book2015
Prediction of Students' Exam Results by using Classification MethodsLin Lin HtunMayEducational Data Mining(EDM)/ Decision Tree /Classification/ WekaDownload

Currently the amount huge of data stored in educational database these database contain the useful information for predict of students exam result. This paper measures student’s result according their practical test grade, seminar performance, measure of student participate, their assignment, attendance, mid-term marks and final grade marks. The proposed system is to predict student’s exam result using classification model under the data set of students at University of Computer Studies, Magway. Data mining is used in higher education for analysis, predicting and evaluating the performance of students, teachers and others. Educational Data Mining (EDM) is one of the ways that issued to achieve these objectives. In this paper, the classification task is used to predict the final grade of students and as there are many approaches that are used for data classification, the decision tree (ID3) method is used here. This paper analyses decision tree (J48), Random Tree, REPTree and Naive Bayes classification algorithms for classification model by using Weka tool. Weka is a collection of tools for regression, clustering, association, data pre-processing, classification, and visualization. In this paper, data set is collected from exam results and information survey about 100 students in Third Year (CS and CT) at university of Computer Studies, Magway (Burma).

fisuniversity-journal-paper2020data-mining
Performance Analysis of a QAPF Scheduling Scheme in LTE NetworkZin Mar Myo, Zar Lwin Phyo, Aye Thida Win, DecemberLTE, Multimedia Services, OFDMA, QAPF, TDMADownload

Long Term Evolution (LTE) is a cellular network that operates completely in packet domain. It can also support multimedia services. Due to this nature,
provisioning the Quality of Service (QoS) requirements has become a challenge to the design of scheduler. Especially, the scheduler must guarantee for transmitting the real-time traffics such as VoIP (voice over IP). In this paper, a scheduler that satisfies the differentQoS requirements is presented. This scheduler considers the additional QoS consideration to the Proportional Fair (PF), which is a well-known scheduling algorithm. As the core work of this paper, its performance is evaluated by comparing with the existing well-known schedulers. For non-real-time traffics such as file download, the performance of the scheduling scheme is evaluated by comparing with PF scheduler. For real-time traffics such as video live streaming, its performance is compared with Frame Level Scheduler (FLS).

fcsonline-publication proceeding-book2019mobile-network-computing
Replacing Same Meaning in Sentences Using Natuaral Language UnderstandingTin Htar Nwel, Zar Lwin Phyo, Zin Mar Myo, Aye Thida WinAugustNLP, A chunk based syntax analyzer, Matching technique, Intelligence methodsDownload

NLP (Natural Language Processing) can be used to
communicate with computers by means of intelligence methods in a natural language. In other words, it is very useful for classification and analysis. Although there are many natural language syntax analyzers that existed before, it still remains to fulfill the requirements for analyzing English text for English to English Machine Translation. In this paper, we have proposed a chunk-based analyzer for English to English Machine Translation System. The keyword search Technique is one of the techniques of
Natural Language Understanding. A simple keyword based matching technique is used for classification. Domain-specific dictionaries of keywords are used to reduce the dimensionality of feature space. The output result is that the word matched to a known word will be replaced in the given sentence, which will not be changed the original meaning

fcsonline-publication2019natural-language-processing
Performance Analysis of EXP-BET Algorithm for Triple Play Service in LTE SystemKu Siti Syahidah Ku Mohd Noh, Darmawaty Mohd Ali, Zin Mar Myo25 MayLTE, Packet Scheduling Algorithm, Exponential Blind Equal Throughput, LTE-SimDownload

Quality of Service (QoS) is defined as user’s satisfaction towards service performance that has
been offered to them. Due to different traffic characteristics and QoS requirements of real-time and non-real-time services, thus provisioning the QoS requirements has become a challenge. In this study, we have compared our proposed algorithm namely the Exponential Blind Equal Throughput (EXP-BET) towards the Exponential Proportional Fairness (EXP-PF) and Frame Level Scheduler (FLS). The comparisons have been made in terms of fairness index,
throughput,packet loss rate (PLR) and delay. From the simulation results, it is observed that EXP-BET delivers higher fairness and throughput and lower PLR and delay for real-time application. Instead, EXP-BET shows 17.72% improvement than FLS and 7.52% from EXP-PF in term of fairness index for the non-real-time application.

fcsonline-publication2016mobile-network-computing
Genetic Algorithm-Based Feature Selection and Classification of Breast Cancer Using Bayesian Network ClassifierYi Mon Aung, SeptemberGenetic Algorithm; Classification; Bayesian Network; Feature SelectionDownload

Recently, large amounts of data are widely accessible in information structures, and students have attracted great attention of academics to turn such data into useful knowledge. Researchers also need related data from vast records of patients using the feature selection method. The selection of features is the process of identifying the most important attributes and removing redundant and irrelevant attributes. The system implements obtaining information in the original data set without taking into account class labels to create the best functional subset using information gain and Pearson correlation. This system was tested on a chronic kidney disease dataset obtained from the UCI machine learning repository. The best data on chronic kidney disease with all the functions using data mining algorithms such as Naive Bayes, Multilayer Perceptron (MLP), J48, K Nearest Neighbor (KNN) to test the effectiveness of the system.

fisuniversity-journal-paper2011 2020data-mining
Predict Student's Performances by using J48 AlgorithmMyo Thandar Tun, Yin Yin HtayMay-JuneData Mining, Student Academic Performance, Classification, J48 algorithmDownload

The critical issue to the academic community of higher education is to monitor the progress of students’ academic performance. We can use data mining techniques for this purpose. J48 algorithm is one of the famous classification algorithms present today to generate decision trees in data mining technique. The data set used in this study is taken from University of Computer Studies (Mandalay). Weka machine learning tool is applied to make classification. In this work, we tested result classification accuracy was computed. This J48 classification algorithm give accuracy with 78.2%.

fisinternational-journal-paper2020data-mining
Query Classification and NOSQL based Myanmar Information Searching SystemMin,Yin Yin HtayMayQuery Classification, Information Searching, NoSQL, Jaccard CoefficientDownload

In the information searching system, classification of queries is important to provide searched information result effectively and efficiently. Query classification is to classify user query into a set of intended categories. So, this system proposes the framework for providing better searched information results by classifying user query and using graph database. Graph database is one type of NoSQL (Not only Structured Query Language) database. Based on graph database, this system uses Query Classification Algorithm (QCA) for automatic topical classification of queries. In this system, graph database is a specialization of concept information and relationships that holds between those concepts. To search required information, this system uses the classified query that is obtained by using QCA algorithm. Moreover, this system uses the Jaccard coefficient method and the column-oriented database. The proposed system intends to provide better searched Myanmar information result for users with interests of intended categories. In this system, the user can search required Myanmar information.

fisjournal-paper2020data-mining
Comparing the Performance of Machine Leaning Algorithms for Human Activities Recognition using WISDM DatasetYa Min, Yin Yin HtayMayHuman activity recognition; machine learning; data mining; tree based classifier; rule based classifier; accuracyDownload

Human activity recognition is an important area of machine learning research as it has much utilization in different areas such as sports training, security, entertainment, ambient-assisted living, and health monitoring and management. Studying human activity recognition shows that researchers are interested mostly in the daily activities of the human. Mobile phones are used to be more than luxury products, it has become a kind of urgent need for a fast-moving world with rapid development. Nowadays mobile phone is well equipped with advanced processor, more memory, powerful battery and built-in sensors. This provides an opportunity to open up new areas of data mining for activity recognition of human’s daily living. In this paper, we tested experiment using Tree based Classifiers (Decision Tree, J48, JRIP, and Random Forest) and Rule based algorithms Classifiers (Naive Bayes and AD1) to classify six activities of daily life by using Weka tool. According to the tested results Random Forest classifier is more accurate than other classifiers.

fisinternational-journal-paper2020mining
OPINION MINING AND SUMMARIZATION ON HOTEL REVIEWS USING DEEP LEARING APPROACHESDaw Myo Myo Khaing,Daw Yin Yin HtayMayText mining; Deep Learning Approach; SentiWordNet; Opinion Mining; Neural Network; Deep Neural NetworkDownload

Nowadays, many users buy goods, books, air tickets, and product and then observe about these things through the website. The buyers also share their reviews on news, hotels, movies, airline, products and other things through Web in the form of reviews comments, blogs etc. Many user can observe and read the reviews information on Web to make decisions such as buying products, going to hotel and watching movies etc. Reviews of these are difficult for buyers to read and understand content form large number of review comments on Web. More important information can be extracted from useful review using opinion mining and summarization process. In this paper, deep learning approaches and SentiWordNet (SWN) based method are presented for opinion mining from hotel reviews of Myanmar’hotels websites. The 89% accuracy result of classification on hotel reviews as positive or negative reviews are achieved by using deep learning approach. The summarization result on hotel reviews can help buyers on Web to understand review contents.

fisinternational-journal-paper2020data-mining
Performance Comparison KNN, NB and DT Classifiers by using Heart Disease DatasetYin Yin Htay, Ya MinMayComparison, KNN, NB, DT.Download

Today, the diagnosis of diseases is a vital and intricate job in medicine. Medical diagnosis is regarded as an important yet complicated task that needs to be executed accurately and efficiently. Regrettably all doctors do not possess expertise in every sub specialty and moreover there is a shortage of resource persons at certain places. In this situation, an automatic medical diagnosis system is beneficial by bringing all of them together. For this diagnosis system, many classifiers are essential and needed for disease classification. So, this system is proposed as the performance comparison system about classifiers to know which classifier is more effective than other. To compare the performance, this system classifies the heart disease dataset by using K-nearest neighbor(KNN), naive

fisinternational-journal-paper2020data-mining
CORONARY ARTERY DISEASE PREDICTION SYSTEM BY USING DECISION TREE (DT) CLASSIFIERYin Yin Htay, Ya MinMayDecision Tree, Classification, DiseaseDownload

Today, the diagnosis of diseases is a vital and intricate job in medicine. Medical diagnosis is regarded as an important yet complicated task that needs to be executed accurately and efficiently. Regrettably all doctors do not possess expertise in every sub specialty and moreover there is a shortage of resource persons at certain places. In this situation, an automatic medical diagnosis system is beneficial by bringing all of them together. For this diagnosis system, many classifiers are essential and needed for disease classification. So, this system is proposed as the coronary artery disease prediction system. For disease prediction, this system uses the decision tree (DT) classifier. This system is useful for medical domain.

fisinternational-journal-paper2020data-mining
A STUDY ON WEB MINING FOR INFORMATION RETRIEVAL TECHNIQUESYin Yin Htay, Myo Myo Khaing17 MarchData Mining; Web Mining Web Content Mining (WCM); Information Retrieval(IR)Download

Web mining is the application of data mining techniques to extract knowledge from web data, including web documents, hyperlinks between documents usage of web sites. It includes the discovery patterns from the World Wide Web. It is an iterative process of discovering knowledge and is proving to be a valuable strategy for understanding consumer and business activity on the Web. That is moving the World Wide Web toward a more useful environment in which users can quickly and easily find the information they need. Web mining uses document content, hyperlink structure, and usage statistics to assist users in meeting their information needs. Aim of this paper is to study about the concept, classification and application of Web Mining and Information Retrieval (IR) that techniques are the application of IR to the web.

fisinternational-journal-paper2020web-mining
Analysis of Signal Variation Based on Path Loss in LTE NetworkZin Mar Myo, Myat Thida Mon, 29 AugustLTE, Path loss, nonGBRDownload

Long Term Evolution (LTE) network has a drastic development in the field of telecommunication broadband wireless network. It uses several
propagation models which are available for various networks such as ad hoc networks, cellular networks, etc. Path loss is the significant concept to design and
investigate the efficient signal propagation mechanism. In this paper, we give the analysis results about signal variation concerning with path loss over the LTE network. The analysis is based on an analytical model which is the use of processor sharing queuing theory. The analysis mainly considers at non-Guaranteed Bit Rate (non-GBR) such as FTP or HTTP. This paper also presents the work on the investigation of some parameter settings of the analytical model. Finally, the analysis of signal variation concerned with analytical model will be proved by comparing with the simulation result.

fcsonline-publication proceeding-book2015mobile-network-computing
Performance Analysis of a Scheduler for Multiple Traffics of LTE NetworkZin Mar Myo, Myat Thida Mon6 February-Download

Long Term Evolution(LTE)can support multimedia services.To guarantee the different requirements of the different services, packet scheduler plays an important role in LTE. Especially, the additional challenges are exposed to the design of scheduler when real time traffics such as VoIP (voice over IP) are transmitted over the LTE network.In this paper, a new scheduler is proposed for satisfying the
different QoS requirements. This scheme distinguishes whether this connection is real time or not and give the high priority to real time traffics which are closing to time out. After scheduling all real time traffics, delay tolerant traffics are scheduled.The performance of the proposed scheduling scheme is evaluated in terms of throughput, average delay and fairness. The result will be proofed by comparing with another LTE downlink schedulers.

fcsproceeding-book2015mobile-network-computing
QoS Aware Proportional Fair (QAPF) Downlink Scheduling Algorithm for LTE NetworkZin Mar Myo, Myat Thida Mon, 5 JanuaryLTE, QoS, GBR, nonGBR, QAPFDownload

Long Term Evolution (LTE) supports several QoS (quality of services) classes and tries to guarantee their requirements. There are two main different QoS classes: Guaranteed Bit rate (GBR) such as VoIP and non-Guaranteed Bit Rate (non-GBR) such as FTP or HTTP. Having these different QoS requirements in packet domain introduces an additional challenge on the LTE MAC scheduler design. Therefore, the scheduler has to be aware of the different service requirements and satisfy them. In this paper, QoS aware proportional fair downlink scheduler (QAPF) is proposed. It can optimize the use of available resources while maintaining QoS requirements of different service classes. The result willshow the performance evaluation of the proposed scheduler by comparing with others.

fcsonline-publication proceeding-book2015mobile-network-computing
A STUDY ON WEB MINING FOR INFORMATION RETRIEVAL TECHNIQUESYin Yin Htay, Myo Myo Khaing27 MarchData Mining; Web Mining Web Content Mining (WCM); Information Retrieval(IR)Download

ABC

fisinternational-journal-paper2020web-mining
Analytical Model of the LTE Radio Scheduler for non-GBR BearerZin Mar Myo, Myat Thida MonFebruary-Download

Long Term Evolution (LTE) is a mobile network
that operates completely in packet domain. Due to the variation of radio condition in LTE, the obtainable
bit rate for active users will vary. The two factors for
radio variation are fading and path-loss. By analyzing the previous researches concerning with packet scheduling of LTE network, in this paper, an analytical model of the LTE radio scheduler is proposed. This model is based on the stochastic process to observe the system behavior mathematically and takes the details of the schedluler’s behavior taking into account given in a state of the system, i.e. the number of the active users and their distance from the base station. Instead simulation result, the numerical result is shown. This model mainly considers the path loss variation at non-Guaranteed (nonGBR) bit rate such as FTP or HTTP.

fcsproceeding-book2014simulation-modeling
COCOMO II based Software Cost Estimation for footware selling SystemYin Yin Htay, Myo Thandar Tun28 AugustCOCOMO II,Software size,estimated costs, scheduleDownload

Nowadays, software cost estimation is very important for making good management decisions. The software cost is estimated based on existing project or new project. The COCOMO II is an excellent model to estimate the cost of software engineering. The COCOMO II estimates the cost, effort and scheduling when planning new software development without wasting time and money for the users. Defining the project estimated cost, duration and effort early in the development life cycle is a valuable goal to be achieved for software projects. So, this paper presents the most effective method for software developers to estimate the cost of the projects in time. By using COCOMO II model, the proposed system estimates the software cost, the required effort to develop the footwear selling system and the schedule that is needed to complete this footwear selling software system.

fisinternational-journal-paper2019software-engineering
Consultation about the Related Frequent Patterns for Market Basket AnalysisZin Mar Myo, May Phyo OoOctober-Download

In this paper, frequent patterns are generated by using association rule mining algorithm without
candidate generation. First, frequent pattern tree structure is developed to compress a large database
into a compact structure. These structure stores complete information about frequent patterns. So
there is no need to repeat database scans. Then, for mining the complete set of frequent patterns,
FP_tree_based mining method is applied to avoid the costly generation of a large number of candidate
sets. Moreover, divide_and_conquer method is also used to decompose the mining task into a set of
smaller tasks for mining confined patterns in conditional databases. By decomposing the mining
task, the search cost can be reduced.

fcsproceeding-book-in-soft-version2008data-mining
Eliminating Noise Web Pages to Improve Web Information ExdstractionPhyoe Phyoe San, Ei Ei Moe Tun31 FebruaryNoise Detection, Noise Elimination and Web Page Cleaning.Download

Today, the main content in web page is surrounded by noise. A web page usually contains noises such as navigation panels, copyright and privacy notices, and advertisements which are not related to the topic of the web page. These noises disturb the people who want to get the main content information and make them difficult to extract the main content. Therefore, detecting the main content information in a web page could potentially improve the performance of many web applications such as information retrieval, web page clustering and classification. This paper is implemented to eliminate noises in web pages for improving web information extraction. This paper uses noise detection and web page cleaning algorithm to remove noise such as unnecessary information. This paper is implemented to clean web pages with the purpose of preventing in web mining poor results.

fislocal-conference-paper2013web-mining
Knowledge Discovering in XML Documents by using Graw AlgorithmAye Thi Tar, Ei Ei Moe Tun31 FebruaryText Mining, Association Rule MiningDownload

Text mining is an important field because of the necessity of obtaining knowledge from the enormous number of text documents. This system describes text mining technique for automatically extracting association rules amongst keywords from collections of textual documents. This system integrates XML technology with Information Retrieval scheme (TF-IDF) for keyword selection that automatically selects the most discriminative keywords for use in association rules generation and uses data mining technique for association rules discovery. This system consists of text preprocessing phase for filtration and indexing of the document, knowledge distillation phase for generating association rules by using GARW algorithm and visualisation phase for displaying results. This system extracts association rules that contain important features and describe the informative news (knowledge) that are included in the XML documents collection by using generated association rules. This system is implemented by using C# programming language.

fislocal-conference-paper2013web-mining
Image Point Matching for Color Constituent and Pixel PositionDaw ChoCho San, Daw Htet Htet LwinDecember-Download

Digital image processing means manipulation or processing an image in a computer. A comceptually simple implementation for dense image point matching between two color images is deeveloped.The system is based in the assumption that thetopology only changes slightly between the two color images. The system is assumed to be fundamently,parallel, it does not need any exact geometric information about the cameras and it can also give image point matches within similar areas of the two images. Then the system uses a simple color image matching and pixel location controller for dense image point matching between two color images and the system also gives a matching result within similar areas of the two images. The system will be praduce the result with the similarity percentage of the two images. This system can be used in Photoshop for method 1 and can also be used in security control for the change slightly between the two images for method 2.This system is implemented by Microsoft Visual Studio 2008 C #.Net.

fcsproceeding-book2010digital-image-processing
Implementing Data Warehouse for Sale Information using Data Integration and OLAP OperationZaw Ni, Ei Ei Moe Tun31 December, Data Mining, Data Warehouse, Data IntegrationDownload

Data warehouse is data intensive system that is used for analytical task in business. The term used for this task is “On-Line Analytical Processing” (OLAP). The system is implemented to build data warehouse by using data integration as data preprocessing. Data integration combines the data from multiple data sources into a coherent data source, as data warehouse. In this paper, data warehouse is a collection of information that is critical to the successful execution of enterprise initiatives. This system is used to build data warehouse through data integration issues such as schema integration and object matching, redundancy and detection and resolution of data value conflicts. To display results, the user can use OLAP operations such as roll-up, drill-down, and slice and dice operation. This system can be used business system that has many branches.

fislocal-conference-paper2011data-mining data-warehousing
Implementation of Geographic Information System for TonshipSu Pan Thaw, Ei Ei Moe Tun31 DecemberLatitude, Longitude, Catesian coordinate system, Magway GISDownload

GIS is an important technology because “Everything Happens Somewhere”. Geographical information system captures, stores, analyzes, manages, and presents data that is linked to location. The proposed system intends to supply the need for GIS in Magway Township.GIS helps as a tool with great power to know latitude, longitude and real distance of places in Magway Township. To find Latitude and Longitude, Lat-Long algorithm is used. Catesian Coordinate system is also applied to evaluate the distance between source and destination of locations. This paper will describe two types of trip planning sub-system: Text-based GIS and Map-based GIS. The proposed system supports to find the information of all places such as university, industry, army force, bridge, pagoda, supermarket and so on. The system will help to save time, money and energy.

fislocal-conference-paper2011gis
Sequential Pattern Mining in Web Log Data Using Generalize Sequential Pattern Mining(GSP) AlgorithmKhin Hsu Hlaing , Ei Ei Moe Tun31 Decemberdata mining, association, GSPDownload

The rising popularity of electronic commerce makes data mining an indispensable technology for several applications, especially online business competitiveness. The World Wide Web provides abundant raw data in the form of web access logs. However, without data mining techniques, it is difficult to make any sense out of such massive data. In this paper focus on the mining of web access log, commonly known as Web usage mining. Frequent pattern mining is a heavily researched area in the field of data mining with wide range of applications. One of them is to use frequent pattern discovery methods in Web log data. Discovering hidden information from Web log data is called Web usage mining. The aim of discovering frequent patterns in Web log data is to obtain information about the navigational behavior of the users. This can be used for advertising purposes, for creating dynamic user profiles etc.In this paper, GSP algorithm is used for sequential pattern mining in web log data.

fislocal-conference-paper2009data-mining
Dissimilarity Computation for Object of Different Variable TypesZin Nyein Nyein Han , Ei Ei Moe Tun31 Decemberdata mining, clustering, dissimilarity measuresDownload

Clustering is an essential step in data mining, statistical data analysis, pattern recognition, image processing, and can be used to drive data layout in massive distributed datasets, for example, to improve the retrieval of data subsets from tertiary systems or minimize the amount of data transferred and stored. Measuring the dissimilarity between data objects is one of the primary tasks for distance-based techniques in data mining and machine learning, e.g., distance-based clustering and distance-based classification. The quality of clustering can be accessed based on dissimilarity measures of objects which can be computed for various types of data. In this paper, we propose general framework for measuring a dissimilarity betweens various data analysis is proposed. The key idea is to consider the dissimilarity between two values of an attribute as a combination of dissimilarities between the conditional probability distributions of other attributes given these two values. In this system, the similarity is guessed by computing the dissimilarity measure between two objects. This can get the most similar values and the least similar values before clustering analysis.

fislocal-conference-paper2009data-mining
Performance Analysis of a QAPF Scheduling Scheme in LTE NetworkZin Mar Myo, Zar Lwin Phyo, Aye Thida WinDecemberLTE, Multimedia Services, OFDMA,QoSDownload

Long Term Evolution (LTE) is a cellular network that operates completely in packet domain. It can also support multimedia services. Due to this nature, provisioning the Quality of Service (QoS) requirements has become a challenge to the design of scheduler. Especially, the scheduler must guarantee for transmitting the real-time traffics such as VoIP (voice over IP). In this paper, a scheduler that satisfies the different QoS requirements is presented. This scheduler considers the additional QoS consideration to the Proportional Fair (PF), which is a well-known scheduling algorithm. As the core work of this paper, its performance is evaluated by comparing with the existing well-known schedulers. For non-real-time traffics such as file download, the performance of the scheduling scheme is evaluated by comparing with PF scheduler. For real-time traffics such as video live streaming, its performance is compared with Frame Level Scheduler (FLS).

fcsonline-journal2019network-and-information-security
A Big Data Approach to Prediction of Oil Crop Yield in Magway Region and Management of Fertilizer Usage by using Machine Learning ModelEi Ei Moe Tun25-27 JuneBig Data, Smart Farming,CNNDownload

In Myanmar economy, agriculture is an important factor for farmer. Today trend is going toward the smart farming for agriculture all over the world. And then today data analysis trend leads to big data technology and agriculture data analysis depends on big data trend. So this research is designed for big data analysis and smart farming for agriculture. Today global warming is very dangerous for crops yield and effect the low level of crops yield. So, this research is implemented to get the best oil crop yield production and to protect the low oil crops yield production due to global warming in magway region in Myanmar. Oil crops in Magway region are sesame, groundnut and some sunflower. Unplanned exploration of insecticides and fertilizers causes the low level of crop yield and risk for farmer health. And then, research want to recommend for farmer health. The propose system is designed to reach the smart farming for Myanmar agriculture. This system is pr

fismyanmar-university-research-conference-paper2020big-data-machine-learning
Replacing Same Meaning in Sentence Using Natural Language UnderstandingTin Htar New, Zar Lwin Phyo, Zin Mar MyoAugustNLP, A chunk based syntax analyzer,Intelligence methods,Machine TechniqueDownload

NLP (Natural Language Processing) can be used to communicate with computers by means of intelligence methods in a natural language. In other words, it is very useful for classification and analysis. Although there are many natural language syntax analyzers that existed before, it still remains to fulfill the requirements for analyzing English text for English to English Machine Translation. In this paper, we have proposed a chunk-based analyzer for English to English Machine Translation System. The keyword search Technique is one of the techniques of Natural Language Understanding. A simple keyword based matching technique is used for classification. Domainspecific dictionaries of keywords are used to reduce the dimensionality of feature space. The output result is that the word matched to a known word will be replaced in the given sentence, which will not be changed the original meaning

fcsonline-journal2018nlp
A System for Learning Classification Rules using Lymphatic Disease DatasetEi Ei Moe Tun15-16 September, Data mining, Classification, ELEM2Download

Data classification is an important task in KDD (knowledge discovery in databases) process. ELEM2 (Extension of Learning from Examples Modules Version 2) is a machine learning system that induces classification rules from a set of data based on a heuristic search over a hypothesis space. In this paper, a system for classifying lymphatic disease is implemented based on ELEM2 algorithm. ELEM2 is to handles inconsistent training data by defining an unlearnable region of a concept. To further deal with imperfect data,
ELEM2 makes use of the post-pruning technique to remove unreliable portions of a generated rule. A new rule quality measure is proposed for the purpose of post-pruning. In this paper, features of ELEM2, its rule-induction algorithm and its classification procedure are also described. We also report the experimental results which compare ELEM2 with C4.5 method on a number of datasets with k-fold accuracy.

fisinternaional-conference-paper2019data-mining machine-learning
Sentence Level Reordering System for Myanmar-English Machine Translation SystemAye Thida WinMayMachine Translation, Sentence level reordering, HMMDownload

Machine translation is an application of Natural Language Processing (NLP) technologies. The main issue of machine translation lies in how to map characteristics of source language (SL) to target language (TL). Languages have their own components, expressions, and word order to construct a correct order sentence. Reordering is needed in machine translation when we translate from one language to another to get correct order. In this paper, we describe rule-based reordering system for Myanmar-English sentence level reordering (MESLR) system. Reordering is important reverse words from translation process for Myanmar-English machine translation to get proper English sentence. In this paper, we generated POS movement rules, define function tag algorithm and function tag movement rules. The main process of this paper are splitting and reordering process. In the splitting process, we proposed algorithm for define function tag in the simple sentence and phrase identification algorithm to define function tag for the ambiguity sentences from Myanmar to English translation system. In the reordering process include two steps word level reordering (WLR) and phrase level reordering (PLR).

fcsonline-journal2013nlp
Syntactic Reordering Approach for Myanmar-English Machine Translation SystemAye Thida Win13-15 SeptemberSyntactic MT, Semantic MT, ReorderingDownload

In this paper, we present reordering approach which can be reordered resemble sentence from translation process. Translated word and POS’s tag with noun phrase and verb phrase are entered as input process. In Machine Translation (MT), one of the main problems to handle is word reordering. In Myanmar to English translation, word level (WLR), phrase level (PLR) and clause level (CLR) reordering are crucial important to get the correct order sentence. In this paper described Myanmar to English reordering system. This system includes two phases: Splitting sentence and Reordering sentence. In splitting sentence phase implement proposed algorithm and phrase identification algorithm for split and define function tag based on the Myanmar-English grammar patterns. The reordering sentence phase includes three process WLR, PLR and CLR. When we translated from Myanmar to English, translated words are also reverse within each phrase and such phrases are also reverse in the sentence. Some Myanmar sentences are compound sentence structure. When reordering translated compound Myanmar sentence to get the correct English order sentence must reorder as the clause sentence by the target sentence side. So, CLR algorithm is needed for translated compound Myanmar sentence. Experiments are carried out four related NLP task: WLR, PLR, CLR and function tagging, illustrating the effectiveness of the POS movement rules and algorithms.

fcsonline-publication2013nlp
Modified-MCA For Preprocessing of ClassificationMyo, Khaing, Zar Chi Su Su Hlaing15-16 SeptemberFeature Selection, Correlation, Reliability, P-value, Confidence IntervalDownload

Today the data come from various and different sources. Moreover, their sizes become larger and larger. Therefore, it is very susceptible to noisy, missing, irrelevant, inconsistent and redundant. There is a simple rule: garbage in, garbage out. It means if the input data is good the output result will be good. In machine learning, low-quality input will produce low-quality output. In other words, low-quality input cannot produce highquality reliable output. So, the preprocessing job means making the input datasets better before machine learning job. In this paper, Modified-MCA feature selection is used as preprocessing method before classification. It will remove the irrelevant or redundant features (attributes) and select the correlated ones to the class. The experiment has two comparisons. One is the classification performance of proposed preprocessing method is compared with those without preprocessed. The second is the comparison with the performance of three popular feature selection methods. In comparison, Modified-MCA produces the better results and performs better than others. Therefore, the proposed method can be applied for any data analysis and research works, such as big data analysis, image processing, pattern recognition, character recognition, bioinformatics, eGovernment data analysis, etc

fisinternaional-conference-paper2019data-mining
Proposed Myanmar Word Tokenizer based on LIPIDIPIKAR TreatiseThein Than Thwin, Aye Thida Win, Pyho Phyo Wai16-18 AprilTokenization, phonetic of myanmar words, LIPIDIPIKAR TreatiseDownload

Natural Language Processing (NLP) based technologies are now becoming important and future intelligent systems will use more of these techniques as the technology is improving explosively. But Asia becomes a dense area in NLP field because of linguistic diversity. Many Asian languages are inadequately supported on computers. Myanmar language is an analytic language but it includes special character like killer, medial, etc.. In English or European languages, all of the syllables are formed by combining the alphabets that represent only consonants and vowels but Myanmar language uses compound syllables that make more difficult to analyze. So we can face difficulties in word sorting. In our proposed system, the condensed form of Myanmar ordinary scripts will be transformed into analyzable elaborated scripts based on LIPIDIPIKAR treatise written by Yaw Min Gyi U Pho Hlaing. These elaborated words can be easily sorted by using this treatise. In our proposed system, complexity of Myanmar condensed words sorting compared with complexity of elaborated words sorting.

fcsonline-publication2010nlp
A Detection and Prevention Technique on SQL Injection AttacksZar Chi Su Su Hlaing, Myo Khaing27-28 FebruarySQL Injection Attack, Web applications, Malicious activity, Vulnerabilities, Input validationDownload

With the web advancements are rapidly developing, the greater part of individuals makes their transactions on web, for example, searching through data, banking, shopping, managing, overseeing and controlling dam and business exchanges, etc. Web applications have gotten fit to numerous individuals’ day by day lives activities. Dangers pertinent to web applications have expanded to huge development. Presently a day, the more the quantity of vulnerabilities will be diminished, the more the quantity of threats become to increment. Structured Query Language Injection Attack (SQLIA) is one of the incredible dangers of web applications threats. Lack of input validation vulnerabilities where cause to SQL injection attack on web. SQLIA is a malicious activity that takes negated SQL statement to misuse data-driven applications. This vulnerability admits an attacker to comply crafted input to disclosure with the application’s interaction with back-end databases. Therefore, the attacker can gain access to the database by inserting, modifying or deleting critical information without legitimate approval. The paper presents an approach which detects a query token with reserved words-based lexicon to detect SQLIA. The approach consists of two highlights: the first one creates lexicon and the second step tokenizes the input query statement and each string token was detected to predefined words lexicon to prevent SQLIA. In this paper, detection and prevention technologies of SQL injection attacks are experimented and the result are satisfactory

fisinternaional-conference-paper2020information-security
Word to Phrase Reordering Machine Translation System in Myanmar-EnglishAye Thida Win11-15 MarchWord Reordering, Phrase Reordering, Machine TranslationDownload

In machine translation (MT), one of the main problems to handle is word reordering. This paper focuses to design and implement an effective machine translation system for Myanmar to English language. . The framework of this paper is reordering approach for English sentence. We propose an approach to generate the target sentence by using reordering model that can be incorporated into the Statistical Machine Translation (SMTS). Myanmar sentence and English sentence are not semantic. In this paper, we present Myanmar to English translation system that is our ongoing research. Input process, tokenization, segmentation, translation and English sentence generation include in this system. In this paper, we describe about the English sentence generation. The aim of this paper is to reassemble the English word into proper sentence. The resulted raw sentence from translation process is reassembling to form the English sentence. Subject/verb agreement process, article checking process and tense adjustment process will also be performed according to the English grammar rules. The English sentence generation is proper for Myanmar to English translation system

fcsonline-publication2011nlp
Implementing Travelling Salesman Problem using Modified Ant Colony Optimization AlgorithmZar Chi Su Su Hlaing, G R Sinha, Myo KhaingNovember, , combinatorial optimization, stagnation behavior, adaptive behavior, dynamic candidat set, adapting parameterDownload

In this chapter, the main modifications induced by ant colony optimization (ACO) are presented. In fact, the traveling salesman problem (TSP) could easily be solved by using an improved version of the ant colony optimization method. The same is attempted in this chapter. There are two main ideas in the proposed algorithm for the modification of the ant algorithm. The first phase involves defining the candidate set which is applied to the construction of the ant algorithm. The solution construction phase includes defining the value of exploitation parameter q0. The second phase focuses on the variation of pheromone information that is used to adapt the heuristic parameter automatically throughout the algorithm runs. Additionally, a local search algorithm is applied to all the solutions that are produced by ACO and thus the performance of ACO is improved for TSP related applications.

fisbook-chapter2019artificial-intelligence combinatorial-optimization swarm-intelligence
Analysis for Travelling Salesman Problem using Improved Ant Colony Optimization AlgorithmZar Chi Su Su HlaingSeptember, , combinatorial optimization, stagnation behavior, adaptive behavior, dynamic candidat set, adapting parameterDownload

Ant Colony Optimization (ACO) is a recent algorithm used for solving optimization problems and is the model on the behavior of real ant colonies. It has been used exclusively for solving problems in the combinatorial optimization domain. Traveling salesman problem (TSP) is one of the well-known and extensively studied problems in combinational optimization and used to find the shortest roundtrip of minimal total cost visiting each given city (node) exactly once and it can be applied to solve many practical problems in real life. ACO is a good search capability and a high-performance computing method for TSP. But, the traditional ACO has many drawbacks such as stagnation behavior, trapping in local optimal and premature convergence. This paper implements and evaluates a specialized version of ant colony optimization capable of searching in travelling salesman problems and evaluates its performance under a range of conditions and test cases. The proposed system is an improved ant colony optimization algorithm with dynamic candidate set strategy is adopted to rapid convergence speed and adapting parameter to improve the performance in solving TSP. Algorithms are tested on benchmark problems from TSPLIB and test results are presented. From our experiments, the algorithm has better performance on TSP and analysis results are presented.

fisinternational-journal-paper2019artificial-intelligence combinatorial-optimization swarm-intelligence
Clause Level Reordering for Myanmar-English Translation SystemAye Thida Win28-29 FebruaryMyanmar-English Machine Translation, Clause Level ReorderingDownload

Machine Translation (MT), one of the main problems to handle is word reordering. Myanmar Language and English Language are linguistically different language pairs. Myanmar language is a verb fibal language and English language is a verb initial language. After Myanmar to English translation process, translated English words are needed to reorder to produce proper order of English sentence. Sentence level reordering system consists of word level, phrase level and clause level reordering processes. In order to get the correct order of English sentence, we propose Clause Level Reordering (CLR) algorithm and article checking algorithm for Myanmar to English translation system by mapping English grammar patterns. CLR algorithm can reorder the disorder words and it can also add relative words which are not contain in the translated sentence. Article missing words are added by using Article Checking Algorithm. We evaluate the effectiveness of proposed CLR algorithm with compound and complex English sentence.

fcsproceeding-book2012nlp
Phrase Reordering Translation in Myanmar-EnglishAye Thida Win5-6 MayMachine Translation, Phrase ReorderingDownload

Machine Translation is the attempt to automate all or part of the process for translation from one human language to another. This definition involves accounting for the grammatical structure of each language and using rules and grammars to transfer the grammatical structure of the source language (SL) into the target language (TL). Myanmar to English machine translation can be used to facilitate learning in beginner of MyanmarEnglish language learner or vice versa and to help them to study of grammar, Myanmar and English languages are linguistically different language pairs. The aim of this paper is to reassemble from the not ordering set of English word into proper English sentence. In this paper proposed the position of English POS tag rules. The resulted raw sentence from translation process is reassembling to form the English sentence. In this system, especially we consider subject/verb agreement process, article checking process and tense adjustment process will also be performed according to the English grammar rules. The proposed system of this paper is reordering approach for English sentence. Our proposed system, we considered the position of English POS tags and then which are swapping to get the proper English sentences by using the reordering rules and mapping the English grammar patterns.

fcsproceeding-book2011nlp
Syntactic Reordering Machine Translation System for Myanmar-EnglishAye Thida WinDecemberMachine Translation, Syntatic reorderingDownload

Machine translation is the attempt to automate all or part of the process for translation from one human language to another. In syntax-based statistical translation model operation capture linguistic differences such as word order and case tracking. In Machine Translation (MT), one of the main problem to handel is word reordering. Informally, a word is reordered when it and its translation occupy different positions within the corresponding sentences. Syntactic reordering approaches are an effective method for handling systematic differences in word order between source and target languages within the context of Statistical Machine Translation (SMT) system. This paper applied syntactic reordering to Myanmar-English translatin. In this paper, we presented reordering approach which can be reodered resemble sentence from translation process. Translated word word and POS’s tag with noun phrase and verb phrase are entered as input process. This system reordered raw sentence to get proper English sentence by mapping English grammar patterns. First, movement POS position has based on the correct position text file. Second, define function tag process has based on the reordering algorithm. This system presented reordering pattern and rules of POS position which can be used word level and phrase level.

fcsproceeding-book2011nlp
Framework of Phrase Reordering Machine Translation System in Myanmar-EnglishAye Thida WinDecemberReordering, Natrual Language Processing, Machine TranslationDownload

In Machine translation (MT), one of the main problems to handle is word reordering. This paper focuses to design and implement an effective machine translation system for Myanmar to English language. . The framework of this paper is reordering approach for English sentence. We propose an approach to generate the target sentence by using reordering model that can be incorporated into the Statistical Machine Translation(SMT). In this paper, we present Myanmar to English translation system that is our ongoing research. Input process, tokenization, segmentation, translation and English sentence generation includ in this system. In this paper, we describe about the English sentence generation. The aim of this paper is to reassemble the English word into proper sentence. The resulted raw sentence from translation process is reassembling to form the English sentence. Subject/Verb agreement process, article checking process and tense adjustment process will also be performed according to the English grammar rules. The English sentence generation is proper for Myanmar to English translation system.

fcsproceeding-book2010nlp
Online Asean Directory System Based On Mobile AgentEi Khaing Zaw ,Zaw Win MyintDecemberMobile agent; WebpageDownload

Mobile Agent technology has the ability to travel from one host to another in a network and to choose the places they want at the same time. Proposed systims are computational software processes capable of roaming World Wide Web, interacting with foreign hosts, gathering information on behalf of its owner,and coming ‘ back home’ after performing the dyties set by its owner. Nowadays , as the amount of information on the Web has increased rapidly, it becomes more difficult for common web users to get information which they reqrire. In order to solve such kinds of problems, information retrieval system based on mobile agent is propose to give the users the relevant information according to his/her location.

fcsproceeding-of-international-conference2012multi-agent-system
Modified Ant Colony Optimizaiton Algorithm for Solving Traveling Salesman ProblemZar Chi Su Su Hlaing25-26 February, , ant colony optimiztion, traveling salesman problem, candidate list, local searchDownload

Ant Colony Optimization (ACO) is a useful approach for finding near optimal solutions in polynomial time for Nondeterministic Polynomial time (NP) problems. Traveling salesman problem (TSP) is a typical NP hard problem in path optimization, and ACO algorithm is an effective way to solve TSP. However, when the problems come to high dimensions, the traditionalant algorithm works with low efficiency and accuracy, and usually trap in local optimal solution. To overcome the shortcoming of the algorithm, this paper proposes a modified ant colony optimization algorithm which combines candidate list strategy and local search to improve the efficiency and accuracy of the algorithm. Experiments are carried out to verify the availability and analyze the performance of the proposed algorithm. The results illustrate the higher efficiency of the proposed algorithm to solve TSP, comparing with ant colony algorithm and prove that the proposed algorithm is a positive effective way to tackle TSP.

fisinternaional-conference-paper2016artificial-intelligence combinatorial-optimization swarm-intelligence
Review On Continuous Speech Recognition SystemZaw Win Myint, Yin Win Chit, Phyoe Theingi KhaingMarchDeep Belief Network, Deep Neural Network, Support Vector Machines, Convolutional Neural Network, Artifical IntelligenceDownload

This Automatic Speech Recognition (ASR) System translates the human’s speech signal into text words and it has still many challenges in the Myanmar continuous speech signal. The deaf people can’t communicate with each other based on human’s speech and can’t hear broadcast news at every station that need for them in travelling. But deaf people also need to communicate with everybody and need to know about the broadcast news everywhere. This system is design to recognize the greedy words in daily communication for deaf people. First of all, the daily communication words and broadcast news is gathered in a sound database. The audio (.wav) file of daily communication words speech is used as the input of the system. After passing the pre-processing step, these speech audio files are segmented using dynamic thresholding method based on time and frequency domain features. Then important features of segmented speech signal are extracted by Mel Frequency Cepstral Coefficient (MFCC). Especially, DCNN-AlexNet has been applied in image processing because it can perform as a highly accurate, effective and powerful classifier. In the training and classification step of this system, the advantages of DCNN in image processing are applied using the MFCC feature images. In this system, two types of input features are used, the traditional MFCC features and converted MFCC features images from the speech signal (.png format). Then these features are trained to build the acoustic model and are classified using Deep Convolutional Neural Network (DCNN) classifier. Finally, the continuous speech sentence is recognized as Myanmar text using codebook. The experiments shows that the DCNN speech recognition system achieves the average Word Error Rate (WER) of 12.5 % on the MFCC images training dataset and WER of 16.75% on the original MFCC features value training dataset.

fcsonline-publication2020digital-signal-processing
Solving Traveling Salesman Problem by Using Improved Ant Colony Optimization AlgorithmZar Chi Su Su Hlaing, May Aye KhineDecember, , ant colony optimiztion, entropy traveling salesman problemDownload

Ant colony optimization (ACO) is a heuristic algorithm which has been proven a successful technique and applied to a number of combinatorial optimization problems and is taken as one of the high performance computing methods for Traveling salesman problem (TSP). TSP is one of the most famous combinatorial optimization (CO) problems and which has wide application background.. ACO has very good search capability for optimization problems, but it still remains a computational bottleneck that the ACO algorithm costs too much time to convergence and traps in local optima in order to find an optimal solution for TSP problems. The presented paper proposes an improved ant colony optimization algorithm with two highlights. First, candidate set strategy is adopted to rapid convergence speed. Second, a dynamic updating rule for heuristic parameter based on entropy to improve the performance in solving TSP. Algorithms are tested on benchmark problems from TSPLIB and test results are presented. From our experiments, the proposed algorithm has better performance than the conventional ACO algorithm and the results of the proposed algorithms are found to be satisfactory

fisinternaional-conference-paper2011artificial-intelligence combinatorial-optimization swarm-intelligence
An Ant Colony Optimization Algorithm for Traveling Salesman ProblemZar Chi Su Su Hlaing, May Aye Khine16 December, , ant colony optimiztion, traveling salesman problem, entropy, parameter tuningDownload

Ant Colony Optimization (ACO) is a class of heuristic search algorithms that have been successfully applied to solving combinational optimization (CO) problems. The traveling salesman problem (TSP) is among the most important combinatorial problems. ACO has very good search capability for optimization problems. But it still has some drawbacks such as stagnation behavior, long computational time, and premature convergence problem of the basic ACO algorithm on TSP. Those problems will be more obvious when the complexities of the considered problems increase. The proposed system based on basic ACO algorithm based on well-positioned the ants on the initiation and information entropy which is applied to tuning of the algorithm’s parameters. Then, ACO for TSP has been improved by incorporating local optimization heuristic. Therefore, the proposed system intends to reach superior search performance over traditional ACO algorithms do.

fislocal-conference-paper2010artificial-intelligence combinatorial-optimization swarm-intelligence
Agent-Based E-Commerce Workflow SystemWai Mi Mi Thaw ,Zaw Win MyintDecemberMobile agent; Web pageDownload

In this paper,an agent-based e-commerce workflow system is performed to help in eliminating ptoblems in e-commerce domain by using agent-based approach. In e-commerce,these es always aproblem of searching a right item in less time without involving the contractors. Both intelligence agent and workflow technology have been applied to business process mnagement. Using these two techniques, the market framework offers time saving and flexibility through interaction among the agents. The system in this paper involves order capture process,order processing process and order fulfillment process in purchasing the supermarket items. These processes are provided by order capture agent order process agent,order fulfillment agent and storage agent.In this system, agents perform different functions when it comes to the online order. Agents can provide refined search and purchasing various items in supermarket in order to takecare of the customer needs. The system in this paper utlizes the dataset of KaungMon supercenter in Magway Township.

fcsproceeding-of-international-conference2011intelligent-agent
Word Stemming Using Porter Stimming AlgorithmSaw Myat Khaing,Zaw Win MyintDecemberStemming technique: Data analyzingDownload

Word stemming is document processing that groyps documents with similar concept. Stemming is very useful and important technique for analyzing data. Porter Stemmer is a very widely used and available. Stemmer and is used in many applications. Stemming algorithms can be used in search engines such as Lycos and Google, and also thesaurases and other products using Natural Languange Processing (NLP) for the purpose of Information Retrieval (IR).IR is essentially a matter of deciding which documents in a collection should be retieved to satisfy a user’s need for information. Stemming algorithm, or stemmer which attempt to reduce a word to its stem or root form has been developded. The key terms of a query of document are represented by stems rather than by the original words. Stemming has many algorithms, among them this system uses porter stemming algorithm.

fcsproceeding-of-international-conference2012database-management-system
An Improved Ant Colony System Based on Dynamic Candidate Set and Entropy for Traveling Salesman ProblemZar Chi Su Su Hlaing, May Aye Khine28-29 February, , ant colony optimiztion, traveling salesman problem, candidate listDownload

The Ant Colony Optimization (ACO) is a metaheuristic algorithm used for combinatorial optimization problems. It is a good choice for many hard combinatorial problems because it is more efficient and produces better solutions than greedy algorithms. However, ACO is computationally expensive and it can still trap in local optima, take a long time to compute a solution on large problem sets and premature convergence problem. The main idea of the modification is to limit the number of elements choices to a sensible subset, or candidate list, which can limit the selection scope of ants at each step and thus substantially reduce the size of search space and to measure the uncertainty of the path selection and evolution by using the information entropy self-adaptively. Simulation study and performance comparison on Traveling Salesman Problem show that the improved algorithm can converge at global optimum with a high probability. It also shows a faster convergence to the solutions than the standard algorithm.

fisinternaional-conference-paper2012artificial-intelligence combinatorial-optimization swarm-intelligence
An Approach for Solving Traveling Salesman Problem using Hybrid Ant Colony OptimizationZar Chi Su Su Hlaing, May Aye Khine5-6 May, , ant colony optimiztion, traveling salesman problem, nearest neighbour heuristicDownload

Traveling salesman problem (TSP) is one of the most famous combinatorial optimization (CO) problems, which has wide application background. Ant Colony Optimization (ACO) is a heuristic algorithm which has been proven a successful technique and applied to a number of combinatorial optimization problems and taken as one of the high performance computing methods for TSP. ACO has very good search capability for optimization problems, but it still has some drawbacks for solving TSP. These drawbacks will be more obvious when the problem size increases. The present paper proposes an ACO algorithm with nearest neighbor (NN) heuristic approach and information entropy which is conducted on the configuration strategy for the adjustable parameters to improve the efficiency of ACO in solving TSP. The performance of ACO also depends on the appropriate setting of parameters. Then, ACO for TSP has been improved by incorporating local optimization heuristic. Algorithms are tested on benchmark problems from TSPLIB and test results are presented. From our experiments, the proposed algorithm has superior search performance over traditional ACO algorithms do.

fisinternaional-conference-paper2011artificial-intelligence combinatorial-optimization swarm-intelligence
Agent-Based Auction System For Online MarketLae Lae Shwe ,Zaw Win MyintDecemberContract Net (CNET) Protocol ; Multi agentDownload

In this paper, Contract Net (CNET) Protocol theory in multi-agent systin is applied to improve the auction techniqyes. Using intelligence agent technology, the market framework offers time saving automation of auctions and flexibility throygh negotiations among the agents.Agents may perform different functions when it comes to the online auction. They can participate in auction selected by the user,being responsible for the bidding process of participating agents. The agent-based aution can be used as a proven mechanism for fast and efficient price allocation. The design of auctioneer agent that makes decisions on behalf of seller and buyer agents is also presented. Proposed agent-based auction sysrim is expected to improve the quality of service in electronic commerce.

fcsproceeding-of-international-conference2011intelligent-agent
An Ant Colony Optimization Algorithm for Solving Traveling Salesman ProblemZar Chi Su Su Hlaing, May Aye Khine14-15 October, , ant colony optimiztion, traveling salesman problem, entropyDownload

Ant Colony Optimization (ACO) is a heuristic algorithm which has been proven a successful technique and applied to a number of combinatorial optimization (CO) problems. The traveling salesman problem (TSP) is one of the most important combinatorial problems. ACO is taken as one of the high performance computing methods for TSP. It still has some drawbacks such as stagnation behavior, long computational time, and premature convergence problem of the basic ACO algorithm on TSP. Those problems will be more obvious when the considered problems size increases. The proposed system based on basic ACO algorithm with well distribution strategy and information entropy which is conducted on the configuration strategy for updating the heuristic parameter in ACO to improve the performance in solving TSP. Then, ACO for TSP has been improved by incorporating local optimization heuristic. Algorithms are tested on benchmark problems from TSPLIB and test results are presented. From our experiments, the proposed algorithm has better performance than ACO algorithm.

fisinternaional-conference-paper2011artificial-intelligence combinatorial-optimization swarm-intelligence
Estimating The Project Duration By Using Critical Path MethodNyein Zaw Win ,Zaw Win MyintDecemberCritical Path ; Tree structure ; Project estimation; Gantt chartDownload

Project scheduling involves the creation of various graphical representations of part of the project plan. These include activity charts showing the interrelationships of project activities. The Critical Path is the longest path with the shortest duration, or the shortest amount of time in which a project can be successfully completed.A delay on any one activityon the Critical Path Method (CPM) computer software packages, only afew minutes are required to input the information and generate the critical path. If the projedt manager wants to meet the deadline of the project completion date, the system provides the supporting information, which provides the best critical path that estimate the completion time of the project. In this paper,the estimation of project duration with the Critical Path is presented.This Critical Path of the given project is shown with tree structure. And then the project estimation is shown with Gantt chart.

fcsproceeding-of-international-conference2010software-engineering
Finding Minimum Spanning Tree By Using Prim And Kruskal AlgorithmsKhin Thet Mon ,Zaw Win MyintDecemberMinimum Spanning Tree; Kruskal; PrimDownload

Finding a minimun spanning tree of a given weighted graph G (V,E) is an important graph problem. A minimum spanning tree is a tree formed from a subset of the edges in a given undirected graph, with tow properties: (1) it spans the graph, i.e, it includes every vertex in the graph, and (2) it is a minimum, i.e, the total weight of all the edges is as low as possible. In this paper, minimum apsnning tree is found in a connected graph with edge weight.For the purpose, Kruskal’s and Prim’s algorithm are applied. Then these two algorithms are compared with weight-graph and run-time graph. The implemented system intends to show a graph theory applide to find shortest path by using a minimum spanning tree.

fcsproceeding-of-international-conference2010artificial-intelligence
Prevention for cancer diseases associated with vegetablesAye Aye BoAugust, Volume 4, Issue 8Harvard-Led Physicians health, Cancer, Associations, VegetablesDownload

Vegetables are important for human health because of their vitamins, minerals, phytochemical compounds, and dietary fiber content. Especially antioxidant vitamins (vitamins A, vitamins C, and vitamins E) and dietary fiber content have important roles in human health. Adequate vegetable consumption can be protective some chronic diseases such as diabetes, cancer, obesity, metabolic syndrome, cardiovascular diseases, as well as improve risk factors related to these diseases. Fruits and vegetables are universally promoted as healthy. Fruits and vegetables include a diverse group of plant foods that vary greatly in content of energy and nutrients. Fruits and vegetables also supply vitamins and minerals to the diet and are sources of phytochemicals that function as antioxidants, phytoestrogens, and anti-inflammatory agents and through other protective mechanisms. Multivitamins may slightly reduce the risk of cancer but don’t prevent heart disease. There is a wealth of data available within the health care system. Advanced data mining techniques can help medial situations. The Harvard-Led Physicians Health Study II (PHS II) recently found that taking a multivitamin slightly lowers the risk of being diagnosed with cancer. Fruits and vegetables contain many biologically active ingredients that may help to prevent cancer in ways that vitamins and minerals alone do not. The PHS II was the first study to test a standard multivitamin for the prevention of chronic disease. The cardiovascular disease portion of the study focused on whether taking a multivitamin reduced the risk of heart attacks, strokes, and death from cardiovascular disease. It’s important not to overplay the benefit that PHS II found for preventing cancer. What you eat and don’t eat can have a powerful effect on your health, including your risk for cancer. We conducted a systematic review and meta-analysis to clarify these associations.

itsmjournal2019data-mining
Finding Frequent Itemsets by using Hash-based TechniqueYin Win Chit ,Zaw Win MyintDecemberDatarbase Management System; Hash based techniqueDownload

In data mining,finding frequent itemset plays an important role which is used to identify the correlations among the fields of database. This paper is idended to introduce the general concept of frequent itemsets mining. Finding such frequent pattns plays an essential role in mining associations, correlation, clustering and other data mining tasks ass well. In this paper we present an algorithm hash-based which hashing technology to store the database in horizontal data format. This paper is implemented for finding frequent itemsets on crops data set. By using this system user can reduce the size of candidate generation this system improves the efficiency of apriori method by using hash table directly. The main purpose of this paper is to find the optimal item sets by using the hash based technique.

fcsproceeding-of-international-conference2010data-mining
Contract Net Protocol based-On Multiagent System for Desirable Jeep CarSaw Win,Zaw Win Myint30 DecemberContract Net Protocol ; Multiagent SystemDownload

This paper use Contract Net Protocol based-on multiagent system for purchasing car system.Normally, buyer look for desire car with search engine or buyer must go every industrial Zone or Company (produce jeep car) for desire jeep car.Perhaps you are Lucky and find a map showing how to get to Industrial Zone Or Company. This system using Contract Net Protocol could solve these problems.Contract Net allows tasks to be distributed among a group of agents.One of the most promising uses for Contract Net is to create an electronic marketplace for buying and selling goods. In this agency system, the buyer/customer certainly goes to this system and he/she can view car design and car data. And then, he/she can choose desire jeep car by selecting car’s items.This system automatically choosing suitable jeep car for user. Not to navigate to the every Industrial Zone or Company because this system is special for customers who will buy Jeep car.

fcsproceeding-of-international-conference2009artificial-intelligence
Making a Medical Decision for IFR Rate by Using Fuzzy LogicTin Yatanar Zaw , Hla Hla Myint31st DecemberFuzzy Logic IFR rate (Intravenous Fluid Resuscitation)Download

The paper aims to precise a medical decision making for IFR (Intravenous Fluid Resuscitation) rate at ICU (Intensive Care Unit) using Fuzzy Logic. Intensive care medicine frequently involves making rapid decision. To make medical decisions, physicians often rely on conventional wisdom and personal experiences to arrive subjective assessments and judgments. The methods of Fuzzy Logic are suited to the nonexplicit nature of clinical decision making. So, this system implements fuzzy logic to administer the rate of Intravenous Fluid Resuscitation (IFR).The paper introduces a simple and effective methodology for making a medical decision based on fuzzy logic. Finally the system produces the adjusted IFR rate.

itsmconference2011artificial-intelligence
SLA guaranteed migration decision model using MCDM approachZar Lwin Phyo, 29 AugustAHP, PROMETHEE, QoS, SLA, Virtualized Data CenterDownload

In Virtualized Data Center (VDC), the workload in each node changes dynamically overtime, so the workload in some machines may exceed the threshold, which not only cannot guarantee the quality of service requirements (QoS), but also waste resources. One of the key benefits of virtualization is reassignment of a virtual machine to another physical host can be done when resource shortage or poor utilization conditions occurs in host. However, in this case, efficient migration decision is required to reduce migration cost and ping-pong effect. In this paper, we propose SLA guaranteed migration decision model for resource management in VDC based on the integrated approach of Analytical Hierarchy Process (AHP) and the Preference Ranking Organization METHod for Enrichment Evaluations (PROMETHEE). In this case, AHP is used to assign weights to the criteria to be used in selection phase, while PROMETHEE is employed to determine the priorities of the
alternatives.

fcsonline-publication proceeding-book2015virtualization
Comparison of Binning Methods By Using Naïve Bayesian ClassificationThein Kyawe ,Moe Moe HlaingDecemberData Analytics, Naïve Bayes, Binning methods, Hold outDownload

Data Mining is a multidisciplinary field which supports knowledge workers who try to extract information in our “data rich, information poor” environment. Its names stems from the idea of mining knowledge from large amounts of data. The tools of data mining such as Decision Tree Induction, Naïve Bayesian Classification and Genetic Algorithm provide assist us in the discovery of relevant information through a wide range of data analysis techniques. Any method used to extract patterns from a given data source is considered to be a data mining technique. This system classifies the class label of unknown records by using Naïve Bayesian Classification tool. Classification is the forms of data analysis that can be used to extract models describing important data classes. This paper emphasizes on different types of binning methods with numerical data, each of which was tested against the Bayesian classification methodology. Holdout method is used to access the accuracy of the classifier. Testing is made using any data sets. This system implemented by using Microsoft Visual studio 2008 and Microsoft Access tools.

itsmconference2010data-mining
Correlation Based VMs Placement Resource ProvisionZar Lwin Phyo, Thandar Thein, Februaryconsolidation, resource provisioning, resource utilization, SLA, Virtualized Data CenterDownload

In Virtualized Data Center (VDC), a single Physical Machine (PM) is logically divided into one or more Virtual Machines (VMs) that share physical resources. Therefore, dynamically resource provisioning plays an important role in VDC. Moreover the resource provider would like to maximize resource utilization, which forms a large portion of their operational costs. To achieve this goal, several consolidations can be used to minimize the number of PMs required for hosting a set of VMs. However, consolidation is often undesirable for users, who are seeking maximum performance and reliability from their applications. These applications may indirectly increase costs due to under-provisioning of physical resources. Moreover frequent Service Level Agreement (SLA) violations result in lost business. To meet SLA requirements, over provisioning of resources is used. However, if the services do not use all the CPU they have been allocated; the provider will suffer from low resource utilization, since unused resources cannot be allocated to other services running in the provider. Therefore VM provisioning is the most vital step in dynamic resource provisioning. In this paper, correlation based VMs provisioning approach is proposed. Compared to individual-VM based provisioning, correlation based joint-VM provisioning could lead to much higher resource utilization. According to the experimental results, proposed approach can save nearly 50% CPU resource in terms of overall CPU utilization.

fcsonline-publication proceeding-book2013virtualization
Interactive Tutorial Framework for Online LearningMin Min Naing , Moe Moe HlaingApril, 2020 Volume 5, Issue 4Interactive, Tutorial, Online LearningDownload

Nowadays, online learning, teaching and online tutorial have become popular as higher education. Online learning is the delivery of learning, training or educational program according to the electronic means. So, this system is intended to develop an interactive tutorial website for online learners. A web based tutorial is a complete program whose purpose is to assist users in learning. It is a method of transferring knowledge, interactive set of instructions to teach by example. The online tutorial framework is the technique of representing a small kind of exam by a computer program. So, this system will examine the student study level by answering the random comprehensive questions. This system enhances the quality and improves the accessibility within education domain.

itsmjournal2020web-engineering
CPU Usage Prediction Model for Virtualized Data CenterZar Lwin Phyo, Thandar TheinFebruaryCPU Usage Prediction, Machine Learning, SLA, Virtualized Data CenterDownload

In Virtualized Data Center (VDC), a single Physical Machine (PM) is logically divided into one or more Virtual Machines (VMs) that share physical resources. Therefore, dynamically resource provisioning plays an important role in VDC. Moreover the resource provider would like to maximize resource utilization, which forms a large portion of their operational costs. To achieve this goal, several consolidations can be used to minimize the number of PMs required for hosting a set of VMs. However, consolidation is often undesirable for users, who are seeking maximum performance and reliability from their applications. These applications may indirectly increase costs due to under-provisioning of physical resources. Moreover frequent Service Level Agreement (SLA) violations result in lost business. To meet SLA requirements, over provisioning of resources is used. However, if the services do not use all the CPU they have been allocated; the provider will suffer from low resource utilization, since unused resources cannot be allocated to other services running in the provider. Therefore VM provisioning is the most vital step in dynamic resource provisioning. In this paper, correlation based VMs provisioning approach is proposed. Compared to individual-VM based provisioning, correlation based joint-VM provisioning could lead to much higher resource utilization. According to the experimental results, proposed approach can save nearly 50% CPU resource in terms of overall CPU utilization.

fcsproceeding-book2013virtualization
Multi Criteria Decision Making for Resource Management in Virtualized EnvironmentZar Lwin Phyo, Thandar TheinFebruaryMCDM approach, QoS, SLA, Virtualized Data CenterDownload

The workload in each node changes dynamically over time in large-scale data centers, so the workload in some machines may exceeds the threshold, which not only can’t guarantee the quality of service requirements (QOS), may also waste resources. One of the key benefits of virtualization is reassignment of a virtual machine to another physical host can be done when resource shortage or poor utilization conditions occurs in host. In this paper, we proposed the decision support system for resource management in Virtualized Data Center (VDC) based on the integrated approach of Analytical Hierarchy Process (AHP) and the Preference Ranking Organization METHod for Enrichment Evaluations (PROMETHEE). In this case, AHP is used to assign weights to the criteria to be used in selection phase, while PROMETHEE is employed to determine the priorities of the alternatives.

fcsproceeding-book2012virtualization
Best resource node selection in Grid EnvironmentZar Lwin PhyoMayRought Sets,Grid Computing, resource selectionDownload

Grid computing can provide abundant resources to assist many studies and it can be employed in more and more projects that have so far yielded numerous findings. However, in grid environment, many distributed resources are integrated in different sites and resources are often shared by multiple user communities and can vary greatly in performance and load characteristics. Therefore, a central problem in grid environment is the selection of computation nodes for execution. Automatic selection of node is complex as the best choice depends on the user request structure as well as the expected availability of computation and communication resources. This paper considers the ongoing research on Rough Sets based selecting the best resource node in computational grid. Our node selection method is based on the CPU capacity, communication bandwidth and memory and disk availability on the resource nodes. The goal of this paper is to enable the automatically select the best available resource node on the network for execution within a reasonable time. In this paper, random data is used to test the validity of proposed method. The result showed that this method can provide the suitable probability of the best resource selection.

fcsproceeding-book2011grid-computing
Decision Support System for Dynamic Resource Management in Virtualized Data CenterZar Lwin PhyoDecemberAHP, PROMETHEE, QoS, SLA, Virtualized Data CenterDownload

Virtualization has many advantages such as less cooling cost, hardware and software cost and more manageability. One of the key benefits is better load balancing by using of Virtual Machine (VM) migration between hosts, however, VM migration depends on an efficient decision support and variety of criteria is required. In this paper, we present an evaluation model for the decision support of VM migration in Virtualized Data Center (VDC) based on the analytical hierarchy process (AHP) and the Preference Ranking Organization METHod for Enrichment Evaluations (PROMETHEE)

fcsproceeding-book2011virtualization
Best resource node selection using rough sets theoryZar Lwin Phyo, Aye ThidaMarchgrid computing, rough set, resource selectionDownload

In Grid computing, the problem of selecting resources to specific jobs can be very complex, and may require co-allocation of different resources such as specific amount of CPU hours, system memory and network bandwidth for data transfer, etc. Because of the lack of centralized control and the dynamic nature of resource availability, any successful selection mechanism should be highly distributed and robust to the changes in the Grid environment. Moreover, it is desirable to have a selection mechanism that does not rely on the availability of coherent global information. This paper considers selection method in grid environment using rough set theory, which could select the best node in grid environment. The proposed method is designed to achieve the following goals: handling large number of incoming requests simultaneously; assigning each service efficiently to all the incoming requests; selecting the appropriate services for the incoming requests within a reasonable time. Random data is used to test the validity of proposed method in this paper. The result showed that this method can provide the suitable probability of the best node selection.

fcsonline-publication2011grid-computing
Identifying Abbreviation and its Definition from Text String by Using LCS Algorithmkhin Myo Han , Tin Tin Thein30th DecemberAbbreviation, Text String, LCS AlgorithmDownload

The understanding of abbreviations, widely used in writing is an important role for natural language processing (NLP) applications. Many abbreviations are followed a predictable pattern in which the first letter of each word in the definition corresponds to one letter in the abbreviation. Abbreviations detection is an important task of the dictionary building with their definitions. In this system, abbreviation and their definitions are implemented by using Longest Common Subsequence (LCS) algorithm. Additionally, this system is provided a method, pattern based rule together with the LCS algorithm. Thus, the simplicity of how abbreviations are formed from their definition is also described in this system. As a result, the extracted abbreviations are created into a large update database, a dictionary about computer literature. This system is implemented by C# programming language.

itsmconference2009artificial-intelligence
Implementation of Shortest Path Finding System by Using Kruskal AlgorithmHtike Htet Aung , Dr Win Win ZawAugust , 3Graphs,shortest path, minimum-cost spanning tree, Kruskal AlgorithmDownload

Graphs have been used in a wide variety of application. Some of these applications are analysis of electrical circuits, finding shortest routes, project planning, and identification of chemical compounds, statistical mechanics, genetics, and social sciences and so on. Indeed, it might be well said that of all mathematical structures, graph are the most widely used.  This paper is intended to study how a graph theory applied to find shortest path by using a minimum spanning tree. In this study, it is implemented popular locations of the Mandalay City as the vertices of an undirected Graph. In this system, the associated distances between each location are represented as weight of the edges of the graph. There are three different algorithms to obtain a minimum-cost spanning of a connected, undirected graph. Our shortest path finding system is focused on Kruskal Algorithm.

Keywords: Graphs, shortest path, minimum-cost spanning tree, Kruskal Algorithm

itsmconference2009artificial-intelligence
Quality Analysis of Pseudorandom Number Generator Using Rough SetsAye Myat Nyo, Zar Lwin Phyo, May Mar Oo, Chaw Yupar Soe, Thein Than Thwin, Aye Thida, Than Naing SoeJuneseed, pseudorandom sequence, search approach, data mimng, decision ruleDownload

In this paper, a rough sets based analyzing system for Pseudorandom Number Generator (pRNG) is proposed to analyze the quality of the pseudorandom number generators. The strength of the cryptosystem relied on the quality of PRNGs. In particular, their outputs must be unpredictable in the absence of knowledge of the inputs and the input can not be guessed. On the other hand, the advance in computer science and technology let to produce the sufficient amount of sequence numbers of all possible input (seeds) and can be stored in a database. By means of the rough set approach, the input (seeds) can be guessed from those databases, using the known output sequence. So, the quality analysis of the (pRNGs) and a simple rule based prediction system is presented in this paper and the design of generators is outside the scope of this paper.

fcsonline-publication2010cryptography
Predictive maintenance for veheicles services by using data mining techniquesAye Aye BoJuly, Volume 4, Issue 7Fleet management systems, Data mining, Maintenance, Vehicle serviceDownload

A well-planned data classification system makes essential data for easy to use and finds and retrieves the data. At the point, when an individual considers buying a vehicle, there are many aspects that could impact his/her choice on which kind of vehicle he/she is interested in. Even if a brand new motor vehicle, it could be a failure in any component without maintaining and serviced a short period. Vehicle uptime is getting increasingly important as the transport solutions become more complex and the transport industry seeks new ways of being competitive. Traditional Fleet Management Systems are gradually extended with new features to improve reliability, such as better maintenance planning. Typical diagnostic and predictive maintenance methods require extensive experimentation and modeling during development. This paper investigates unsupervised and supervised methods for predicting vehicle maintenance. The methods rely on a telematics gateway that enables vehicles to communicate with a back-office system. These are later associated with the repair history and form a knowledge base that can be used to predict upcoming failures on other vehicles that show the same deviations. Data mining presents an opportunity to increase significantly the rate at which the volume of data can be turned into useful information. The purpose of the prediction algorithms is to forecast future values based on present records, in order to estimate the possibility of a machine break-down and therefore to support maintenance teams in planning appropriate maintenance interventions. It is observed that the proposed data mining approach provides promising results in predicting the exact value.

itsmjournal2019data-mining
Rule-based Expert System for Paddy InformationTun Thura Htet, Aye Aye BoFebruaryExpert System, Artificial Intelligence, Knowledge RepresentationDownload

The rapid growth of technology has largely eased the access to information. At the same time increasingly difficult for people to collect, filter, evaluate and really use the vast amount of information. An information system has access to at least one and potentially many information sources. The organization cannot be operated or managed effectively without information system that are using a range of information technologies. In Pwintbyu Township, the production information paddy is stored in documents. In this paper, a computerized paddy information system is implemented by using knowledge representation technique. Knowledge Representation, more common expert systems currently developed, is best suited for applications in which the possible concern are limited in number. With the help of the implemented system, it is expected to retrieve the information of Pwintbyu Township and predict the results concerned with the agriculture of Pwintbyu Township.

itsmconference2013artificial-intelligence
Implementation of Inference in Rule-based system for studying the Nature of BirdsHnin Yu Mon, Aye Aye BoDecemberRule-based System, BirdsDownload

A rule-based system expresses all of its knowledge in terms of explicit rules. Rule-based systems are typically used for applications, which required a lot of expert knowledge, a high degree of explain ability and a low level of creativity. Most rules are expressed in terms of IF X THEN Y. Knowledge is the key for rule-based systems. Rule-based system emphasizes on the inferencing with rules. Rule-based systems have the flexibility to be used in a top down or bottom up method. Top down is also known as forward chaining, and bottom up is synonymous with backward chaining. A rule-based system typically consists of rule base, working memory, and rule interpreter. This paper presents details of birds by using forward chaining and backward chaining of rule-based system. It is intended to display the inferencing of rules and also describe how it can be used to demonstrate the information of bird.

itsmconference2010artificial-intelligence
Knowledge-based System forAntibioticsThet Htar San, Aye Aye Bo16DecemberKnowledge-based System,AntibiotiesDownload

Knowledge-based systems are systems based on the methods and techniques of artificial intelligence. Knowledge-based systems were designed primarily for the purpose of being able to apply knowledge automatically. Knowledge is the base of personal information, which is integrated in a fashion, which allows it to be used in further interpretation and analysis of data. The aim of this paper is to provide the user in order to diagnose the bacterial infections and know the knowledge of Antibiotics. This system makes decision for the diseases which the user suffers and represents knowledge about antibiotics for the user’s disease. This paper presents a knowledge-based system that makes inference of bacterial infections and gives consistent Antibiotics by using Knowledge Acquisition, Knowledge Representation and Knowledge Manipulation methods. Antibiotics is medicine or chemical that can destroy harmful bacteria in the body of limit their growth. Knowledge Acquisition involves the acquisition of user’s age and symptoms that the user suffers. The acquired age and symptoms are organized as a rule in the Knowledge-based system for representation of knowledge. In Knowledge Manipulation, this system matches the rule with the rules in Knowledge-based system. If matches the rule with the rules in Knowledge-based system. If matching, the system makes inference of bacterial infection disease name and provides knowledge of Antibiotics to the user for treatment.

itsmconference2010artificial-intelligence
Computer Problem- Solving ByApplying Depth-First SearchThet Htar San, Aye Aye BoDecemberExpert System, Artificial Intelligence, Problem Solving StrategiesDownload

Artificial Intelligence (AI) is the science and engineering of making intelligent machines, especially intelligent computer programs and AI is related to the similar task of using computers to understand human intelligence. One of the applications of artificial intelligence is in expert system (ES) or knowledge-based. An expert system provides advice derived from its knowledge base. This system intends to solve computer problem without any computer expert. Knowledge base is made with many inferences rules and they are entered as separate rules that use them together to draw conclusions. This system intended to solve problems for Window XP based Operating System Computer by applying depth-first search algorithm. User can get the solution for their specific problems and they can make troubleshooting steps by themselves because the system will give the advice and step by step procedure for solution.

itsmconference2009artificial-intelligence
Comparison for the accuracy of defect fix effort estimationTin Zar Thaw, Myintzu Phyo Aung, Naw Lay Wah, Swe Swe Nyein, Zar Lwin Phyo, Khaing Zarchi HtunAprilDefects Estimation, SOM, Neural Network, Matlab7.0Download

Software defects have become the dominant cause of customer outage and the study of software errors has been necessitated by the emphasis on software reliability. Yet, software defects are not well enough understood to provide a clear methodology for avoiding or recovering from them. So software defect fix efforts play the critical role in software quality assurance. In this paper, the comparison of the defect fix effort estimation by using Self Organizing Map in neural network is presented. To estimate the defect fix effort, KC3 static defect attributes that is one of the publicly available data from NASA products is used in this paper. To implement the SOM, finding different clusters from the SOM and for the calculation of fix effort time of defect SOM Toolbox in MATLAB 7.0.1 is used.

fcsonline-publication2010software-engineering