Slashdot Mirror
Domain: xerox.com
Stories and comments across the archive that link to xerox.com.
Comments · 278
-
Ubiquitous Computing
Wasn't much of this started by Xerox at PARC in the 80's? Only they called it 'ubiquitous computing' -- far more accurate than 'sentient'.
Phones would follow you etc, your desktop could move with you (I think). here is one paper on it for example -
What Unix could learn from other systemsIf you are interested in a different, but very well informed, view of the Unix development environment, check out Peter Deutsch's paper "UNIX Needs A True Integrated Environment: CASE Closed".
Deutch proposes ways that UNIX could have some of the advantages of the Lisp and Smalltalk environments that he worked on at PARC while still remaining Unix.
-
Re:Groupware could be a killer app.I think this is a very important point:
For most people collaboration is about the management of documents.
Document management is something I've become more and more interested in over the years, and I think it would be great if my computer helped me do it better. For an interesting approach to document management, I recommend checking out Placeless Documents, a project at Xerox PARC.
-
Paper and Electronic documents
Actually, one of Xerox's products aims to make paper a first-class citizen on the network. Drop your document into a networked copier, scanner, or other device supporting the open standard IFAX (essentially SMTP+MIME+TIFF), and it stores it on the net somewhere and prints out a Document Token -- a one-page paper icon for the document. It's a physical piece of paper that you can get warm fuzzies about holding in your hand, copy as is, give to people, mail, etc. But drop it back into any networked device again and it retrieves the original paper document, formats it and prints it (or emails it or OCR's it or anything you could have done to the original stack of paper it represents).
In short, it makes paper electronic and vice versa.
Disclaimer: I worked on the product, FlowPort
-
Re:Migration/Transition issuesIts important that this is really a big leap forward, and this is made clear to developers before they'll even think about using this kind of code.
And that's where Aspect Oriented programming such as Aspect J will come in. Aspect oriented programming most likely is a big enough leap forward for developers to accept it whenever it goes mainstream. There are some definite clear cut advantages that aspect oriented programming has over OO. But It's late and I don't feel like listing any of them. Visit the site if you haven't already.
-------------------------------------- -
Xerox parc already has done this...
I saw a live demo of Mark Yim's modular reconfigurable robots when I was an intern there. When I was there, they still seemed to have some trouble getting the robot to walk or crawl. It worked great as a wheel or a snake though.
-
Re:Liquid file systemA system like this has been implemented at Xerox PARC. It's called Placeless Documents. It seems to have ended, but there's a follow-on project called Harland that provides an attribute-based storage mechanism for Java (and is available "for trial use", whatever that means).
I've seen presentations about Placeless Documents and it's really cool.
-
Re:Liquid file systemA system like this has been implemented at Xerox PARC. It's called Placeless Documents. It seems to have ended, but there's a follow-on project called Harland that provides an attribute-based storage mechanism for Java (and is available "for trial use", whatever that means).
I've seen presentations about Placeless Documents and it's really cool.
-
yawn. PARC was there.
Xerox PARC has been showing reconfigurable robot technology to visiting summer interns for years.
Their project page is at: parc.xerox.com/spl/projects/modrobots/
There are static images from their demonstrations, including one at comdex '99.
-
yawn. PARC was there.
Xerox PARC has been showing reconfigurable robot technology to visiting summer interns for years.
Their project page is at: parc.xerox.com/spl/projects/modrobots/
There are static images from their demonstrations, including one at comdex '99.
-
Interesting related schtuffThere is apparently a fair amount of research being done on using two mice for various tasks. The approach I've read about is the idea of a transparent tool - instead of moving the mouse over to a tool selection palette, then back to the work area, over and over again, you move the tool palette over the work area with one mouse, and then click through it with the other mouse.
The idea, I think, is it's a bit like driving in nails - your off hand does the work that uses less coordination, positioning and holding the nail in place, while your good hand does the accurate work of pounding it in without smashing your thumb.
Here's a link to what if I'm not mistaken is an influential paper on the subject, some work done at Xerox PARC.
-
Hacking Barney (and Barbie)See Exploring Software Tools for Programmable Embodied Agents, or, Hacking Microsoft Barney (pdf)
Over the summer, we set about making the dream a reality. With a couple of Barney dolls, a PC, a pile of Barney applications and a smart student intern, we set about experimentally determining the protocol by which Barney was controlled. By the end of the summer, after much work, we had a student who could sing all the Barney songs backwards, and a pile of software.
The end result is the "Barney Protocol Stack", a set of software components that applications can use to drive Barney. The basic Barney control mechanism is implemented as a Delphi component. It can be driven directly via an on-screen control panel, to move Barney around, play sound samples or read his sensors. Alternatively, it can listen on a network socket for remote control connections. The remote interface allows applications to be written that talk to a remote Barney server; you can telnet to Barney (which is more than I can do to my NT box). This network protocol level is wrapped up by a Java class called BarneyConnection, which offers facilities to move Barney's arms and legs and register to be informed when his sensors are activated.
Using the Barney Protocol Stack, we built a number of applications for Barney. Some were simply feedback applications, that would tell you the progess of activities such as printing your document. Some were monitoring applications that revealed the state of other systems, such as the current network status. Some were communicative applications, such as one which allowed two people to communicate through "Barney semaphore".
CHI '99 Reviewers' comments - a hoot too -
Hacking Barney (and Barbie)See Exploring Software Tools for Programmable Embodied Agents, or, Hacking Microsoft Barney (pdf)
Over the summer, we set about making the dream a reality. With a couple of Barney dolls, a PC, a pile of Barney applications and a smart student intern, we set about experimentally determining the protocol by which Barney was controlled. By the end of the summer, after much work, we had a student who could sing all the Barney songs backwards, and a pile of software.
The end result is the "Barney Protocol Stack", a set of software components that applications can use to drive Barney. The basic Barney control mechanism is implemented as a Delphi component. It can be driven directly via an on-screen control panel, to move Barney around, play sound samples or read his sensors. Alternatively, it can listen on a network socket for remote control connections. The remote interface allows applications to be written that talk to a remote Barney server; you can telnet to Barney (which is more than I can do to my NT box). This network protocol level is wrapped up by a Java class called BarneyConnection, which offers facilities to move Barney's arms and legs and register to be informed when his sensors are activated.
Using the Barney Protocol Stack, we built a number of applications for Barney. Some were simply feedback applications, that would tell you the progess of activities such as printing your document. Some were monitoring applications that revealed the state of other systems, such as the current network status. Some were communicative applications, such as one which allowed two people to communicate through "Barney semaphore".
CHI '99 Reviewers' comments - a hoot too -
Re:What have they done *lately*?
Digital Paper, and a whole LOT of cool other stuff.
The digital paper is the coolest though. -
Re:What have they done *lately*?
Digital Paper, and a whole LOT of cool other stuff.
The digital paper is the coolest though. -
Re:Maybe for the best
XRX management let PARCS's accomplishments wither on the vine. If Lucent was smart, and not currently busy with spin-offs and watching their stock dive, they would buy PARC and merge in into Bell Labs.
OTOH, I think IBM would make better use of PARC's work on little things like Nanotechnology. Some of their more interesting work lately has been on Digital Video Analysis (think motion capture without artificial cues, for example), Electronic Reusable Paper, Smart Materials, and Modular Robotics. At least, this is the stuff from the projects page that jumps out at me.
IBM is also known for innovation; They designed the first magnetic hard disk, the first realtime computer (for the military), DRAM, Fractals, Thin Film Recording Heads (yet another wonderful upgrade to hard drives), the Scanning Tunneling Microscope which could have a direct effect on Nanotechnology, and a nice impementation of high temperature superconductivity to boot.
Not to mention, IBM has money. I think we have a match here, folks.
-
Re:"Freeloaders and Parasites"
For a specification/statistics on this problem try Huberman Xerox Parc - Free-riding on Gnutella
-
Where's Xerox in all this?
Not too long ago, Scientific American ran a couple of items like this one citing Xerox, and specifically Mark Stefik on digital rights enforcement. So where's Xerox and their tech in all this?
At the Xerox site I found some references to XRML or DPRL (Digital Property Rights Language) and ContentGuard
More XRML at Oasis-Open like this item by Robin Cover.
But I don't see anything off-hand on doing the MP3 kind of thing. That would involve an extension to autonomous devices. Could be done if the devices had decent hard-to-tamper clocks.
There are other people in the same business such as NetActive
It's still not free, of course. But I'm not yet convinced that copyright is dead. I'm willing to pay for rights, but I need the real rights that I used to get, not some constrained version like SDMI.
--
Henry Troup -
Re:the author of this editorial...Not only that, even if no one breaks SDMI as a result of this contest, the RIAA still wins; they get to issue press releases saying "we offered real hackers (oo!) a chance to break our secure music system, and they couldn't do it, so that means our system must be really secure, therefore give us money."
You and I know that's a fallacy. The general public doesn't. And, if anyone comes along and tries to break it later, RIAA can just call them "evil pirates" and rattle the DMCA saber at 'em to shut 'em up...
Sorry, RIAA, I won't be your stooge, no matter how much money you wave under my nose, and no matter who wants to call me "chicken" as a result. See Figure 1.
Eric
-- -
wrong and wrongIt all depends on who you talk to, but many people would disagree about your four "requirements".
The people over at Open Implementation would probably disagree with your statement that a "black box" is necessary to be object oriented (or even that it is desirable at all).
Delegation based languages like Self don't have inheritance but achieve reuse all the same.
Typeless languages don't need polymorphism.
I don't think multi-dispatch would be called "messaging", as there is no "recipient" like there is in single-dispatched languages like C++.
Maybe it's just me, but your four points seem very C++ biased. If you want a different bias of what is "required" to be object oriented take a look at what Eiffelites might say:- should have the notion of class as the central concept
- must have assertions to check preconditions, postconditions, and invariants and produce documentation from them as well as check them at runtime
- classes should be the only modules (i.e. no "namespaces" a la C++)
- every type should be based on a class (so long C++ and Java)
- it should be possible to specify which clients can access which features (i.e. finer granularity than "public", "private", and "protected")
- the genericity mechanism should support constrained genericity (i.e. only classes with the method "sort")
-
Uh oh, it's Huberman againThis article is more hype from Bernardo Huberman at PARC. Huberman is an economist of the libertarian persuasion. His answer to all problems is a market, as becomes obvious when you read his papers. His libertarian bias is so strong that he's written some very bad papers. Worse, some of them have been distributed widely because they said some things some major players wanted to hear, such as his claim that per-packet charging on the Internet was inevitable.
(This happens to bug me personally because he claims to have been the first to observe that the tragedy of the commons problem applies to Internet congestion. He wasn't; I was, in 1985. See RFC970)
As a previous poster noted, the default with Gnutella is not to share anything. That's why so few share. This isn't rocket science.
-
Xerox PARC to sue over mouse pointer.
News just in; Xerox Inc are to file a lawsuit with Apple Computer over the shape of the mouse pointer. Xerox PARC claim that the mouse pointer violates U.S. Patent 3,223,596 which defines the shape and function of the on-screen pointer. The design of said pointer was used in their early Alto systems and took many years of research to perfect. Based on the success of this, Xerox plan to follow up with lawsuits against other companies and individuals involved in the design of windowing systems.
P.S. This is a joke.... -
Re:necessary evils
Let me know when they start making 600 dpi, or even 300 dpi, CRTs.
like these ones ? -
Re:Net-in-a-box?
hm. my hosts file is preventing me from easily reading the whole CNN article, but here's an article about a possibly different company doing the same thing, dating back to 97:
http://Slate.msn.com/webhead/97-02-27/webhead.asp, the website itself is http://www.archive.org/.
The related Xerox project I think is merely affiliated with Archive.org, actually, and is currently called the Internet Ecologies project -
Re: Comfortable paradigms
-
we need new thingsNew GUI's move beyond monitor and keyboard/mouse. Imagine you can do anything, then new gui's start to seem easy. How about a physical address book for browsing digital information? How about legos for file management? (Throw something in the trash like you mean it.) A clock-radio messaging device -- all extensions of the desktop machine. Pulling discreet functions into discreet objects is the key. My folks get really confused trying to work all these different functions on ONE interface, the monitor/kbd/mouse.
Here's a favorite of mine: Calm Technology (1995). A dangling string as 'gui' for network traffic. And a big recent gui improvement: the scrolling mouse. Not a huge thing, but yeah! That makes sense. We need to be ambitious about these things. Remember, it's supposed to be fun.
-
Plenty of good research...There's tons of good GUI research being done:
- zoomable UIs (Pad++)
- two-handed user interfaces (e.g. toolglasses and magic lenses)
- smarter desktops(e.g. Apple Data Detectors, LiveDoc, CyberDesk)
-
Re:DesignIt is a bit ugly, but give it time, consider yourself spoiled by windows and the Mac OS.
Innovative? They all stole it from Xerox PARC so lets not even go through that one again.
You dont have to reinvent the wheel, just build a better wheel. (Or just build a better marketing department it as a better wheel and abuse your )
Innovative? They all stole it from Xerox PARC so lets not even go through that again.More choice is good, and being able do everything through the GUI is essential to a Desktop user (nay Plebain such as myself), but that does not mean the power tools should not be there to let you do everything down to the last detail and leverage your knowledge.
High level programming languages do not make assembly languages any less useful when you need speed and have the know how.
For all their ability, its nice to know that they still cant spell -
ReferancesAdamic and Huberman (1) 99. L. Adamic and B. Huberman. The nature of markets on the World Wide Web, Xerox PARC Technical Report, 1999.
Adamic and Huberman (2) 99. L. Adamic and B. Huberman. Scaling behavior on the World Wide Web, Technical comment on Barabasi and Albert 99.
Aiello, Chung, and Lu 00. W. Aiello, F. Chung and L. Lu. A random graph model for massive graphs, ACM Symposium on the Theory and Computing 2000.
Albert, Jeong, and Barabasi 99. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the World Wide Web, Nature 401:130-131, Sep 1999.
Barabasi and Albert 99. A. Barabasi and R. Albert. Emergence of scaling in random networks, Science, 286(509), 1999.
Barford et. al. 99. P. Barford, A. Bestavros, A. Bradley, and M. E. Crovella. Changes in Web client access patterns: Characteristics and caching implications, in World Wide Web, Special Issue on Characterization and Performance Evaluation, 2:15-28, 1999.
Bharat et. al. 98. K. Bharat, A. Broder, M. Henzinger, P. Kumar, and S. Venkatasubramanian. The connectivity server: fast access to linkage information on the web, Proc. 7th WWW, 1998.
Bharat and Henzinger 98. K. Bharat, and M. Henzinger. Improved algorithms for topic distillation in hyperlinked environments, Proc. 21st SIGIR, 1998.
Brin and Page 98. S. Brin, and L. Page. The anatomy of a large scale hypertextual web search engine, Proc. 7th WWW, 1998.
Butafogo and Schniederman 91. R. A. Butafogo and B. Schneiderman. Identifying aggregates in hypertext structures, Proc. 3rd ACM Conference on Hypertext, 1991.
Carriere and Kazman 97. J. Carriere, and R. Kazman. WebQuery: Searching and visualizing the Web through connectivity , Proc. 6th WWW, 1997.
Chakrabarti et. al. (1) 98. S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and S. Rajagopalan. Automatic resource compilation by analyzing hyperlink structure and associated text, Proc. 7th WWW, 1998.
Chakrabarti et. al. (2) 98. S. Chakrabarti, B. Dom, D. Gibson, S. Ravi Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Experiments in topic distillation, Proc. ACM SIGIR workshop on Hypertext Information Retrieval on the Web, 1998.
Chakrabarti, Gibson, and McCurley 99. S. Chakrabarti, D. Gibson, and K. McCurley.Surfing the Web backwards, Proc. 8th WWW, 1999.
Cho and Garcia-Molina 2000 J. Cho, H. Garcia-Molina Synchronizing a database to Improve Freshness . To appear in 2000 ACM International Conference on Management of Data (SIGMOD), May 2000.
Faloutsos, Faloutsos, and Faloutsos 99. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power law relationships of the internet topology, ACM SIGCOMM, 1999.
Glassman 94. S. Glassman. A caching relay for the world wide web , Proc. 1st WWW, 1994.
Harary 75. F. Harary. Graph Theory, Addison Wesley, 1975.Huberman et. al. 98. B. Huberman, P. Pirolli, J. Pitkow, and R. Lukose. Strong regularities in World Wide Web surfing, Science, 280:95-97, 1998.
Kleinberg 98. J. Kleinberg. Authoritative sources in a hyperlinked environment, Proc. 9th ACM-SIAM SODA, 1998.
Kumar et. al. (1) 99. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for cyber communities, Proc. 8th WWW , Apr 1999.
Kumar et. al. (2) 99. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large scale knowledge bases from the Web, Proc. VLDB, Jul 1999.
Lukose and Huberman 98. R. M. Lukose and B. Huberman. Surfing as a real option, Proc. 1st International Conference on Information and Computation Economies, 1998.
Martindale and Konopka 96. C. Martindale and A K Konopka. Oligonucleotide frequencies in DNA follow a Yule distribution, Computer & Chemistry, 20(1):35-38, 1996.
Mendelzon, Mihaila, and Milo 97. A. Mendelzon, G. Mihaila, and T. Milo. Querying the World Wide Web, Journal of Digital Libraries 1(1), pp. 68-88, 1997.
Mendelzon and Wood 95. A. Mendelzon and P. Wood. Finding regular simple paths in graph databases, SIAM J. Comp. 24(6):1235-1258, 1995.
Pareto 1897. V Pareto. Cours d'economie politique, Rouge, Lausanne et Paris, 1897.
Pirolli, Pitkow, and Rao 96. P. Pirolli, J. Pitkow, and R. Rao. Silk from a sow's ear: Extracting usable structures from the Web , Proc. ACM SIGCHI, 1996.
Pitkow and Pirolli 97. J. Pitkow and P. Pirolli. Life, death, and lawfulness on the electronic frontier, Proc. ACM SIGCHI, 1997.
Simon 55. H.A. Simon. On a class of stew distribution functions, Biometrika, 42:425-440, 1955.
White and McCain 89. H.D. White and K.W. McCain, Bibliometrics, in: Ann. Rev. Info. Sci. and Technology, Elsevier, 1989, pp. 119-186.
Yule 44. G.U. Yule. Statistical Study of Literary Vocabulary, Cambridge University Press, 1944.
Zipf 49. G.K. Zipf. Human Behavior and the Principle of Least Effort, Addison-Wesley, 1949.
___ -
ReferancesAdamic and Huberman (1) 99. L. Adamic and B. Huberman. The nature of markets on the World Wide Web, Xerox PARC Technical Report, 1999.
Adamic and Huberman (2) 99. L. Adamic and B. Huberman. Scaling behavior on the World Wide Web, Technical comment on Barabasi and Albert 99.
Aiello, Chung, and Lu 00. W. Aiello, F. Chung and L. Lu. A random graph model for massive graphs, ACM Symposium on the Theory and Computing 2000.
Albert, Jeong, and Barabasi 99. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the World Wide Web, Nature 401:130-131, Sep 1999.
Barabasi and Albert 99. A. Barabasi and R. Albert. Emergence of scaling in random networks, Science, 286(509), 1999.
Barford et. al. 99. P. Barford, A. Bestavros, A. Bradley, and M. E. Crovella. Changes in Web client access patterns: Characteristics and caching implications, in World Wide Web, Special Issue on Characterization and Performance Evaluation, 2:15-28, 1999.
Bharat et. al. 98. K. Bharat, A. Broder, M. Henzinger, P. Kumar, and S. Venkatasubramanian. The connectivity server: fast access to linkage information on the web, Proc. 7th WWW, 1998.
Bharat and Henzinger 98. K. Bharat, and M. Henzinger. Improved algorithms for topic distillation in hyperlinked environments, Proc. 21st SIGIR, 1998.
Brin and Page 98. S. Brin, and L. Page. The anatomy of a large scale hypertextual web search engine, Proc. 7th WWW, 1998.
Butafogo and Schniederman 91. R. A. Butafogo and B. Schneiderman. Identifying aggregates in hypertext structures, Proc. 3rd ACM Conference on Hypertext, 1991.
Carriere and Kazman 97. J. Carriere, and R. Kazman. WebQuery: Searching and visualizing the Web through connectivity , Proc. 6th WWW, 1997.
Chakrabarti et. al. (1) 98. S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and S. Rajagopalan. Automatic resource compilation by analyzing hyperlink structure and associated text, Proc. 7th WWW, 1998.
Chakrabarti et. al. (2) 98. S. Chakrabarti, B. Dom, D. Gibson, S. Ravi Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Experiments in topic distillation, Proc. ACM SIGIR workshop on Hypertext Information Retrieval on the Web, 1998.
Chakrabarti, Gibson, and McCurley 99. S. Chakrabarti, D. Gibson, and K. McCurley.Surfing the Web backwards, Proc. 8th WWW, 1999.
Cho and Garcia-Molina 2000 J. Cho, H. Garcia-Molina Synchronizing a database to Improve Freshness . To appear in 2000 ACM International Conference on Management of Data (SIGMOD), May 2000.
Faloutsos, Faloutsos, and Faloutsos 99. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power law relationships of the internet topology, ACM SIGCOMM, 1999.
Glassman 94. S. Glassman. A caching relay for the world wide web , Proc. 1st WWW, 1994.
Harary 75. F. Harary. Graph Theory, Addison Wesley, 1975.Huberman et. al. 98. B. Huberman, P. Pirolli, J. Pitkow, and R. Lukose. Strong regularities in World Wide Web surfing, Science, 280:95-97, 1998.
Kleinberg 98. J. Kleinberg. Authoritative sources in a hyperlinked environment, Proc. 9th ACM-SIAM SODA, 1998.
Kumar et. al. (1) 99. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for cyber communities, Proc. 8th WWW , Apr 1999.
Kumar et. al. (2) 99. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large scale knowledge bases from the Web, Proc. VLDB, Jul 1999.
Lukose and Huberman 98. R. M. Lukose and B. Huberman. Surfing as a real option, Proc. 1st International Conference on Information and Computation Economies, 1998.
Martindale and Konopka 96. C. Martindale and A K Konopka. Oligonucleotide frequencies in DNA follow a Yule distribution, Computer & Chemistry, 20(1):35-38, 1996.
Mendelzon, Mihaila, and Milo 97. A. Mendelzon, G. Mihaila, and T. Milo. Querying the World Wide Web, Journal of Digital Libraries 1(1), pp. 68-88, 1997.
Mendelzon and Wood 95. A. Mendelzon and P. Wood. Finding regular simple paths in graph databases, SIAM J. Comp. 24(6):1235-1258, 1995.
Pareto 1897. V Pareto. Cours d'economie politique, Rouge, Lausanne et Paris, 1897.
Pirolli, Pitkow, and Rao 96. P. Pirolli, J. Pitkow, and R. Rao. Silk from a sow's ear: Extracting usable structures from the Web , Proc. ACM SIGCHI, 1996.
Pitkow and Pirolli 97. J. Pitkow and P. Pirolli. Life, death, and lawfulness on the electronic frontier, Proc. ACM SIGCHI, 1997.
Simon 55. H.A. Simon. On a class of stew distribution functions, Biometrika, 42:425-440, 1955.
White and McCain 89. H.D. White and K.W. McCain, Bibliometrics, in: Ann. Rev. Info. Sci. and Technology, Elsevier, 1989, pp. 119-186.
Yule 44. G.U. Yule. Statistical Study of Literary Vocabulary, Cambridge University Press, 1944.
Zipf 49. G.K. Zipf. Human Behavior and the Principle of Least Effort, Addison-Wesley, 1949.
___ -
ReferancesAdamic and Huberman (1) 99. L. Adamic and B. Huberman. The nature of markets on the World Wide Web, Xerox PARC Technical Report, 1999.
Adamic and Huberman (2) 99. L. Adamic and B. Huberman. Scaling behavior on the World Wide Web, Technical comment on Barabasi and Albert 99.
Aiello, Chung, and Lu 00. W. Aiello, F. Chung and L. Lu. A random graph model for massive graphs, ACM Symposium on the Theory and Computing 2000.
Albert, Jeong, and Barabasi 99. R. Albert, H. Jeong, and A.-L. Barabasi. Diameter of the World Wide Web, Nature 401:130-131, Sep 1999.
Barabasi and Albert 99. A. Barabasi and R. Albert. Emergence of scaling in random networks, Science, 286(509), 1999.
Barford et. al. 99. P. Barford, A. Bestavros, A. Bradley, and M. E. Crovella. Changes in Web client access patterns: Characteristics and caching implications, in World Wide Web, Special Issue on Characterization and Performance Evaluation, 2:15-28, 1999.
Bharat et. al. 98. K. Bharat, A. Broder, M. Henzinger, P. Kumar, and S. Venkatasubramanian. The connectivity server: fast access to linkage information on the web, Proc. 7th WWW, 1998.
Bharat and Henzinger 98. K. Bharat, and M. Henzinger. Improved algorithms for topic distillation in hyperlinked environments, Proc. 21st SIGIR, 1998.
Brin and Page 98. S. Brin, and L. Page. The anatomy of a large scale hypertextual web search engine, Proc. 7th WWW, 1998.
Butafogo and Schniederman 91. R. A. Butafogo and B. Schneiderman. Identifying aggregates in hypertext structures, Proc. 3rd ACM Conference on Hypertext, 1991.
Carriere and Kazman 97. J. Carriere, and R. Kazman. WebQuery: Searching and visualizing the Web through connectivity , Proc. 6th WWW, 1997.
Chakrabarti et. al. (1) 98. S. Chakrabarti, B. Dom, D. Gibson, J. Kleinberg, P. Raghavan, and S. Rajagopalan. Automatic resource compilation by analyzing hyperlink structure and associated text, Proc. 7th WWW, 1998.
Chakrabarti et. al. (2) 98. S. Chakrabarti, B. Dom, D. Gibson, S. Ravi Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Experiments in topic distillation, Proc. ACM SIGIR workshop on Hypertext Information Retrieval on the Web, 1998.
Chakrabarti, Gibson, and McCurley 99. S. Chakrabarti, D. Gibson, and K. McCurley.Surfing the Web backwards, Proc. 8th WWW, 1999.
Cho and Garcia-Molina 2000 J. Cho, H. Garcia-Molina Synchronizing a database to Improve Freshness . To appear in 2000 ACM International Conference on Management of Data (SIGMOD), May 2000.
Faloutsos, Faloutsos, and Faloutsos 99. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power law relationships of the internet topology, ACM SIGCOMM, 1999.
Glassman 94. S. Glassman. A caching relay for the world wide web , Proc. 1st WWW, 1994.
Harary 75. F. Harary. Graph Theory, Addison Wesley, 1975.Huberman et. al. 98. B. Huberman, P. Pirolli, J. Pitkow, and R. Lukose. Strong regularities in World Wide Web surfing, Science, 280:95-97, 1998.
Kleinberg 98. J. Kleinberg. Authoritative sources in a hyperlinked environment, Proc. 9th ACM-SIAM SODA, 1998.
Kumar et. al. (1) 99. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for cyber communities, Proc. 8th WWW , Apr 1999.
Kumar et. al. (2) 99. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large scale knowledge bases from the Web, Proc. VLDB, Jul 1999.
Lukose and Huberman 98. R. M. Lukose and B. Huberman. Surfing as a real option, Proc. 1st International Conference on Information and Computation Economies, 1998.
Martindale and Konopka 96. C. Martindale and A K Konopka. Oligonucleotide frequencies in DNA follow a Yule distribution, Computer & Chemistry, 20(1):35-38, 1996.
Mendelzon, Mihaila, and Milo 97. A. Mendelzon, G. Mihaila, and T. Milo. Querying the World Wide Web, Journal of Digital Libraries 1(1), pp. 68-88, 1997.
Mendelzon and Wood 95. A. Mendelzon and P. Wood. Finding regular simple paths in graph databases, SIAM J. Comp. 24(6):1235-1258, 1995.
Pareto 1897. V Pareto. Cours d'economie politique, Rouge, Lausanne et Paris, 1897.
Pirolli, Pitkow, and Rao 96. P. Pirolli, J. Pitkow, and R. Rao. Silk from a sow's ear: Extracting usable structures from the Web , Proc. ACM SIGCHI, 1996.
Pitkow and Pirolli 97. J. Pitkow and P. Pirolli. Life, death, and lawfulness on the electronic frontier, Proc. ACM SIGCHI, 1997.
Simon 55. H.A. Simon. On a class of stew distribution functions, Biometrika, 42:425-440, 1955.
White and McCain 89. H.D. White and K.W. McCain, Bibliometrics, in: Ann. Rev. Info. Sci. and Technology, Elsevier, 1989, pp. 119-186.
Yule 44. G.U. Yule. Statistical Study of Literary Vocabulary, Cambridge University Press, 1944.
Zipf 49. G.K. Zipf. Human Behavior and the Principle of Least Effort, Addison-Wesley, 1949.
___ -
Re:Current Relevance of Moore's Law
very close to the stuff I'm doing right now, though I'm just doing it because it's just sitting in the way of waht I really want to do, really
if you remember the "nasa" snakebot article, that robot was actually a copy of PARC's PolyBot. They have another robot (not completely built yet) called Proteo which is exactly the embodiment of something like this.
Lea -
Re:Current Relevance of Moore's Law
very close to the stuff I'm doing right now, though I'm just doing it because it's just sitting in the way of waht I really want to do, really
if you remember the "nasa" snakebot article, that robot was actually a copy of PARC's PolyBot. They have another robot (not completely built yet) called Proteo which is exactly the embodiment of something like this.
Lea -
Re:you can bet your ass then do!!!
Oh yeah. I was wandering around Xerox Parc's website, and found something which illustrates this beautifully: http://www.parc.xerox.com/i stl/groups/nltt/default.html
Notice who's at the top of the hierarchy? The administrator and manager sit above the researchers, in a research center!
-
Re:Mark Yimoh, there is some cool stuff in there. take a look at the Modular Reconfigurable Robotics page at PARC for some other related projects.
however, about making it cheaper, a lot of what is expensive is custom (and very complex) circuitboards, processors that are very hard to find, and stuff like that. very sweet hardware -- but it's not going to be cost effective right now, or at least until it's a little more developed.
then again, Mark hasn't told me what I'm doing this summer (and I've been too occupied with finals to ask)
Lea -
based on PARC workthis robot is actually a copy of the Polybot built at Xerox-PARC (under a DoD contract, though). there's actually a whole bunch of people under Dr. Mark Yim (though his litte page on the PARC site seems to be doing bad things right now) who work on this in the Modular Reconfigurable Robotics project. they were at the last Comdex with the (more advanced than the model NASA's using) robot that's pictured at the top of their page.
there are also a lot of related projects, such as Proteo and Digital Clay that are also very interesting stuff.
disclaimer: I currently work on this project at PARC (well, when I'm not in school), and I used to work for that group at NASA (for a summer).
Lea
-
Score 5 (Insightful)... How about "Flamebait"?Wow, here we go around the "rms is a communist" maypole again. Karzan tells rms to "shut up" instead of actually debating his points, and finally ends with some demogogary about us all working in coal mines. Riiiigggghhhhht. Next time you want to call rms a communist, why don't you read what he has to say on the issue and debate those specific points instead of flat out accusing him of being a communist. Oh, and calling people who disagree with your views on intellectual property law "anti-intellectual-property cronies" pretty much rules out informed and reasoned debate. IMO this post doesn't deserve a single moderation up... but today I'm no moderator.
So, let's deal with your assertions:
Ok, first of all, eBooks are NOT going to replace real books; people like paper books. Books are static information, and people like to have an object associated with that information, something with a smell and a feel that reminds them of the last time they read it, etc. I'm sure this has all been said before anyway.
What a ridiculous assumption. Paper is expensive to manufacture and dangerous to the environment, especially considering how much of it we throw into landfills after a single use (never mind the toxic waste released during manufacture). The limit to electronic print distribution is the initial cost of a reader plus the limited display technology of current readers on the market. Don't expect a Palm III to become the standard for electronic newspapers. But new display technology coming down the road makes your point moot:- Xerox PARC's Electronic Paper This technology takes two plastic sheets and immerses tiny beads, one side coated black the other white, inside a wax-like substrait sandwiched between the two sheets. With a small electric current any arbitrary ball twists in the substrait and thus changes it's color. This technology should allow for a flexible 8 1/2 x 11" sheet which can represent at least 300dpi... easily good enough for an electronic newspaper or book.
- Then there's AT&T's eink, another technology which promises similar display capabilities.
Regarding rms's opinions on Copyright law... did you read the article he wrote? Did he say that all copyright law should be abolished? Did he say that all capitalism should be abolished? Did he suggest we would be better off working in Coal mines because that's real work? I sure didn't see anything like that in what he wrote.
Personally, given the DMCA and subsection 1201(a)(1) I'm seriously concerned that we're heading toward a society where even basic "fair use" rights for libraries, citizens conducting scholarly research, and the right to read an item multiple times are in serious jeopardy. Given the technical restrictions imposed by 1201(a)(1), a publisher could limit a reader to a specific city (just stick a GPS chip in that ebook reader), a specific user (just stick a fingerprint or retina scanner on the reader), and even have the publication wipe itself out upon first reading. As others (and myself in a previous post in this thread) point out, this could herald a real Orwellian world in which newspapers and publications could rewrite history after the fact; destroying the public historical record. And what happens if libraries, and their users, aren't exempt from paying a license fee for each access of an electronic publication?
And finally, where did Adam Smith ever claim that Capitalism depended on intellectual property law? That's a pretty ridiculous claim on the surface. - Xerox PARC's Electronic Paper This technology takes two plastic sheets and immerses tiny beads, one side coated black the other white, inside a wax-like substrait sandwiched between the two sheets. With a small electric current any arbitrary ball twists in the substrait and thus changes it's color. This technology should allow for a flexible 8 1/2 x 11" sheet which can represent at least 300dpi... easily good enough for an electronic newspaper or book.
-
Re:Sensationalism
It depends upon the corporation or the part of the corporation one is involved in. We know some of the things which Xerox PARC created.
-
Just waiting for electronic paper
-
Re:Cross-platform...OSes are not the end-all-be-all of Java, either. example: a modular reconfigurable robot from Xerox-PARC called Polybot. (if you were at comdex and caught John Seeley Brown's keynote speech, you saw it. there have also been lots of print, online, and TV pieces on it) it runs on PowerPC chips running compiled Java.
there are lots of embedded Java things coming out now that run embedded Java. remember that the original demo for the language (if I remember correctly) back when it was called Oak, was a bulky TV remote control.
Lea
Warning: the Polybot link will take you to a page that my Mozilla M13 will render and then turn blank grey. I have no idea why, but you might want to try Netscape instead. (or IE, if you're that sort of person)
-
Acceptance of Linux
The business community acceptance of Linux is a side effect. Probably an undesireable one. It's our OS. If you don't like it, See Figure One and go back to Windows.
-
Re:Lisa UI
wasnt even a processor powerful enough to make all the pretty widgets work.
The Lisa was based on the Xerox Alto (See here, here, here, and here) from the early 70's, so it was certainly doable, although perhaps not with the single-chip-CPU concept that seems to be the only thing the kids of today can conceive of.
And no, I don't have one in my collection. Yet.
-
What about the DVD stuff
He told the DVD companies to check out Figure 1
-
Xerox DocuPrint P12$400. Built very well. Fast print speed (12 ppm), 600 dpi, and Linux thinks it is a Laserjet 4. Memory upgrade via SIMM. A little bit above the $300 price tag, but I highly recommend this printer for just about any home or office. See it here.
Disclaimer: I am only a satisfied user. I own stock in HP, not Xerox.
-
Re:Diagram of Unistroke Characters
I agree. here is a diagram that compares the two character sets from a paper comparing the two.
Obviously, the goal of Graffiti was to develop a system that was learnable. It appears to me based on the simplicity of the vowels, that the primary goal of Unistrokes was to limit total pen strokes. One way Unistrokes achieves this is by relying on the vector of the stroke so the writing can ONLY be read by the input device since the characters for M & N, U & V, C & D, E & T, A & I and K & Y, are identicle pairs if the system is used on paper. Another argument, is that there is no penstroke in any Graffiti character that is the same as a pen stroke from the corresponding Unistroke character, that isn't already part of the letter it represents.
The fact that Graffiti is a "unistroke" system (ie you make contact with the writing surface just once for each character) can't in itself make it a patent infringement, otherwise the Unistrokes patent would be invalid based on cursive handwriting being prior art.
If Xerox wants to make a case, it should go after the use of pen-input (to call Unistrokes handwriting is too much of a stretch) for PDA's which they might be able to establish based on their development of the PARCtab starting in 1992.
(Full Disclosure Notice, I own a small ammount of 3COM stock) -
PARC's current web address
For those who want to see what PARC is working on now...
http://www.parc.xerox.com -
unistrokes != grafiti
To me it appears that the unistrokes alphabet is designed for speed of entry while the grafiti alphabet is designed for rapid learning. There is an obvious correlation between grafiti strokes and the letters they represent, whereas unistrokes are pretty much random.
See for yourself:
Grafiti strokes
Unistrokes
And if they've just patented a way of entering characters via strokes, well, that's pretty obvious when it's your only method of input. Not that obviousness seems to matter to patents anymore. -
PARC papers on UnistrokesI've been aware of this issue since before this case was even filed, having read the original Unistrokes papers. Xerox, unsurprisingly, really did some innovative and interesting HCI research w.r.t. Unistrokes. A few of these papers (including one from INTERCHI) are available here.
FWIW, Xerox informed 3Com of the violation presented by Graffiti and did attempt to negotiate terms in good faith. Negotiations broke down (I heard that 3Com essentially told Xerox to bugger off), so Xerox took 'em to court.
I've heard of unofficial Unistrokes packages floating around for various PDAs -- anyone with direct experience with both Graffiti and Unistrokes care to compare the two? (Tho, IMO, the Newton MP2x00 handwriting recognition has yet to be met or exceeded.)
-
Re:How old is this patent?
Not only is Xerox PARC alive and well (I was there this summer), Xerox intends to take a very close look at its patent portfolio with every intention of making some money from it. There's a lot of technology in PARC that Xerox will never bring to market itself. The days of ignoring things that don't fit the corporate mission are gone.
-
It's in *France* stupid...If you go to the Xerox Parc map server you'll see there's a squigly bit to the left with a top blob and a bottom blob. The United States of America is in the top blob. It's not the whole of the top blob, but it's in there somewhere.
Now, if you look in the middle sort of three-quarters of the way up you'll find another funny shaped bit that's called 'Europe'. In Europe there's a country called 'France'. Now the bit that you may not have noticed is this: it isn't part of the United States of America. Furthermore, the people there fart in the general direction of your Supreme Court. They think that your president is a hamster and that your senate smells of elderberies. In short, they're FRENCH
Now the point about this story is it happens in France. The people there are French. The goodies in this story are French. The baddies are French. Even the bold Gendarmes are French.
Messing about with American tort law, or sending American execs who break American laws to American prisons, is going to worry them not one little bit.
