mak-developer Mailing List for MindMap and Knowledgemanager
Brought to you by:
sundance
You can subscribe to this list here.
2000 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
(16) |
---|---|---|---|---|---|---|---|---|---|---|---|---|
2001 |
Jan
(3) |
Feb
(2) |
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
From: David Li <da...@di...> - 2001-02-18 08:16:25
|
Hi, Finally, I have some free to start hacking. :) I just found this pacakge on sourceforge that seems to do decent graph layout. I think it's can be used as the graph layout layer for mak. --- http://openjgraph.sourceforge.net/ |
From: wildatheartx <wil...@gm...> - 2001-02-15 22:27:32
|
who knows, how to start the following programs under windows (from java (e.g.) Runtime.getRuntime().exec("xemacs")): excel and a link, that points to a binary Thanks for any hints Richard |
From: Dan B. <dan...@ya...> - 2001-01-20 07:30:15
|
Hi there. I've been lurking on your mailing list. I was most interested in finding apps that could be merged into phpgroupware. I'm sorry to say that I haven't tried using your software yet, so I don't know if it's architecturally suitable to integrate into a php-based web-based collaboration API. But Mak does seem to be an application with a lot of collaborative potential, and if you'd consider php, you could benefit a lot from phpgroupware's API. I'll keep lurking on your list and I'll try out your software pretty soon. :) Please take a look at http://phpgroupware.sourceforge.net and http://phpgroupware.org. Thanks! --- wil...@gm... wrote: > > > Hello, > I just read your email (and you can imagine I was very happy, that > there was > interest in what is currently developing). > At the time I've no IRC, in fact I'm a little cut off (I'm actually > in > france, but soon back home) where the computers and the Internet is > really > getting going. > Grant me a few question, hope I don't derange (hope this word exists > in > english) you, did the 'installation' work, how did you find it then, > are you > interested in helping developing, and if yes, which role > (project-management, developer, ...) > > Greetings > Richard > > > -----Ursprüngliche Nachricht----- > Von: mak...@li... > [mailto:mak...@li...]Im Auftrag von Dan > Bethe > Gesendet: Freitag, 1. Dezember 2000 23:27 > An: mak...@li... > Betreff: [Mak-developer] hello > > > Hi there. How's it going? :) > Do you have an IRC channel? If not, I invite you to make one on > irc.openprojects.net. I'll see if #mak is taken and if not, I'm > there. > I'm 'dtm' there. ===== "Don't expect your own messiah; this neverworld which you desire is only in your mind." -- http://www.dreamtheater.net/songb4.htm#IV5 __________________________________________________ Do You Yahoo!? Yahoo! Auctions - Buy the things you want at great prices. http://auctions.yahoo.com/ |
From: <wil...@gm...> - 2001-01-08 13:53:01
|
Hello, I want to share some ideas I've about the learning support. I partition this text in the following parts: a.) Difficulty Levels, b.) Certification, c.) Scenario a.) Difficulty Levels You have different difficulty levels, and a different compensation for each. Levels: The first (implemented), you see the full mindmap, and you have to find the path to random selected nodes. The second (you just see the nodes of the next depth) and you have to find again the path Third (you see just your current node, and the yet processed tree) and you have to enter the name of the nodes in the path to your target node. Compensation: You get points for each node you found. The points decrease with the time you need to find the node. The result is multiplied with the number of nodes you already found (I think, you know the map better, if you found 100 nodes, taking 1 minute average for each, as finding 2 nodes in 5 seconds and then viewing your results) Different levels are differently valued, for example level 1 means each found node 5 points, level 3 each found node 100 points. b.) Certification Someone can make up a mindmap, say a linux documentation. And define criterias, for different mastery levels. For example 1000 points in 10 minutes means: ultimate linux master. c.) This allows the following scenario: Release a linux mindmap, and anyone, who has mastered a degree(certification) gets a plain text file with his score, personalities encrypted. He can mail this text file to the releaser of the mindmap, and the releaser (snail)mails him back a certificate. With this you can get directly certified on a documentation of a software or whatever is in the mindmap. |
From: <wil...@gm...> - 2001-01-02 22:08:49
|
Hello I am back, and I wish us all a successful new year. Richard |
From: <wil...@gm...> - 2000-12-28 21:37:46
|
Hello, the code is finally in the CVS repository. It didn't work from my windows account, but now I tried it from my old university account (good old linux machines) and it worked (what a difference it makes if the internet connection gets cheaper :)) I hope it now works out for you. Richard PS: I'm leaving today until the 2.jan for Paris and won't be online in that time. |
From: <wil...@gm...> - 2000-12-22 14:46:50
|
The idea of KAL (Knowledge Association Layers) is really just how to make views on knowledge, but it must be compatible with the hasTo or isA philosophy, for which it may be useful to define a Default Layer. Some ideas about the zigzag structure: Perhaps I'm wrong, and my point of view is just a result of ignorance (I just read the introduction with the samples on the structure), but I think the gzigzag approach is much too inflexible and complicated, for the following reasons, inflexible: you can only show two dimensions (merge two views) at a time (if you are a very creative gui programmer, you might have three dimensions, but I think this is really a hard work to understand as well (I had once the experience in my course neuro-physiological-basics of the human mind)) complicated: handling dimensions is always a complicate task for the human brain, swapping dimensions is real work. Swapping knowledge along three dimensions, I don't want to explain it to the pointy haired manager :) The third aspect, I'd like to give is, that it seems to be exact the same difference between C++ and Java: C++ has multiple roots, which are all user defined, like zigzag where you have multiple dimensions which are all purely user defined. Java you have a single rooted hierarchy, which starts with Object, so if you're calling toString, or you are getting Objects from a Vector you don't need to know nothing about them. This is comparable to the default layer (that arose from the previous mails), where there is handled the basic two relations, isA hasA. If you find a new knowledge-base you can assume the semantic of the default layer, without any knowledge (about views), that the user additionally added. Thank you for comments Richard -----Ursprüngliche Nachricht----- Von: mak...@li... [mailto:mak...@li...]Im Auftrag von Frank V. Castellucci Gesendet: Freitag, 22. Dezember 2000 06:11 Cc: mak...@li... Betreff: Re: [Mak-developer] Call for Requests- Knowledge Association Layers Ok, maybe I'm confused. I was under the impression that the toolset was to model knowledge. The ideas of "dimensions" are really just views based on some subjective criteria that may or may not be relevant across the graph, in my mind anyway. For the nodes to represent knowledge means that there is some ontological information (metamodel) which describes the relationships (arcs) between nodes. Generic knowledge engineering involves the minimal concepts of subsumption, where parent and child are implicit in the structure. The relationships that are created within this structure are based on the domain being modeled. Another term from the generic world is roles. Roles capture the relationship semantics (attributes) and there are rules which govern those. For example: (where A and C are implicitly subsumed by "Thing" or "Root") concept C concept D subsumed by C concept A role SomeRole C concept B subsumed by A SomeRole D which shows that A defines the attribute SomeRole and is restricted to C or that which C subsumes, making the filled (or assignment if you will) statement of SomeRole D semantically valid because C subsumes D. Roles can have cardinality restrictions [0, infinity], which can be further specialized down the subsumption path. So: concept C concept D subsumed by C concept E subsumed by C concept A role SomeRole C concept B subsumed by A SomeRole [0,2] {D,E} | {} | {D} which specializes the cardinality to allow at most 2, but also the null set and/or 1 filler. Jared Rhine wrote: > > [Citation date: Thu, 21 Dec 2000 07:28:20 -0500] > > >>>>> Frank == Frank V Castellucci <fr...@co...> > > Frank> Is the "dimensional" view aspect akin to an orthogonal view > Frank> based on the "attribute" space? > > Hmmm, somewhat, except that (to my knowledge in current > implementations) dimensions are not automatically constructed, so > any "attribute space" would need to be constructed manually, and > there's no requirement that the results be structured in the same > manner as would a slice through attribute space. > > Frank> concept Foo > Frank> attribute A string; attribute B string; > > Frank> I can view it in terms of 'A' or 'B'? > > You could construct dimensions which model this. You could also have > a dimension 'C' which matches none of the real attributes. > > Frank> or is it more > > Frank> concept Foo; > > Frank> concept Bar > Frank> attribute HasFoo Foo; > > Frank> and view it in terms of HasFoo? > > This latter structure is closer to the "tag/keyword" structure that I > outlined as an another alternative to hierarchical structure. I find > this structure easier to implement and use than full-on dimensions. > > -- ja...@wo... > > "To live is to war with trolls." -- Ibsen > > _______________________________________________ > Mak-developer mailing list > Mak...@li... > http://lists.sourceforge.net/mailman/listinfo/mak-developer -- Frank V. Castellucci http://corelinux.sourceforge.net OOA/OOD/C++ Standards and Guidelines for Linux http://PythPat.sourceforge.net Pythons Pattern Package _______________________________________________ Mak-developer mailing list Mak...@li... http://lists.sourceforge.net/mailman/listinfo/mak-developer |
From: Frank V. C. <fr...@co...> - 2000-12-22 05:06:45
|
Ok, maybe I'm confused. I was under the impression that the toolset was to model knowledge. The ideas of "dimensions" are really just views based on some subjective criteria that may or may not be relevant across the graph, in my mind anyway. For the nodes to represent knowledge means that there is some ontological information (metamodel) which describes the relationships (arcs) between nodes. Generic knowledge engineering involves the minimal concepts of subsumption, where parent and child are implicit in the structure. The relationships that are created within this structure are based on the domain being modeled. Another term from the generic world is roles. Roles capture the relationship semantics (attributes) and there are rules which govern those. For example: (where A and C are implicitly subsumed by "Thing" or "Root") concept C concept D subsumed by C concept A role SomeRole C concept B subsumed by A SomeRole D which shows that A defines the attribute SomeRole and is restricted to C or that which C subsumes, making the filled (or assignment if you will) statement of SomeRole D semantically valid because C subsumes D. Roles can have cardinality restrictions [0, infinity], which can be further specialized down the subsumption path. So: concept C concept D subsumed by C concept E subsumed by C concept A role SomeRole C concept B subsumed by A SomeRole [0,2] {D,E} | {} | {D} which specializes the cardinality to allow at most 2, but also the null set and/or 1 filler. Jared Rhine wrote: > > [Citation date: Thu, 21 Dec 2000 07:28:20 -0500] > > >>>>> Frank == Frank V Castellucci <fr...@co...> > > Frank> Is the "dimensional" view aspect akin to an orthogonal view > Frank> based on the "attribute" space? > > Hmmm, somewhat, except that (to my knowledge in current > implementations) dimensions are not automatically constructed, so > any "attribute space" would need to be constructed manually, and > there's no requirement that the results be structured in the same > manner as would a slice through attribute space. > > Frank> concept Foo > Frank> attribute A string; attribute B string; > > Frank> I can view it in terms of 'A' or 'B'? > > You could construct dimensions which model this. You could also have > a dimension 'C' which matches none of the real attributes. > > Frank> or is it more > > Frank> concept Foo; > > Frank> concept Bar > Frank> attribute HasFoo Foo; > > Frank> and view it in terms of HasFoo? > > This latter structure is closer to the "tag/keyword" structure that I > outlined as an another alternative to hierarchical structure. I find > this structure easier to implement and use than full-on dimensions. > > -- ja...@wo... > > "To live is to war with trolls." -- Ibsen > > _______________________________________________ > Mak-developer mailing list > Mak...@li... > http://lists.sourceforge.net/mailman/listinfo/mak-developer -- Frank V. Castellucci http://corelinux.sourceforge.net OOA/OOD/C++ Standards and Guidelines for Linux http://PythPat.sourceforge.net Pythons Pattern Package |
From: Jared R. <ja...@wo...> - 2000-12-21 20:51:34
|
[Citation date: Thu, 21 Dec 2000 07:28:20 -0500] >>>>> Frank == Frank V Castellucci <fr...@co...> Frank> Is the "dimensional" view aspect akin to an orthogonal view Frank> based on the "attribute" space? Hmmm, somewhat, except that (to my knowledge in current implementations) dimensions are not automatically constructed, so any "attribute space" would need to be constructed manually, and there's no requirement that the results be structured in the same manner as would a slice through attribute space. Frank> concept Foo Frank> attribute A string; attribute B string; Frank> I can view it in terms of 'A' or 'B'? You could construct dimensions which model this. You could also have a dimension 'C' which matches none of the real attributes. Frank> or is it more Frank> concept Foo; Frank> concept Bar Frank> attribute HasFoo Foo; Frank> and view it in terms of HasFoo? This latter structure is closer to the "tag/keyword" structure that I outlined as an another alternative to hierarchical structure. I find this structure easier to implement and use than full-on dimensions. -- ja...@wo... "To live is to war with trolls." -- Ibsen |
From: <wil...@gm...> - 2000-12-21 19:51:43
|
I modelled the examples given in the gzigzag introductory document in the actual mak concept style with layers. Thanks for comments. |
From: <wil...@gm...> - 2000-12-21 14:00:21
|
I want to talk about a new feature: A MindMap is an archiving tool, that is clear. That it should be possible to to archive any knowledge is clear as well. Even Paper, or Bills. My vision is: You have a ContentType "PhysicalObject", which has operations like "putInStore" "getFromStore" and each time you put or get it from the Store a little MindStorm Robot runs and gets it from your shelf or puts it back in the shelf. Perhaps Papers have something like getCopy, and if I run the getCopiesFromStore on the root node of all my bills of the last year, I can send the result to the man who makes my taxes. Is anyone interested in implementing or does someone know anyone with LegoMindstorm (programming) knowledge (or if there are better robot implementations you'r free to name them). Cheers Richard |
From: Frank V. C. <fr...@co...> - 2000-12-21 12:25:20
|
Is the "dimensional" view aspect akin to an orthogonal view based on the "attribute" space? So if I have: concept Foo attribute A string; attribute B string; I can view it in terms of 'A' or 'B'? or is it more concept Foo; concept Bar attribute HasFoo Foo; and view it in terms of HasFoo? Jared Rhine wrote: > > [Citation date: Tue, 5 Dec 2000 14:40:57 +0100] > > >>>>> wildatheartx == wildatheartx <wil...@gm...> > > wildatheartx> These is the problem where Knowledge Association > wildatheartx> Layers should deal with. You have a bunge of nodes, > wildatheartx> which you want to connect. You can connect them. In > wildatheartx> the first Layer by author in the second layer by > wildatheartx> epoche. So if you choose one of the different > wildatheartx> layers, you can see the nodes, with only the > wildatheartx> connections between them you inserted in this layer. > > This is to-a-large-part implemented with Ted Nelson's [1] ZigZag [2] > structure, which using "dimensions" as your layers. There is a > sourceforge project for a Java open-source implementation called > gZigZag [3]. gZigZag is very actively developed. > > Your library-categorization problem is the example I use as well when > I'm trying to discuss hierarchical versus non-hierarchical > structures. The other way to approach the problem is using "tags" or > what I call the "multiple-keyword controlled vocabularies" approach. > You have a number of vocabularies, such as authors, category, rating, > etc, and each resource (the book, for instance) is tagged by zero or > more keywords from each vocabulary. Then you can search through the > information space easily, by picking just one of the vocabularies as a > starting dimension. > > I have a simple implementation of a bookmark application [4] where > each bookmark is tagged by one or more keywords from flat category > list, but it lets me take nice slices through my database easily, for > easy retrieval. I used to have large bookmark lists in my browser, > but the hierarchical structure gets annoying quickly. > > It would be amazing to have a multiple-dimensional "mindmap" with some > of these characteristics but the details of making it workable make my > head hurt. > > [1] http://www.sfc.keio.ac.jp/~ted/ > [2] http://www.xanadu.net/zigzag/ > [3] http://www.gzigzag.org/ > [4] http://www.wordzoo.com/bookmarks > > -- ja...@wo... > > "One cannot mark the point without marking the path." > > _______________________________________________ > Mak-developer mailing list > Mak...@li... > http://lists.sourceforge.net/mailman/listinfo/mak-developer -- Frank V. Castellucci http://corelinux.sourceforge.net OOA/OOD/C++ Standards and Guidelines for Linux http://PythPat.sourceforge.net Pythons Pattern Package |
From: Jared R. <ja...@wo...> - 2000-12-21 05:58:51
|
[Citation date: Tue, 5 Dec 2000 14:40:57 +0100] >>>>> wildatheartx == wildatheartx <wil...@gm...> wildatheartx> These is the problem where Knowledge Association wildatheartx> Layers should deal with. You have a bunge of nodes, wildatheartx> which you want to connect. You can connect them. In wildatheartx> the first Layer by author in the second layer by wildatheartx> epoche. So if you choose one of the different wildatheartx> layers, you can see the nodes, with only the wildatheartx> connections between them you inserted in this layer. This is to-a-large-part implemented with Ted Nelson's [1] ZigZag [2] structure, which using "dimensions" as your layers. There is a sourceforge project for a Java open-source implementation called gZigZag [3]. gZigZag is very actively developed. Your library-categorization problem is the example I use as well when I'm trying to discuss hierarchical versus non-hierarchical structures. The other way to approach the problem is using "tags" or what I call the "multiple-keyword controlled vocabularies" approach. You have a number of vocabularies, such as authors, category, rating, etc, and each resource (the book, for instance) is tagged by zero or more keywords from each vocabulary. Then you can search through the information space easily, by picking just one of the vocabularies as a starting dimension. I have a simple implementation of a bookmark application [4] where each bookmark is tagged by one or more keywords from flat category list, but it lets me take nice slices through my database easily, for easy retrieval. I used to have large bookmark lists in my browser, but the hierarchical structure gets annoying quickly. It would be amazing to have a multiple-dimensional "mindmap" with some of these characteristics but the details of making it workable make my head hurt. [1] http://www.sfc.keio.ac.jp/~ted/ [2] http://www.xanadu.net/zigzag/ [3] http://www.gzigzag.org/ [4] http://www.wordzoo.com/bookmarks -- ja...@wo... "One cannot mark the point without marking the path." |
From: Frank V. C. <fr...@co...> - 2000-12-18 20:46:07
|
I responded to the Project Help Wanted and figured I'd just mosey on in here. What's up with the project? |
From: <wil...@gm...> - 2000-12-05 13:31:00
|
Motivation: As we all know, there are often different views on knowledge. This is a feature where the mightiest tools for displaying knowledge in a tree format fail (Even the NT Explorer, that outperformes yet any mindmap implementation on the market, that has just tree support). e.g.: You have 20 books you want to make a mindmap with containing the titles and a short information when you read it, how you rated it, who is the author, when it is written. The Problem is for now: How do you categorize them: by author, this would give a very flat mindmap by epoche, by rating, by category (science fiction, documentation, technical). by editor and then by author ? These is the problem where Knowledge Association Layers should deal with. You have a bunge of nodes, which you want to connect. You can connect them. In the first Layer by author in the second layer by epoche. So if you choose one of the different layers, you can see the nodes, with only the connections between them you inserted in this layer. We could even go further and overlay layers: That means, bottom layer is by author, then by category, and after that by epoche. |
From: <wil...@gm...> - 2000-12-04 01:16:11
|
-------IMPORTANT: All documentation and roadmap stuff is in the directory: "public", of the current release download The following changes have been made since the last release candidate. Usability + Windows Startscript TextComponent Redesign Fontsize 10, transparent, no borders, cursor only appearing when pointing in text component Toolbar Redesign (only appearing, when pointed on element, transparent) Add Multiple Choice Test for Languages Better Database Table association algorithm Retriever Improvement (prototype, must be conceptuated) Table for current Lesson Information instead of List The following will be made definitely in the next: Frozen xml-Save format, saving and loading all nodes correctly |
From: Jared R. <ja...@wo...> - 2000-12-03 15:05:43
|
[Citation date: Sun, 3 Dec 2000 03:27:04 +0100] >>>>> wildatheartx == wildatheartx <wil...@gm...> wildatheartx> OK, complaint by complaint :) Suggestion by suggestion :) wildatheartx> PS: What feature would absolutely convert you to a wildatheartx> mak user ? Moderate usability is a prerequisite. Beyond that, I am looking for: - Ability to integrate well with database sources (seems like you're thinking about that, but I won't understand what you're doing until there's some more documentation) - Ability to attach metadata to nodes (right-click popups maybe) - The killer would be to support the equivalent of cyclic graphs, not just acyclic graphs, ie A--B--C--A. Basically, like "real" mindmaps, but the graphical layout is probably untenable. - A well-run open source project which I can contribute to effectively. Consistent CVS usage, complete documentation, commented code, todo lists, release notes, preplanned architecture, etc. Thanks for your efforts. -- ja...@wo... "Pioneers get shot full of arrows." - Rob McCool in "Using PGP/PEM encryption" |
From: <wil...@gm...> - 2000-12-03 02:16:43
|
OK, complaint by complaint :) The next release, which isn't far from now (usability improvements, mostly), will contain the concept, of the mak (14 pages of tex docu roadmap). It is true, that the usability wasn't considered in the rc1, but was a great topic the last week. btw: If you rest on the toolbar buttons for a while Tooltip texts will popup, explaining, what the button means. -- I will as well adjoin some documentation -- The xml format will be locked, in the next, or the following version -- For the homepage, this will take a while (this has the lowest priority, sorry but the mindmap itself goes first) Greetings and thank you for the feedback Richard PS: What feature would absolutely convert you to a mak user ? -----Ursprüngliche Nachricht----- Von: Jared Rhine [mailto:ja...@wo...] Gesendet: Samstag, 2. Dezember 2000 22:08 An: wil...@gm... Cc: mak...@li... Betreff: [Mak-developer] Next Feature [Citation date: Sat, 2 Dec 2000 21:49:13 +0100] >>>>> wildatheartx == wildatheartx <wil...@gm...> wildatheartx> it is time, to decide which features' development is wildatheartx> to stress, or to integrate as next... Might I suggest: - Roadmap/vision (where is this thing going? why another app in this area? what's the key differentiation? what is this booktranslation stuff? what functions would jEdit integration perform?) - User documentation (very unclear how to add nodes, edit, move, or do anything else) - Documented and mostly-locked XML data structure, to allow for third-party apps? - Home page with something useful Definitely some usability improvements would be nice, but I would suggest it'd be helpful to know where you are going with such changes. What's the primary user interface model? Are you going to use menus? Is left-click the primary "action"? Will right-click be used? etc, etc Just some suggestions from an absolute newbie. I did run the program and managed to add a node, but couldn't do anything else. As such, I'm still a FreeMind user, so there's no particular reason to follow suggestions from someone who isn't even using the program (yet) :) -- ja...@wo... "You can fool too many of the people too much of the time." -- James Thurber |
From: Jared R. <ja...@wo...> - 2000-12-02 21:02:40
|
[Citation date: Sat, 2 Dec 2000 21:49:13 +0100] >>>>> wildatheartx == wildatheartx <wil...@gm...> wildatheartx> it is time, to decide which features' development is wildatheartx> to stress, or to integrate as next... Might I suggest: - Roadmap/vision (where is this thing going? why another app in this area? what's the key differentiation? what is this booktranslation stuff? what functions would jEdit integration perform?) - User documentation (very unclear how to add nodes, edit, move, or do anything else) - Documented and mostly-locked XML data structure, to allow for third-party apps? - Home page with something useful Definitely some usability improvements would be nice, but I would suggest it'd be helpful to know where you are going with such changes. What's the primary user interface model? Are you going to use menus? Is left-click the primary "action"? Will right-click be used? etc, etc Just some suggestions from an absolute newbie. I did run the program and managed to add a node, but couldn't do anything else. As such, I'm still a FreeMind user, so there's no particular reason to follow suggestions from someone who isn't even using the program (yet) :) -- ja...@wo... "You can fool too many of the people too much of the time." -- James Thurber |
From: <wil...@gm...> - 2000-12-02 20:38:59
|
Hello, it is time, to decide which features' development is to stress, or to integrate as next: at brainstorming I concluded a list of the following topics: Usability (which I worked upon a lot this week, already) Integration of new Contents (Directory Trees, Websites, for recursive Browsing, SourceCode) Stressing of Database Content Stressing of BookTranslation Content (For the database and the, Sourcecode, there shall be integrated other opensource projects, like jEdit, the task would be first to evaluate which is best, and which of them is opensource) Greetings Richard |
From: Dan B. <dan...@ya...> - 2000-12-01 22:27:20
|
Hi there. How's it going? :) Do you have an IRC channel? If not, I invite you to make one on irc.openprojects.net. I'll see if #mak is taken and if not, I'm there. I'm 'dtm' there. ===== "Don't expect your own messiah; this neverworld which you desire is only in your mind." -- http://www.dreamtheater.net/songb4.htm#IV5 __________________________________________________ Do You Yahoo!? Yahoo! Shopping - Thousands of Stores. Millions of Products. http://shopping.yahoo.com/ |