Browse > Article
http://dx.doi.org/10.5762/KAIS.2013.14.3.1451

Fast Combinatorial Programs Generating Total Data  

Jang, Jae-Soo (School of Comp. Sci. and Eng., Soongsil University)
Won, Shin-Jae (School of Comp. Sci. and Eng., Soongsil University)
Cheon, Hong-Sik (College of Business Administration, Soongsil University)
Suh, Chang-Jin (School of Comp. Sci. and Eng., Soongsil University)
Publication Information
Journal of the Korea Academia-Industrial cooperation Society / v.14, no.3, 2013 , pp. 1451-1458 More about this Journal
Abstract
This paper deals with the programs and algorithms that generate the full data set that satisfy the basic combinatorial requirement of combination, permutation, partial permutation or shortly r-permutation, which are used in the application of the total data testing or the simulation input. We search the programs able to meet the rules which is permutations and combinations, r-permutations, select the fastest program by field. With further study, we developed a new program reducing the time required to processing. Our research performs the following pre-study. Firstly, hundreds of algorithms and programs in the internet are collected and corrected to be executable. Secondly, we measure running time for all completed programs and select a few fast ones. Thirdly, the fast programs are analyzed in depth and its pseudo-code programs are provided. We succeeded in developing two programs that run faster. Firstly, the combination program can save the running time by removing recursive function and the r-permutation program become faster by combining the best combination program and the best permutation program. According to our performance test, the former and later program enhance the running speed by 22% to 34% and 62% to 226% respectively compared with the fastest collected program. The programs suggested in this study could apply to a particular cases easily based on Pseudo-code., Predicts the execution time spent on data processing, determine the validity of the processing, and also generates total data with minimum access programming.
Keywords
Combinatorial; Combination; Permutation; R-permutation; Recursive function;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Michael R. Fellows, et al., "Local Search: Is brute-force avoidable?," J. Comput. Syst. Sci. (JCSS), vol.78, no.3, p.707-719, 2012. DOI: http://dx.doi.org/10.1016/j.jcss.2011.10.003   DOI   ScienceOn
2 A. B. Morton, I. M. Y. Mareels, "An Efficient Brute Force Solution to the Network Reconf. Problem," IEEE Trans. on Power Delivery, vol.15, p.996-1000, Jul. 2000. DOI: http://dx.doi.org/10.1109/61.871365   DOI   ScienceOn
3 L. Barton, B. Sharangpani, "Statistical Analysis of Floating Point Flaw in the Pentium Processor," Intel Corp., Nov. 1994.
4 Cleve Moler, "Pentium Division Bug Documents," MATLAB Central, May 2002.
5 Selim G. Akl, Henk Meijer, Ivan Stojmenovic, "An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order," J. Parallel Distr. Comput., vol.20 no.1, pp.84-91, 1994. DOI: http://dx.doi.org/10.1006/jpdc.1994.1008   DOI   ScienceOn
6 Vince Vatter, "Enumeration Schemes for Restricted Permutations," Combinatorics, Probability and Comp., vol.17, p.137-159, 2008. DOI: http://dx.doi.org/10.1017/S0963548307008516   DOI   ScienceOn
7 Hesterberg, Tim C., "Perf. Evaluation using Fast Permutation Tests," Proc. of 10'th Int. Conf. on Telecomm. Systems, p.465-474, 2002.
8 Skiena S., "Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica," Addison-Wesley, p.40-46, 1990.
9 Selmer M. Johnson, "Generation of Permutations by Adjacent Transposition," Mathematics of Computation, vol.17, no.83, p.282-285, Jul. 1963. DOI: http://dx.doi.org/10.1090/S0025-5718-1963-0159764-2   DOI   ScienceOn
10 Youssef Bassil, "A Comparative Study on the Performance of Permutation Algorithms," Journal of Computer Science & Research(JCSCR), vol.1, no.1, p.7-19, 2012.
11 H. F. Trotter, "Algorithm 115: Perm," Communications of the ACM, vol.5, issue.8, p.434-435, Aug. 1962. DOI: http://dx.doi.org/10.1145/368637.368660   DOI