Software engineering and scale-free networks

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 39, Issue 3, 2009, Pages 648-657

  Wen, Lian ^a   Dromey, R Geoff ^a   Kirk, Diana ^b  

^a GRIFFITH UNIVERSITY   (Australia)

^b AUCKLAND UNIVERSITY OF TECHNOLOGY   (New Zealand)

Author keywords

Concept network (CN); Scale free network; Software engineering; Sorting algorithm

Indexed keywords

COMPARISON NETWORKS; COMPLEX NETWORKS; CONCEPT NETWORK (CN); LARGE SYSTEMS; NETWORK THEORIES; NEW APPROACHES; SCALE-FREE; SCALE-FREE NETWORK; SCALE-FREE PROPERTIES; SOFTWARE SYSTEMS; SORTING ALGORITHM; SPECIAL PROPERTIES;

CIRCUIT THEORY; INFORMATION THEORY; SOFTWARE ENGINEERING;

ENGINEERING EXHIBITIONS;

EID: 67349206133     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2008.2008102     Document Type: Article

References (37)

1. R. Alberich, J. Miro-Julia, and F. Rosselló, Marvel Universe Looks Almost Like a Real Social Network, vol. 1, Feb. 11, 2002. oaa:aRXiv: cond-mat/0202174.
2. R. Albert and A.-L. Barabási, "Statistical mechanics of complex networks," Rev. Mod. Phys., vol. 74, no. 1, pp. 47-97, Jan. 2002.
3. Apache Ant, 2007. [Online]. Available: http://ant.apache.org/
4. A.-L. Barabási, Linked. Cambridge, MA: Perseus Publishing, 2002.
5. A.-L. Barabási and E. Bonabeau, "Scale-free networks," Sci. Amer., vol. 288, pp. 60-59, May 2003.
6. F. P. Brooks, "No silver bullet: Essence and accidents of software engineering," Computer, vol. 20, no. 4, pp. 10-19, Apr. 1987.
7. S. R. Chidamber and C. F. Kemerer, "A metrics suite for object oriented design," IEEE Trans. Softw. Eng., vol. 20, no. 6, pp. 476-493, Jun. 1994.
8. Classnet, The Tool to Explore the CDN of a Java System, 2007. [Online]. Available: http://www.sqi.gu.edu.au/gse/tools/classnet..html
9. I. F. Cruz and R. Tamassia, Graph Drawing Tutorial, 1998. [Online]. Available: http://www.cs.brown.edu/people/rt/papers/ gd-tutorial/gd-constraints.pdf
10. R. Diestel, Graph Theory, 2nd ed. New York: Springer-Verlag, 1999.
11. R. G. Dromey, "From requirements to design: Formalizing the key steps," in Proc. IEEE Int. Conf. SEFM, Brisbane, Australia, Sep. 2003, pp. 2-11. (Invited Keynote Address).
12. T. Eisenbarth, R. Koschke, and D. Simon, "Locating features in source code," IEEE Trans. Softw. Eng., vol. 29, no. 3, pp. 210-224, Mar. 2003.
13. H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A.-L. Barabási, "The large-scale organization of metabolic networks," Nature, vol. 407, no. 6804, pp. 651-654, Oct. 2000.
14. H. Jeong, S. P. Mason, and A.-L. Barabási, "Lethality and centrality in protein networks," Nature, vol. 411, no. 6833, pp. 41-42, May 2001.
15. B. J. Kim, A. Trusina, P. Minnhagen, and K. Sneppen, "Self organized scale-free networks from merging and regeneration," Eur. Phys. J. B vol. 43, no. 3, pp. 369-372, Feb. 2005. [Online]. Available: http://axxiv.org/abs/nlin/0403006
16. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," J. ACM, vol. 46, no. 5, pp. 604-632, Sep. 1999.
17. D. E. Knuth, The Art of Computer Programming, Sorting and Searching 2nd ed, vol. 3. Reading, MA: Addison-Wesley, 1997.
18. A. Lakhotia, "A unified framework for expressing software subsystem classification techniques," J. Syst. Softw., vol. 36, no. 3, pp. 211-231, Mar. 1997.
19. M. M. Lehman, "Programs, cities, students, limits to growth?" Inaugural Lecture, 1974.
20. M. M. Lehman, "FEAST/2 final report - Grant number GR/M44101," Dept. Comput., Imperial College, London, U.K., 2001.
21. K. Park and Y.-C. Lai, "Self-organized scale-free networks," Phys. Rev. E, Stat. Phys. Plasmas Fluids Relat. Interdiscip. Top., vol. 72, no. 2, p. 026 131, Aug. 2005.
22. R. Pastor-Satorras and A. Vespignani, "Epidemic spreading in scale-free networks," Phys. Rev. Lett., vol. 86, no. 14, pp. 3200-3203, Apr. 2001.
23. Sorting Comparison Network Explorer, 2007. [Online]. Available: http://www.scs.carleton.ca/~cgm/scale-free/
24. J. A. Stafford and A. L. Wolf, "Software architecture," in Component-Based Software Engineering, Putting the Pieces Together. Boston, MA: Addison-Wesley, 2001, ch. 20.
25. D. Svetinovic and M. Godfrey, "Software and biological evolution: Some common principles, mechanisms, and a definition," in Proc. 8th IWPSE Lisbon, Portugal, 2005.
26. V. Tzerpos and R. C. Holt, "ACDC: An algorithm for comprehension-driven clustering," in Proc. 7th Work. Conf. Reverse Eng., 2000, pp. 258-267.
27. W. M. Vancleemput and J. G. Linders, "An improved graph-theoretic model for the circuit layout problem," in Proc. 11th Workshop Des. Autom. 1974, pp. 82-90.
28. Y. Wang, "On cognitive informatics," Brain Mind: A Transdisciplinary J. Neurosci. Neurophilosophy, vol. 4, no. 2, pp. 151-167, 2003.
29. Y. Wang, "The OAR model for knowledge representation," in Proc. 19th IEEE Can. Conf. Elect. Comput. Eng., 2006, pp. 1696-1699.
30. Y. Wang, "On concept algebra and knowledge representation," in Proc. 5th IEEE Int. Conf. Cognitive Informat., 2006, pp. 320-331.
31. Y. Wang, "The theoretical framework of cognitive informatics," Int. J. Cognitive Informat. Natural Intell., vol. 1, no. 1, pp. 1-27, Jan. 2007.
32. D. J. Watts and S. H. Strogatz, "Collective dynamics of small-world networks," Nature, vol. 393, no. 6684, pp. 400-442, Jun. 1998.
33. D. J. Watts, Six Degrees: The Science of a Connected Age. London, U.K.: Heinemann, 2003.
34. L. Wen and R. G. Dromey, "Architecture normalization for component-based systems," Electron. Notes Theoretical Comput. Sci. vol. 160, pp. 335-348, 2006.
35. L. Wen, D. Kirk, and R. G. Dromey, "Software systems as complex networks," in Proc. 6th IEEE Int. Conf. Cognitive Informar., 2007, pp. 106-115.
36. Wolfram Math World, 2007. [Online[. Available: http://mathworld. wolfram.com/Sorting.html
37. A. Zaidman, T. Calders, S. Demeyer, and J. Paredaens, "Applying web-mining techniques to execution traces to support the program comprehension process," in Proc. 9th Eur. Conf. Softw. Maintenance Reengineering, 2005, pp. 134-142.