Slashdot Mirror

← Back to Domains

Domain: sunysb.edu

Stories and comments across the archive that link to sunysb.edu.

Comments · 162

  1. an other way of selfcensorship by dermond · · Score: 1 · on Munich, The Censors' Convention

    recently on freshmeat i found an interesting announcment:


    the open GRiD project

    very interesting. if that project would be successfull then it would improve the power of search engines..but also make censorship very easy. one could get a very accurate messarement how much a page is lets say: right wing, left wing, pornographic, critical towards this and that, etc...

    the difference to the self censorship mentioned here is that it would be done not be the person who owns the site but the people who link to that..


    mond.

  2. opengrid & possible internet self-censorship by dermond · · Score: 1 · on PICS and the Global Rating System

    recently on freshmeat i found an interesting announcment:


    the open GRiD project

    very interesting. if that project would be successfull then it would improve the power of search engines..but also make censorship very easy. one could get a very accurate messarement how much a page is lets say: right wing, left wing, pornographic, critical towards this and that, etc... and i think people could (and would) use that information for the purpose of censorship...

    greetings from vienna, austria.

    der mond

  3. Does anyone have a mirror for Ted Shieh's paper? by ron_nelson · · Score: 1 · on 3rd State of the Perl Onion

    I'd like to check Ted's paper, supposedly at http://odin.bio.sunysb.edu/~tshieh/soft ware but it looks like he may have graduated... At least no sign of his work is on odin, and he's not mentioned on the SUNY sites.

    Any ideas on where to find his work?

  4. Resources for TSP by Roundeye · · Score: 1 · on Feature:Obscurity as Security
    The travelling salesman problem is a decision problem (is there a tour of length k which visits every city (variation:exactly once)?). The optimization problem is simple to construct: merely solve the decision problem for k=1,2,3,4,... The lowest value of k which generates a "yes" from the decision problem is the length of the optimal path. This is polynomial if the running time of the decision problem is polynomial, which has been shown "in the literature" (this is not an obvious result as presented).

    What you seem to be talking about (I'm really stretching to fathom whatever it is you're trying to say) is a subset of TSP which assumes the triangle inequality (i.e., distances obey geometric rules). Unfortunately, this is a small subset of TSP for which numerous good results are known. Additionally you seem to imply that you were solving the problem on complete graphs, a *severely* restricted subset of TSP for which extremely good results (i.e., linear time in the size of the graph, IIRC) are known.

    Some of you might be interested in looking at the Travelling Salesman page at the Stony Brook Algorithms Repository (which I helped put together (sorry for the shameless plug, but ignorance is a terrible thing to let fester)).

  5. Resources for TSP by Roundeye · · Score: 1 · on Feature:Obscurity as Security
    The travelling salesman problem is a decision problem (is there a tour of length k which visits every city (variation:exactly once)?). The optimization problem is simple to construct: merely solve the decision problem for k=1,2,3,4,... The lowest value of k which generates a "yes" from the decision problem is the length of the optimal path. This is polynomial if the running time of the decision problem is polynomial, which has been shown "in the literature" (this is not an obvious result as presented).

    What you seem to be talking about (I'm really stretching to fathom whatever it is you're trying to say) is a subset of TSP which assumes the triangle inequality (i.e., distances obey geometric rules). Unfortunately, this is a small subset of TSP for which numerous good results are known. Additionally you seem to imply that you were solving the problem on complete graphs, a *severely* restricted subset of TSP for which extremely good results (i.e., linear time in the size of the graph, IIRC) are known.

    Some of you might be interested in looking at the Travelling Salesman page at the Stony Brook Algorithms Repository (which I helped put together (sorry for the shameless plug, but ignorance is a terrible thing to let fester)).

  6. No samovar swards to Amiga :-) by AShuvalov · · Score: 1 · on Linus on Amiga decision
    Samovar awards, July

    Amiga announced recently it is dropping one of the best modern OS's QNX to join the crush of Linux supporters. Although Amiga is right that this market is going to be huge, but it will compete directly with other Linux vendors like IBM, Dell, Compaq etc., etc. with the real risk to loose its unique face. The president Collas said: "PLEASE, PLEASE, PLEASE do not to judge the Linux decision until you have a chance to read the technology brief". Ok, no award for them. And welcome on board, sure!

  7. Show that Linux users don't play favourites.. by SiW · · Score: 1 · on PCI Modems and Linux?

    This is a chance to show the world that Linux users don't just write drivers for the stuff they think is cool. The typical community response to a new cost-cutting device so far has been "get a real xxx". Well, Linux is carving itself a niche in low-cost PCs (under $500) and there's going to be more and more "non-real" hardware - and if Linux doesn't support it, another OS will take its place.

    Now, I was looking around for spec info on these LT modems, but couldn't find any. I did find this page on PCI Modems and Linux, hope it helps someone.

  8. Samovar award to Caldera by AShuvalov · · Score: 1 · on Caldera Graphic Installation Screenshots

    http://www.ecsl.cs.suny sb.edu/~andrew/awards/1999/June.html Do you remember this boring new operating system installation procedure? I do, while I install over 20 new OS's every year. Now things are getting better while Caldera lets you play while computer works. Look at the screenshot here. Yes, that's the old good Tetris ( invented by Pajitnov ). So Caldera gets the award as the best sysadm entertainer. But there is another thing to say.. do you remember that real sysadm's hate graphic user interface?

  9. Samovar award to iToaster by AShuvalov · · Score: 1 · on BeDope clarifies iToaster issue
    http://www.ecsl.cs.suny sb.edu/~andrew/awards/1999/June.html

    Just one week after the last award for players in the October embedded contest, the battle rages on. BeOS gets the point after the rumor of talks between Microworkz.com and AOL. It may happens that AOL will distribute this device for free in exchange to online subscription fees. The small iToaster can take this new market by storm. What else to say... Do you know that BeOS is written on C++?

  10. Award for pragmatism. by AShuvalov · · Score: 1 · on Sun Opening Microprocessor Technology

    Hi All!
    I made a new Samovar award for this Sun's move:

    March awards

  11. What's to evolve AFTER Google? by Maxim · · Score: 1 · on Google goes Beta
    You might wish to look at the Open GRiD Project page: http://www.cs.sunysb.edu/~maxim/OpenGRiD/

    Open GRiD stands for Open Global Ranking Search Engine and Directory.

    The ideas of this project should lead to creation of a distributed architecture for searching, ranking, and categorization, that improves on the good features of Google (and the Open Directory) as to for example provide Google ranks with stabilizing peer-review and evaluation feedback (currently Google uses only positive feedback).

  12. A paper DEVELOPING on the principles of Google by Maxim · · Score: 1 · on Techweb article on Google

    There is a paper called The Christmas Document that proposes a new architecture for Internet searching, categorization, and ranking: it is to be contributed to, maintained, and controlled collectively and consistently by all the people who surf and create the Web pages.

    A reference:
    I think something along these lines is certainly a good idea.
    Sergey Brin, President, Google.com

    Maxim