In mathematics and physics, a small-world network is a type of mathematical graph in which most nodes are not neighbors of one another, but most nodes can be reached from every other by a small number of hops or steps. A small world network, where nodes represent people and edges connect people that know each other, captures the small world phenomenon of strangers being linked by a mutual acquaintance.
This is a guide to the LaTeX markup language. It is intended that this can serve as a useful resource for everyone from new users who wish to learn, to old hands who need a quick reference.
In a recent piece called Strong Typing vs. Strong Testing, noted programmer and author Bruce Eckel makes an argument that dynamically typed languages such as Python are superior to statically typed languages such as Java and C++. I've done quite a bit of Python and Java programming, and even a little C++, so I can appreciate his position, but I think the conclusion goes too far. Whether Python is more productive than C++ or Java is one thing, whether static typing in general should be abandoned is quite another.
MegaMap is a Java implementation of a map (or hashtable) that can store an unbounded amount of data, limited only by the amount of disk space available. Objects stored in the map are persisted to disk. Good performance is achieved by an in-memory cache. The MegaMap can, for all practical reasons, be thought of as a map implementation with unlimited storage space.
D. Arthur, and S. Vassilvitskii. SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, page 1027--1035. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2007)
D. Arthur, and S. Vassilvitskii. SCG '06: Proceedings of the twenty-second annual symposium on Computational geometry, page 144--153. New York, NY, USA, ACM, (2006)
K. Avrachenkov, V. Dobrynin, D. Nemirovsky, S. Pham, and E. Smirnova. SIGIR '08: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, page 873--874. New York, NY, USA, ACM, (2008)
M. B\=adoiu, S. Har-Peled, and P. Indyk. STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, page 250--257. New York, NY, USA, ACM, (2002)
M. Balcan, A. Blum, and A. Gupta. SODA '09: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, page 1068--1077. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2009)
M. Banko, and E. Brill. ACL '01: Proceedings of the 39th Annual Meeting on Association for Computational Linguistics, page 26--33. Morristown, NJ, USA, Association for Computational Linguistics, (2001)
D. Bollegala, Y. Matsuo, and M. Ishizuka. WSDM '09: Proceedings of the Second ACM International Conference on Web Search and Data Mining, page 104--113. New York, NY, USA, ACM, (2009)
C. Daskalakis, P. Goldberg, and C. Papadimitriou. STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, page 71--78. New York, NY, USA, ACM, (2006)
C. Ding, T. Li, D. Luo, and W. Peng. SIGIR '08: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, page 831--832. New York, NY, USA, ACM, (2008)
B. Dorow, and D. Widdows. Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 2, page 79--82. Morristown, NJ, USA, Association for Computational Linguistics, (2003)
G. Erkan. Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, page 479--486. Morristown, NJ, USA, Association for Computational Linguistics, (2006)
G. Hamerly, and C. Elkan. CIKM '02: Proceedings of the eleventh international conference on Information and knowledge management, page 600--607. New York, NY, USA, ACM, (2002)