Stories
Slash Boxes
Comments

SoylentNews is people

SoylentNews is powered by your submissions, so send in your scoop. Only 18 submissions in the queue.
posted by janrinok on Monday March 03 2014, @09:30PM   Printer-friendly
from the twas-brillig-and-the-slithy-toves dept.

AnonTechie writes:

"The publishers Springer and IEEE are removing more than 120 papers from their subscription services after a French researcher discovered that the works were computer-generated nonsense.

Over the past two years, computer scientist Cyril Labbe of Joseph Fourier University in Grenoble, France, has catalogued computer-generated papers that made it into more than 30 published conference proceedings between 2008 and 2013. Sixteen appeared in publications by Springer, which is headquartered in Heidelberg, Germany, and more than 100 were published by the Institute of Electrical and Electronic Engineers (IEEE), based in New York. Both publishers, which were privately informed by Labbe, say that they are now removing the papers.

 
This discussion has been archived. No new comments can be posted.
Display Options Threshold/Breakthrough Mark All as Read Mark All as Unread
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
  • (Score: 4, Interesting) by song-of-the-pogo on Monday March 03 2014, @10:52PM

    by song-of-the-pogo (1315) on Monday March 03 2014, @10:52PM (#10303) Homepage Journal

    Btw, here's the link to SCIGen: http://pdos.csail.mit.edu/scigen/ [mit.edu]

    The paper it generated for me is titled "The Effect of Stable Modalities on Software Engineering" and the abstract reads as follows:

    The synthesis of digital-to-analog converters has improved interrupts, and current trends suggest that the synthesis of neural networks will soon emerge. Given the current sta- tus of secure theory, cyberinformaticians par- ticularly desire the important unification of Boolean logic and superpages, which embod- ies the private principles of operating sys- tems. We show that though B-trees can be made “fuzzyâ€, relational, and random, ran- domized algorithms can be made distributed, random, and scalable [21].

    --
    "We have met the enemy and he is us."
    Starting Score:    1  point
    Moderation   +3  
       Insightful=1, Interesting=2, Total=3
    Extra 'Interesting' Modifier   0  

    Total Score:   4