SIGSOFT - ACM Special Interest Group on Software Engineeringhttp://www.sigsoft.org/dissertations.html
Hierarchical Abstract Computers . University of Maryland (1985, advisor: Marvin Zelkowitz ). Abstract . 1984 David Notkin . Interactive Structure-Oriented Computing . Carnegi
Association for Computing Machinery's Special Interest Group on Software Engineering, with awards, events, resources and contacts
The WWW VL: Educational Technology - Educational VR (MUD) sub-page (05-Jan-2000)https://tecfa.unige.ch/edu-comp/WWW-VL/eduVR-page.html
Network, is a system of computers in the domain musenet.org providing access to Educational MUSEs (Multi-User Simulated Environments), such as MicroMUSE and MariMUSE. It is based
Webring Technologyhttps://brisray.com/web/webring-tech.htm
own ring on their own computers. This page takes a look at some of the available webring systems and software and my own suggestions at what an ideal webring should offer. How the
This page discusses webrings and what was used to make them work.
W3C XML Query (XQuery)https://www.w3.org/XML/Query/
NSXML from Apple Computers includes support for XQuery 1.0 and XPath 2.0; it is part of Cocoa. Pathan from Decision Soft [open source, uses Xerces-C] PathEnq from Philip Fearon (a
XML Linking Language (XLink) Version 1.0https://www.w3.org/TR/2000/PR-xlink-20001220/
for consumption by computers. 2.2 Arcs, Traversal, and Behavior [ Definition : Using or following a link for any purpose is called traversal .] Even though some kinds of link can
XML Linking Language (XLink) Version 1.0https://www.w3.org/TR/2001/REC-xlink-20010627/
for consumption by computers. 2.2 Arcs, Traversal, and Behavior [ Definition : Using or following a link for any purpose is called traversal .] Even though some kinds of link can
Frequently asked questions by the Press - Tim BLhttps://www.w3.org/People/Berners-Lee/FAQ.html
it is made from computers and cables. What Vint Cerf and Bob Kahn did was to figure out how this could be used to send around little "packets" of information. As Vint points out,
The Rule of Least Powerhttps://www.w3.org/2001/tag/doc/leastPower.html
class of languages for computers. The tradeoff for such power is that you typically cannot determine what a program in a Turing-complete language will do without actually running
Find more...