Journal of Network and Information Security

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Method for Derivating an Algorithm of Power Computation of Cyclic Permutation


Affiliations
1 School of Information Technology, Jiangxi University of Finance and Economics, Nanchang, China
     

   Subscribe/Renew Journal


Permutation algorithm is widely used in numerous information technology domains such as cryptology. Any permutation can be viewed as a combination of several cyclic permutations which have no shared element. This article continues the work discussed in existing documents, reforms its part of formal derivation using dynamic programming in order to reveal essence of this algorithm. On the basisof ring representation for cyclic permutation, this article uses dynamic programming to get a bottom-up recurrence relation through a series of formal derivations. And then gets a concise middle algorithm. After that, through correlation between ring and abstract array containing a cyclic permutation, it uses an equally simple coordinate transformation to yield the final algorithm for computing positive power of cyclic permutation stored as a function in an abstract array.

Keywords

Cyclic Permutation, Dynamic Programming, Recurrence Relation, Abstract Array.
Subscription Login to verify subscription
User
Notifications
Font Size


  • Baldy, P., Dicky, H., Medina, R., Morvan, M. & Vilarem, J. F. (1992). Efficient Reconstruction of the Causal Relationship in Distributed Computations. Technical Report 92-013, France.

  • Christiaens, M. (2001). TRaDe, A Topological Approach to On-the-Fly Race Detection in Java Programs.

  • Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium, 1, 1-15.

  • Cui, J. (2009). DRD4BPEL: A Tool for Data Race Detection of BPEL Process. World Congress on Software Engineering, (pp. 200-205).

  • Fidge, C. J. (1989). Dynamic Analysis of Event Orderings in Message-Passing Systems (Doctoral Dissertation) Australian Nat'l University.

  • Gardner, M. (2009). Mathematical Circus: More Puzzles, Games, Paradoxes and Other Mathematical Entertainments From Scientific American. New York: The Mathematical Association of America, (pp. 111-122).

  • Lamport, L. (1978). Time, clocks, and the ordering of events in a distributed system. Communications of the ACM , 21(7) 558-565.

  • Netzer, R. H. & Miller, B. P. (1992). What are race conditions? Some issues and formalizations. ACM Letters on Programming Languages and Systems, 1(1), 74-88 .

  • Ostroff, J. S. & Wonham, W. M. (1985). A Temporal Logic Approach to Real Time Control. In 24th Conference Proceedings of Decision Control, 24, 656-657.

  • Shang, C., Liu, Q. & Yang, Z. (2010). Implementing transaction management in cross engine business process recursive composition by BPEL Extension. Journal of Computational Information Systems, 6(8), 2603-2607.

  • Shaodong, L. & Lei, X. (2010). A static data race detecting method for BPEL based on happens-before and Lockset. Computer and Digital Engineering, 250(8), 6-9.

  • Sheng, C., Iiang, B. & Ping, C. (2008). Study of algorithm on data race and deadlock detection for BPEL process. Journal of Xidian University, 35(6), 1056 -1063.

  • Web Services Business Process Execution Language Version 2.0. Retrieved from http://docs.oasis-open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.htm. (accessed on April 11, 2007).


Abstract Views: 475

PDF Views: 0




  • A Method for Derivating an Algorithm of Power Computation of Cyclic Permutation

Abstract Views: 475  |  PDF Views: 0

Authors

Bo Yang
School of Information Technology, Jiangxi University of Finance and Economics, Nanchang, China

Abstract


Permutation algorithm is widely used in numerous information technology domains such as cryptology. Any permutation can be viewed as a combination of several cyclic permutations which have no shared element. This article continues the work discussed in existing documents, reforms its part of formal derivation using dynamic programming in order to reveal essence of this algorithm. On the basisof ring representation for cyclic permutation, this article uses dynamic programming to get a bottom-up recurrence relation through a series of formal derivations. And then gets a concise middle algorithm. After that, through correlation between ring and abstract array containing a cyclic permutation, it uses an equally simple coordinate transformation to yield the final algorithm for computing positive power of cyclic permutation stored as a function in an abstract array.

Keywords


Cyclic Permutation, Dynamic Programming, Recurrence Relation, Abstract Array.

References