9. System Architecture with XML. Berthold Daum Udo Merten. Morgan Kaufmann Publishers. San Francisco, USA.. 2003 by Elsevier Science http://www.mkp.com/

10. Introduction to DTD http://www.w3schools.com/dtd/dtd_intro.asp

11. Модели обучения автоматизированных обучающих систем http://systech.miem.edu.ru/2004/n2/Cibulskiy.htm

12. Jadex Tutorial. L. Braubach, A. Pokahr, and A. Walczak. Distributed Systems Group. University of Hamburg, Germany. 2005 http://vsis-www.informatik.uni-hamburg.de

13. NIST (Nationals Institute of Standards and Technology) http://www.nist.gov/

14. Проблемы реализации мультиагентных систем дистанционного обучения в сети Интернет http://www.vedu.ru/info/Announce/PHT2000/thesis.asp?str=4_04

15. Использование мультиагентного онтологического подхода к созданию распределенных систем дистанционного обучения http://ifets.ieee.org/russian/depository/ v7_i2/pdf/3.pdf

16. Система автоматизированного сетевого и дистанционного обучения с мультиагентной архитектурой http://www.ito.su/main.php?pid=26&fid=4317&PHPSESSID= d12d7b5d09fc001d24e3d7212d732be2

17. ДСТУ 3008-95 Документация. Отчеты в сфере науки и техники. Структура и правила оформления, Госстандарт Украины, 1995.

18. FIPA Agent Management Specification. 1996-2002 Foundation for Intelligent Physical Agents http://www.fipa.org/

Приложение А

Список терминов в формате XML

GlossaryTerm.xml

<?xml version="1.0"?>

<!DOCTYPE glossary SYSTEM "GlossaryTerm.dtd">

<glossary title ="The XML- Helpbook" orderDate="2006?12?12">

<terms>

<term value="term1">

<name>dictionary</name>

<count>1</count>

<definition count="1">An abstract data type storing items, or values. A value is accessed by an associated key. Basic operations are new, insert, find and delete. </definition>

<giperlink>abstract data type</giperlink>

<giperlink>key</giperlink>

</term>

<term value="term2">

<name>heap</name>

<count>1</count>

<definition count="1">A complete tree where every node has a key more extreme (greater or less) than or equal to the key of its parent. Usually understood to be a binary heap. </definition>

<giperlink>complete tree</giperlink>

<giperlink>key</giperlink>

<giperlink>node</giperlink>

<giperlink>parent</giperlink>

<giperlink>binary heap</giperlink>

</term>

<term value="term3">

<name>linked list</name>

<count>1</count>

<definition count="1">A list implemented by each item having a link to the next item. </definition>

<giperlink>list</giperlink>

<giperlink>link</giperlink>

</term>

<term value="term4">

<name>queue</name>

<count>1</count>

<definition count="1">A collection of items in which only the earliest added item may be accessed. Basic operations are add (to the tail) or enqueue and delete (from the head) or dequeue. Delete returns the item removed. Also known as "first-in, first-out" or FIFO. </definition>

<giperlink>head</giperlink>

<giperlink>tail</giperlink>

</term>

<term value="term5">

<name>stack</name>

<count>1</count>

<definition count="1">A collection of items in which only the most recently added item may be removed. The latest added item is at the top. Basic operations are push and pop. Often top and isEmpty are available, too. Also known as "last-in, first-out" or LIFO. </definition>

</term>

<term value="term6">

<name>tree</name>

<count>2</count>

<image ref="./tree.bmp"/>

<definition count="1">A data structure accessed beginning at the root node. Each node is either a leaf or an internal node. An internal node has one or more child nodes and is called the parent of its child nodes. All children of the same node are siblings. Contrary to a physical tree, the root is usually depicted at the top of the structure, and the leaves are depicted at the bottom. </definition>

<definition count="2">A connected, undirected, acyclic graph. It is rooted and ordered unless otherwise specified. </definition>

<giperlink>node</giperlink>

<giperlink>tree</giperlink>

<giperlink>parent</giperlink>

<giperlink>root</giperlink>

<giperlink>leaf</giperlink>

<giperlink>internal node</giperlink>

<giperlink>child</giperlink>

<giperlink>siblings</giperlink>

<giperlink>connected</giperlink>

<giperlink>undirected</giperlink>

<giperlink>acyclic graph</giperlink>

<giperlink>rooted</giperlink>

<giperlink>ordered</giperlink>

</term>

<term value="term7">

<name>array</name>

<count>1</count>

<definition count="1">A set of items which are randomly accessible by numeric index. </definition>

</term>

<term value="term8">

<name>array index</name>

<count>1</count>

<definition count="1">The location of an item in an array. </definition>

<giperlink>array</giperlink>

</term>

<term value="term9">

<name>child</name>

<count>1</count>

<definition count="1">A node of a tree referred to by a parent node. See the figure at tree. Every node, except the root, is the child of some parent. </definition>

<giperlink>node</giperlink>

<giperlink>tree</giperlink>

<giperlink>parent</giperlink>

<giperlink>root</giperlink>

</term>

<term value="term10">

<name>circular list</name>

<count>1</count>

<definition count="1">A variant of a linked list in which the nominal tail is linked to the head. The entire list may be accessed starting at any item and following links until one comes to the starting item again. </definition>

<giperlink>linked list</giperlink>

<giperlink>link</giperlink>

<giperlink>tail</giperlink>

</term>

<term value="term11">

<name>complete tree</name>

<count>1</count>

<definition count="1">A tree in which all leaf nodes are at some depth n or n-1, and all leaves at depth n are toward the left. </definition>

<giperlink>tree</giperlink>

<giperlink>depth </giperlink>

<giperlink>leaf</giperlink>

</term>

<term value="term12">

<name>connected graph</name>

<count>1</count>

<definition count="1">An undirected graph that has a path between every pair of vertices. </definition>

</term>

<term value="term13">

<name>depth</name>

<count>1</count>

<definition count="1">Of a node, the distance from the node to the root of the tree. </definition>

<giperlink>node</giperlink>

<giperlink>tree</giperlink>

<giperlink>root</giperlink>

</term>

<term value="term14">

<name>doubly linked list</name>

<count>1</count>

<definition count="1">A variant of a linked list in which each item has a link to the previous item as well as the next. This allows easily accessing list items backward as well as forward and deleting any item in constant time. </definition>

<giperlink>linked list</giperlink>

<giperlink>link </giperlink>

</term>

<term value="term15">

<name>dynamic array</name>

<count>1</count>

<definition count="1">An array whose size may change over time. Items are not only added or removed, but memory used changes, too.

</definition>

<giperlink>array</giperlink>

</term>

<term value="term16">

<name>height</name>

<count>1</count>

<definition count="1">The maximum distance of any leaf from the root of a tree. If a tree has only one node (the root), the height is zero.

</definition>

<giperlink>leaf</giperlink>

<giperlink>tree</giperlink>

<giperlink>root</giperlink>

</term>

<term value="term17">

<name>internal node</name>

<count>1</count>

<definition count="1">A node of a tree that has one or more child nodes, equivalently, one that is not a leaf. </definition>

<giperlink>leaf</giperlink>

<giperlink>tree</giperlink>

<giperlink>node</giperlink>

<giperlink>child</giperlink>

</term>

<term value="term18">

<name>leaf</name>

<count>1</count>

<definition count="1">A node in a tree without any children. See the figure at tree. </definition>

<giperlink>leaf</giperlink>

<giperlink>tree</giperlink>

<giperlink>node</giperlink>

<giperlink>children</giperlink>

</term>

<term value="term19">

<name>linear search</name>

<count>1</count>

<definition count="1">Search an array or list by checking items one at a time. </definition>

<giperlink>list</giperlink>

<giperlink>array</giperlink>

</term>

<term value="term20">

<name>link</name>

<count>1</count>

<definition count="1">A reference, pointer, or access handle to another part of the data structure. Often, a memory address. </definition>

<giperlink>list</giperlink>

<giperlink>array</giperlink>

</term>

<term value="term21">

<name>list</name>

<count>1</count>

<definition count="1"> A collection of items accessible one after another beginning at the head and ending at the tail. </definition>

<giperlink>head</giperlink>

<giperlink>tail</giperlink>

</term>

<term value="term22">

<name>matrix</name>

<count>1</count>

<definition count="1">A two-dimensional array. By convention, the first index is the row, and the second index is the column. </definition>

</term>

<term value="term23">

<name>node</name>

<count>2</count>

<definition count="1">A unit of reference in a data structure. Also called a vertex in graphs and trees. </definition>

<definition count="2">A collection of information which must be kept at a single memory location.

</definition>

<giperlink>graphs</giperlink>

<giperlink>trees</giperlink>

<giperlink>vertex</giperlink>

</term>

<term value="term24">

<name>order</name>

<count>4</count>

<definition count="1">The height of a tree. </definition>

<definition count="2">The number of children of the root of a binomial tree. </definition>

<definition count="3">The maximum number of children of nodes in a B-tree. </definition>

<definition count="4">The number of data streams, usually denoted, in a multiway merge. </definition>

<giperlink>height</giperlink>

<giperlink>tree</giperlink>

<giperlink>children</giperlink>

<giperlink>root</giperlink>

<giperlink>node</giperlink>

</term>

<term value="term25">

<name>ordered linked list</name>

<count>1</count>

<definition count="1">A linked list whose items are kept in some order. </definition>

<giperlink>linked list</giperlink>

</term>

<term value="term26">

<name>ordered tree</name>

<count>1</count>

<definition count="1">A tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc.

</definition>

<giperlink>tree</giperlink>

<giperlink>children</giperlink>

<giperlink>node</giperlink>

</term>

<term value="term27">

<name>parent</name>

<count>1</count>

<definition count="1">Of a node: the tree node conceptually above or closer to the root than the node and which has a link to the node. See the figure at tree. </definition>

<giperlink>tree</giperlink>

<giperlink>link</giperlink>

<giperlink>root</giperlink>

<giperlink>node</giperlink>

</term>

<term value="term28">

<name>root</name>

<count>1</count>

<definition count="1">The distinguished initial or fundamental item of a tree. The only item which has no parent. See the figure at tree.

</definition>

<giperlink>tree</giperlink>

<giperlink>parent</giperlink>

</term>

<term value="term29">

<name>search</name>

<count>1</count>

<definition count="1">To look for a value or item in a data structure. There are dozens of algorithms, data structures, and approaches. </definition>

</term>

<term value="term30">

<name>self-organizing list</name>

<count>1</count>

<definition count="1">A list that reorders the elements based on some self-organizing heuristic to improve average access time. </definition>

<giperlink>list</giperlink>

<giperlink>self-organizing heuristic </giperlink>

</term>

<term value="term31">

<name>sibling</name>

<count>1</count>

<definition count="1">A node in a tree that has the same parent as another node is its sibling. </definition>

<giperlink>tree</giperlink>

<giperlink>parent</giperlink>

<giperlink>node</giperlink>

</term>

<term value="term32">

<name>sorted array</name>

<count>1</count>

<definition count="1">An array whose items are kept sorted, often so searching is faster. </definition>

<giperlink>array</giperlink>

</term>

<term value="term33">

<name>sorted list</name>

<count>1</count>

<definition count="1">A list whose items are kept sorted. </definition>

<giperlink>list</giperlink>

</term>

<term value="term34">

<name>square matrix</name>

<count>1</count>

<definition count="1">A n*n matrix, i.e., one whose size is the same in both dimensions. </definition>

<giperlink>matrix</giperlink>

</term>

<term value="term35">

<name>tail</name>

<count>2</count>

<definition count="1">The last item of a list. </definition>

<definition count="2">All but the first item of a list; the list following the head. </definition>

<giperlink>list</giperlink>

</term>

</terms>

</glossary>

Приложение В

Описание тегов XML документа в формате DTD

GlossaryTerm.dtd

<?xml version="1.0" encoding="windows-1251"?>

<!ELEMENT glossary (terms)>

<!ATTLIST glossary

title CDATA #REQUIRED

orderDate CDATA "">

<!ELEMENT terms (term+)>

<!ELEMENT term (name,definition+)>

<!ATTLIST term

value CDATA #REQUIRED>

<!ELEMENT name (#PCDATA)>

<!ELEMENT count (#PCDATA)>

<!ELEMENT image EMPTY>

<!ATTLIST image

ref CDATA #REQUIRDE>

<!ELEMENT definition (#PCDATA)>

<!ATTLIST definition

count CDATA #REQUIRDE>

<!ELEMENT giperlink (#PCDATA)>

Размещено на Allbest.ru