Three algorithms for analyzing fractal software networks

WSEAS Transactions on Information Science and Applications

Volumn 7, Issue 3, 2010, Pages 371-380

  Locci, Mario ^a   Concas, Giulio ^a   Tonelli, Roberto ^a   Turnu, Ivana ^a  

^a UNIVERSITY OF CAGLIARI   (Italy)

Author keywords

Complex networks; Complex systems; Object oriented systems; Self similarity; Software graphs; Software metrics

Indexed keywords

COMPLEX NETWORKS; COMPLEX SYSTEMS; OBJECT-ORIENTED SYSTEM; SELF-SIMILARITIES; SOFTWARE METRICS;

ALGORITHMS; ANNEALING; COMPUTATION THEORY; COMPUTER SOFTWARE; FRACTAL DIMENSION; MERGERS AND ACQUISITIONS; OBJECT ORIENTED PROGRAMMING; PARTIAL DISCHARGES;

SIMULATED ANNEALING;

EID: 77950295816     PISSN: 17900832     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. S. Valverde, R. Ferrer-Cancho, and R. Solé, Scale-Free Networks from Optimal Design. Europhysics Letters, vol.60, 2002, pp. 512-517.
2. C. Myers, "Software Systems as Complex Networks: Structure, Function, and Evolvability of Software Collaboration Graphs". Physical Rev. E, vol.68, 2003.
3. G. Concas, M. Marchesi, S. Pinna, and N. Serra, Power-Laws in a Large Object-Oriented Software System, IEEE Transactions on Software Engineering, vol.33, No.10, 2007, pp. 687-708.
4. P. Louridas, D. Spinellis and V. Vlachos, Power Laws in Software. ACM Trans. Software Eng. and Method., Vol.18, No.1, 2008.
5. C. Song, S. Havlin and Makse H. A., Selfsimilarity of complex networks, Nature, vol.433, pp. 392-395, and related supplementary information, 2006.
6. G. Concas, M. Locci, M. Marchesi, S. Pinna, and I. Turnu, Fractal dimension in software networks, Europhysics Letters, vol.76, 2006, pp. 1221-1227.
7. S. Chidamber, and C. Kemerer, "A Metrics Suite for Object-Oriented Design", IEEE Trans. Software Eng., vol.20, no.6, pp. 476-493, June 1994.
8. G. Concas, M. Marchesi, A. Murgia, R. Tonelli, I. Turnu, Stochastic models of software development activities, submitted for publication.
9. C. Song, L.K. Gallos, S. Havlin, H. A. Makse, How to calculate the fractal dimension of a complex network: the box covering algorithm, Journal of Statistical Mechanics, P03006, 2007.
10. D.W. Matula, G. Marble and J.D. Isaacson, Graph Coloring Algorithms. In Graph Theory and Computing (Ed. R. Read). New York: Academic Press, pp. 109-122, 1972.
11. S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, Optimization by Simulated Annealing. Science, vol.220, 1983, pp. 671-680.
12. W.X. Zhou, Z.Q. Jiang, D. Sornette, Exploring self-similarity of complex cellular networks: the edge-covering method with simulated annealing and log-periodic sampling. Physica A vol.375, No.2, 2007, pp. 741-752.
13. L. Lazic, S. Popovic, N. E. Mastorakis, A Simultaneous Application of Combinatorial Testing and Virtualization as a Method for Software Testing. WSEAS Trans. on Inf. Sci, and App., Vol.6, 2009.
14. L. Lazic, N. E. Mastorakis OptimalSQM: Integrated and Optimized Software Quality Management. WSEAS Trans. on Inf. Sci, and App., Vol.6, 2009.
15. V. Podgorelec, Improved Mining of Software Complexity Data on Evolutionary Filtered Training Sets. WSEAS Trans. on Inf. Sci, and App., Vol.6, 2009.