LyX is a document processor that encourages an approach to writing based on the structure of your documents (WYSIWYM), and not simply their appearance (WYSIWYG).
LyX combines the power and flexibility of TeX/LaTeX with the ease of use of a graphical interface. This results in world-class support for creation of mathematical content (via a fully integrated equation editor) and structured documents like academic articles, theses, and books. In addition, staples of scientific authoring such as reference list and index creation come standard. But you can also use LyX to create a letter or a novel or a theatre play or film script. A broad array of ready, well-designed document layouts are built in.
In mathematical logic, Gödel's incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of considerable importance to the philosophy of mathematics. They are widely regarded as showing that Hilbert's program to find a complete and consistent set of axioms for all of mathematics is impossible, thus giving a negative answer to Hilbert's second problem.
Netlib is a collection of mission-critical software components for linear algebra systems (i.e. working with vectors or matrices). Netlib libraries are written in C, Fortran or optimised assembly code. A Java translation has been provided by the F2J project but it does not take advantage of optimised system libraries.
Delta Debugging automates the scientific method of debugging. The Delta Debugging algorithm isolates failure causes automatically - by systematically narrowing down failure-inducing circumstances until a minimal set remains.
JCublas is providing Java bindings for the NVIDIA CUDA BLAS implementation, thus making the parallel processing power of modern graphics hardware available for Java programs.
EM has been shown to have favorable convergence properties, automatical satisfaction of constraints, and fast convergence. The next section explains the traditional approach to deriving the EM algorithm and proving its convergence property. Section 3.3 covers the interpretion the EM algorithm as the maximization of two quantities: the entropy and the expectation of complete-data likelihood. Then, the K-means algorithm and the EM algorithm are compared. The conditions under which the EM algorithm is reduced to the K-means are also explained. The discussion in Section 3.4 generalizes the EM algorithm described in Sections 3.2 and 3.3 to problems with partial-data and hidden-state. We refer to this new type of EM as the doubly stochastic EM. Finally, the chapter is concluded in Section 3.5.
BitC is a new systems programming language. It seeks to combine the flexibility, safety, and richness of Standard ML or Haskell with the low-level expressiveness of C.
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)
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)
A. Turpin, and F. Scholer. Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, page 11--18. New York, NY, USA, ACM, (2006)
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)
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)
O. Kurland, and L. Lee. SIGIR '05: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, page 306--313. New York, NY, USA, ACM, (2005)
M. Surdeanu, J. Turmo, and A. Ageno. KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, page 685--690. New York, NY, USA, ACM, (2005)
X. Liu, and W. Croft. SIGIR '04: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval, page 186--193. New York, NY, USA, ACM, (2004)
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)
W. Xu, X. Liu, and Y. Gong. SIGIR '03: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, page 267--273. New York, NY, USA, ACM, (2003)