University of Mandalay Open Access RepositoryThe DSpace digital repository system captures, stores, indexes, preserves, and distributes digital research material.https://umoar.mu.edu.mm:4432019-04-21T04:40:58Z2019-04-21T04:40:58ZStates Hostilities in Ava Period (First Ava Period)Mi Mi Hlainghttps://umoar.mu.edu.mm/handle/123456789/3272019-03-21T06:00:16Z2018-01-01T00:00:00ZStates Hostilities in Ava Period (First Ava Period)
Mi Mi Hlaing
Ava is located at the Ayeyarwady-Myitnge river confluence, the territory and influence of Ava was extended since the time of King Thado Minphya. From the reigns of King Mingyi Swasawkè and Mingaung to that of Shwenan Kyawtshin, Ava faced with the attacks Mons from Lower Myanmar and hilly region. In addition Ava had to deal with the invasion of China. Since the Shans enabled to occupy Myaydu and Dipèyin, the rice growing regions of Mu valley had fallen into the hands of Shans. The first Ava period was declined by the invasions of Shans.
2018-01-01T00:00:00ZStatus of ICT Integration in Education in Southeast Asian CountriesMyint Myint Theinhttps://umoar.mu.edu.mm/handle/123456789/3262019-03-14T07:00:25Z2010-01-01T00:00:00ZStatus of ICT Integration in Education in Southeast Asian Countries
Myint Myint Thein
2010-01-01T00:00:00ZParallel Processing in Numerical IntegrationMyint Myint Theinhttps://umoar.mu.edu.mm/handle/123456789/3252019-03-14T06:00:21Z2010-01-01T00:00:00ZParallel Processing in Numerical Integration
Myint Myint Thein
Numerical Integration is a method of computing an approximation of the area under the curve of a function. The area under the curves is approximated the sum of the area of the subinterval rectangles. The difference between the sum of the rectangle’s area and the area under the curve is reduced increasing the number of subintervals. The trivial parallel implementation is that if p threads are available, the sum is sliced into p pieces. One interval is attached to each of intervals to compute a partial sum. The local sums are collected into one processor, which will know the answer. The computations are parallelized with OpenMP directives supported by Microsoft Visual Studio 2008. Serial time Ts is the time to run the program on one thread and parallel time T p is the time to run the program on p threads are obtained. By comparing Ts and Tp of different threads, the parallel processing is faster than serial processing.
2010-01-01T00:00:00ZParallel OpenMP/C++ Programming for the Kalman FilterMyint Myint Theinhttps://umoar.mu.edu.mm/handle/123456789/3242019-03-14T06:00:17Z2014-01-01T00:00:00ZParallel OpenMP/C++ Programming for the Kalman Filter
Myint Myint Thein
The Kalman filter is a set of mathematical equations that provides an efficient computational (recursive) means to estimate the state of a process. Computational Kalman equations can be described with the process of serial C and parallel OpenMP/C program. Parallel implementation of Kalman filter has been suggested to improve the execution time. Single Program Multiple Data ( SPMD ) and Work Sharing methods of Open Multi-Processing (OpenMP) are applied to the computation of parallel Kalman filter. An evaluation of parallel algorithm on eight different shared-memory multi-core architectures has been performed. Shared memory implementation programs are compiled and executed on Windows Compute Cluster Server 2003 with Microsoft Visual Studio 2008.
2014-01-01T00:00:00Z