Browsing by Author "Suwatchai Kamonsantiroj"

Now showing 1 - 2 of 2
  • Default Image
    Item
    A memorization approach for test case generation in concurrent UML activity diagram
    (Association for Computing Machinery, 2019) Siriluck Lorpunmanee; Suwatchai Kamonsantiroj; Luepol Pipanmaekaporn
    Test case generation is the most important part of software testing. Currently, researchers have used the UML activity diagram for test case generation. Testing concurrent system is difficult task due to the concurrent interaction among the threads and the system results in test case explosion. In this paper, we proposed a novel approach to generate test cases for concurrent systems using a dynamic programming technique with tester specification to avoid the path explosion. The tester can configure the concurrency specifications that follow the business flow constraints. In order to evaluate the quality of test cases, activity coverage and causal ordering coverage were measured. By experimental results, the proposed approach is superior as compared to DFS and BFS algorithms. Finally, the proposed approach helps to avoid generating all possible concurrent activity paths which are able to minimize test cases explosion. � 2019 Association for Computing Machinery.
  • Default Image
    Item
    Efficient mining recurring patterns of inter-transaction in time series
    (Fuji Technology Press, 2019) Siriluck Lorpunmanee; Suwatchai Kamonsantiroj
    One type of the partial periodic pattern is known as recurring patterns, which exhibit cyclic repetitions only for particular time period within a series. A key property of the patterns is the event can start, stop, and restart at anytime within a series. Therefore, the extracted meaningful knowledge from the patterns is challenging because the information can vary across patterns. The mining technique in recurring patterns plays an important role for discovering knowledge pertaining to seasonal or temporal associations between events. Most existing researches focus on discovering the recurring patterns in transaction. However, these researches for mining recurring patterns cannot discover recurring events across multiple transactions (inter-transaction) which often appears in many real-world applications such as the stock exchange market, social network, etc. In this study, the proposed algorithm, namely, CP-growth can efficiently perform in discovering the recurring patterns within inter-transaction. Besides, an efficient pruning technique to reduce the computational cost of discovering recurring patterns is developed in CP-growth algorithm. Experimental results show that recurring patterns can be useful in multiple transactions and the proposed algorithm, namely, CP-growth is efficient. � 2019 Fuji Technology Press. All rights reserved.