http://pdos.csail.mit.edu/scigen/
This is awesome. It generates technical papers that appear to show a deep understanding of Computer Science but are actually randomly-generated garbage. Each one is complete with technical terms, graphs, charts, block diagrams and authentic-looking citations.
Here is a sample from a paper by me, Dr. Wibble T. Wibble:
--
Refining the World Wide Web Using Signed Modalities
Dr. Wibble T. Wibble
Abstract
In recent years, much research has been devoted to the typical unification of the Internet and 16 bit architectures; on the other hand, few have constructed the improvement of virtual machines. Here, we argue the deployment of the producer-consumer problem. We describe an analysis of redundancy (Cauf), showing that write-back caches can be made perfect, replicated, and symbiotic.
Recent advances in pervasive methodologies and multimodal configurations have paved the way for vacuum tubes. Such a claim might seem unexpected but largely conflicts with the need to provide public-private key pairs to end-users. Two properties make this approach different: Cauf is built on the emulation of semaphores, and also our heuristic develops public-private key pairs. In fact, few security experts would disagree with the visualization of local-area networks. To what extent can DHCP be refined to overcome this quandary?
We explore a novel approach for the understanding of neural networks, which we call Cauf. Our system is NP-complete. We view cyberinformatics as following a cycle of four phases: observation, construction, simulation, and synthesis [3]. Clearly, we see no reason not to use the understanding of kernels to visualize modular symmetries.
Here, we make four main contributions. To begin with, we verify not only that XML and randomized algorithms are never incompatible, but that the same is true for IPv7 [12]. We examine how journaling file systems can be applied to the development of the location-identity split. We introduce a cooperative tool for studying evolutionary programming (Cauf), which we use to validate that extreme programming and consistent hashing can collaborate to answer this obstacle. Lastly, we disconfirm that scatter/gather I/O and public-private key pairs are mostly incompatible. Of course, this is not always the case.
The rest of this paper is organized as follows. First, we motivate the need for telephony. We prove the visualization of 802.11 mesh networks. Finally, we conclude.
--
Submit it to a real journal and see if it gets accepted like the one on their site did.
