Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 408148, 10 pages
http://dx.doi.org/10.1155/2013/408148
Research Article

The Most Trustworthy Path Selection in Online Social Networks

School of Information Science and Technology, Zhejiang Sci-Tech University, Hangzhou 310018, China

Received 22 June 2013; Accepted 19 September 2013

Academic Editor: Miguel A. F. Sanjuán

Copyright © 2013 Lianggui Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R.-C. Chen, “Grouping optimization based on social relationships,” Mathematical Problems in Engineering, vol. 2010, Article ID 170563, 19 pages, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  2. R. Chen, E. K. Lua, and Z. Cai, “Bring order to online social networks,” in Proceedings of 30th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '11), pp. 541–545, Shanghai, China, April 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. Social Networks & Blogs Now 4th Most Popular Online Activity, Ahead of Personal Email, Nielsen Reports, http://www.nielsen.com/us/en/press-room/2009/social_networks__.html.
  4. J. Kunegis, A. Lommatzsch, and C. Bauckhage, “The slashdot zoo: mining a social network with negative edges,” in Proceedings of the 18th International Conference on World Wide Web (WWW '09), pp. 741–750, ACM, Madrid, Spain, April 2009. View at Publisher · View at Google Scholar
  5. G. Liu, Y. Wang, M. A. Orgun, and E. -P. Lim, “Finding the optimal social trust path for the selection of trustworthy service providers in complex social networks,” IEEE Transactions on Services Computing, vol. 6, no. 2, pp. 152–167, 2011. View at Publisher · View at Google Scholar
  6. S. Baase, Computer Algorithms: Introduction to Design & Analysis, 3/E, Pearson Education India, 2000.
  7. T. Korkmaz and M. Krunz, “Multi-constrained optimal path selection,” in Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '01), vol. 2, pp. 834–843, Anchorage, Alaska, USA, April 2001. View at Publisher · View at Google Scholar · View at Scopus
  8. T. Yu, Y. Zhang, and K.-J. Lin, “Efficient algorithms for web services selection with end-to-end QoS constraints,” ACM Transactions on the Web, vol. 1, no. 1, article 6, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959. View at Google Scholar · View at MathSciNet
  10. P. J. van Laarhoven and E. H. Aarts, Simulated Annealing: Theory and Applications, Springer, 1987.
  11. D. T. Pham and D. Karaboga, Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks, Springer, New York, NY, USA, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  12. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  13. A. Das and B. K. Chakrabarti, “Colloquium: quantum annealing and analog quantum computation,” Reviews of Modern Physics, vol. 80, no. 3, pp. 1061–1081, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  14. J. Brooke, D. Bitko, T. F. Rosenbaum, and G. Aeppli, “Quantum annealing of a disordered magnet,” Science, vol. 284, no. 5415, pp. 779–781, 1999. View at Publisher · View at Google Scholar · View at Scopus
  15. H. M. Rønnow, R. Parthasarathy, J. Jensen, G. Aeppli, T. F. Rosenbaum, and D. F. McMorrow, “Quantum phase transition of a magnet in a spin bath,” Science, vol. 308, no. 5720, pp. 389–392, 2005. View at Publisher · View at Google Scholar · View at Scopus
  16. Y. Matsuda, H. Nishimori, and H. G. Katzgraber, Quantum Annealing for Problems With Ground-State Degeneracy, IOP Publishing, 2003.
  17. T. Kadowaki and H. Nishimori, “Quantum annealing in the transverse Ising model,” Physical Review E, vol. 58, no. 5, pp. 5355–5363, 1998. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Suzuki, J.-I. Inoue, and B. K. Chakrabarti, “Quantum annealing,” in Quantum Ising Phases and Transitions in Transverse Ising Models, pp. 225–289, 2nd edition, 2013. View at Google Scholar
  19. S. Boixo, “Experimental signatures of quantum annealing,” Bulletin of the American Physical Society, article 58, 2013. View at Google Scholar
  20. W. W. Cohen, Enron email dataset. Internet, 2009, http://www.cs.cmu.edu/~enron/.
  21. S. Yoo, Y. Yang, F. Lin, and C. Moon, “Mining social networks for personalized email prioritization,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09), pp. 967–975, July 2009. View at Publisher · View at Google Scholar · View at Scopus
  22. A. McCallum, X. Wang, and A. Corrada-Emmanuel, “Topic and role discovery in social networks with experiments on enron and academic email,” Journal of Artificial Intelligence Research, vol. 30, pp. 249–272, 2007. View at Google Scholar · View at Scopus
  23. J. Goldstein, A. Kwasinski, P. Kingsbury, R. E. Sabin, and A. Mcdowell, “Annotating subsets of the enron email corpus,” CiteSeer, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.4060.
  24. D. A. Battaglia, G. E. Santoro, and E. Tosatti, “Optimization by quantum annealing: lessons from hard satisfiability problems,” Physical Review E, vol. 71, no. 6, Article ID 066707, 10 pages, 2005. View at Publisher · View at Google Scholar · View at Scopus
  25. D. P. Landau and K. Binder, A Guide to Monte Carlo Simulations in Statistical Physics, Cambridge University Press, Cambridge, UK, 3rd edition, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  26. B. K. Chakrabarti, A. Dutta, and P. Sen, “Quantum Ising phases and transitions in transverse Ising models,” in Quantum Ising Phases and Transitions in Transverse Ising Models, vol. 41 of Lecture Notes in Physics Monographs, Springer, Berlin, Germany, 1996. View at Google Scholar
  27. L. Liu and G. Feng, “Simulated annealing based multi-constrained QoS routing in mobile ad hoc networks,” Wireless Personal Communications, vol. 41, no. 3, pp. 393–405, 2007. View at Publisher · View at Google Scholar · View at Scopus
  28. B. K. Chakrabarti and A. Das, Quantum Annealing and Related Optimization Methods, Springer, 2005.
  29. E. Aarts and J. K. Lenstra, Local Search in Combinatorial Optimization, Princeton University Press, Princeton, NJ, USA, 2003.