【正文】 we serve. The biggest challenges that we face are the maintenance required to keep Hobbes39。在 2020年，我建立了 HDL當(dāng)今最流行的版本。大約過了 2年，我們自己工作增加了系統(tǒng)很多工具。在我們將其他功能以前我將簡單的解釋一下這些功能。 賣主：大多數(shù)用我們圖書管的人。然而，我們在 HDL 上改變了搜索的方法，因為許多的贊助商認(rèn)為他們是在搜索數(shù)據(jù)庫，其實他們是在搜索數(shù)據(jù)庫的內(nèi)容。例如：發(fā)布經(jīng)理僅僅能訪問lib幾個小時，甚至幾分鐘，并且只是 Lib的資源。他們是這些記錄的一部分。 有關(guān)桌面的標(biāo)簽 默認(rèn)的 Hobbes 屏幕展示了圖書館的桌面標(biāo)簽，而且展示了一些工具。 進度表標(biāo)簽 在圖書館，因為他們不能在家里商量日程表。 圖書館會議記錄 會議記錄標(biāo)簽展示了許多的文件。 圖書館時間標(biāo)簽 Hekman 圖書館時間標(biāo)簽不是很容易描述文本內(nèi)容的，所以他們在 HDL 里展示了日歷格式。他們可以在家里做這些事，也可以在會議桌上。 邏輯程序的不確定性使它適合于 AI 應(yīng)用（即：問題的求解）并在執(zhí)行處理中具有極大的潛力。邏輯程序中存在著許多并行機制，其中最主要的是“與”并行性、“或”的并行性和“流式”并行性。在數(shù)據(jù)流程序中，操作順序不是由編程人員確定的，而是由相 互依存的數(shù)據(jù)來指示。數(shù)據(jù)流和精簡結(jié)構(gòu)有著廣闊的前景，但是再將它們有效地用于大規(guī)模并行處理之前還有許多重要問題需要解決。有時，我們發(fā)現(xiàn)其他的方法展示數(shù)據(jù)，同樣的，其他的工具也要增加，我們修改名字，重新建立，并且重新認(rèn)識其他的標(biāo)簽。盡管 Hekman圖書館規(guī)模比較小，但是我還是很幸運地雇傭到了系統(tǒng)程序員。保持這些復(fù)雜的代碼能夠很好的得到誒戶。你們也許會問，這些工具為什么建立以及 HDL頁面如何包含動態(tài)數(shù)據(jù)庫的。在這兩種系統(tǒng)中，作為執(zhí)行數(shù)據(jù)（或需求）激活的指令執(zhí)行結(jié)果，許多指令可以立即變成執(zhí)行有效狀態(tài)，這樣就有可能在程序中全部實現(xiàn)并行操作，我們期望這種結(jié)構(gòu)能 有效地開發(fā)大規(guī)模計算。諾依曼機構(gòu)，其中最有前途的就是數(shù)據(jù)流結(jié)構(gòu)。估計用現(xiàn)在的硬件技術(shù)以合理價格來構(gòu)成的順序 Prolog機最高性能大約是 1MLIPS。 邏輯程序的一個主要特點是其不確定性，與普通程序相比，邏輯程序在以下兩個方面是不確定的： 1) 當(dāng)幾個子句符合一個給定的過程調(diào)用時，通過試探其它子句的搜尋策略是不確定的。 書簽 當(dāng) Hobbes 展示了基于圖書館登陸，我們能夠添加一些工具以便支持唯一的數(shù) 據(jù)為圖書館提供。圖書館資源標(biāo)簽包含了很廣的，各種各樣的鏈接。我們能夠很好的把數(shù)據(jù)導(dǎo)入進去，但是不是很好的建立和展示很復(fù)雜的數(shù)據(jù)。那是管理員發(fā)送一些信息給大家。 引用語：當(dāng)導(dǎo)入一些信息的時候， HDL 主頁展示了唯一的引用，并且每一次 引用存儲在引用數(shù)據(jù)庫中。電子雜志工具是在 Hobes 中聚集一些限定符，用復(fù)雜的腳本語言，使得這些工具建立了一些電子記錄用于每一個標(biāo) 題在 ISSN中。就象墳?zāi)褂涗洠@些職員表包括許多的資源允許他們做各種各樣的事情： 登錄名（基于 LDAP大學(xué)服務(wù)器） 身份：圖書管理員，基本職員，學(xué)生 辦公室位置：辦公室的電話號碼等 職責(zé)：這些顯示出 HDL從 A到 Z的索引，以便用戶能夠很好的找到他們，也就是說圖書館的目錄。當(dāng)點擊它，他就會給用戶一個信息頁面，用于提供符合條件的文章內(nèi)容。 鑒定：資源在傳輸?shù)倪^程中，通過網(wǎng)站，光盤，或者是打印，是否通過了 ip 鑒定。 管理員 這個管理員主要是由我和杰德共同管理霍布斯里面的內(nèi)容的。 作為一個信息管理系統(tǒng)，我剛開始認(rèn)為霍布斯作為一個工具來幫助我管理圖書館的 WEB站點。迄今為止，1997年建立的 HDL， HDL已經(jīng)成為連接世界各方面信息的系統(tǒng)。s login, we were able to add some tools that provided unique data for a given librarian. For example, each person is able to upload his or her browser bookmarks from the office puter to use at the reference desk or from home. Librarians are also able to upload liaison newsletters into Hobbes, which in turn are displayed on their HDL staff page. THE LOGIC PROGRAMMING OF Hobbes Logic programming, which is based on the firstorder predicate logic, has been widely used in AI applications, It is a programming style of attractive features. As logic is regarded as a formalism unifying AI, data management and programming, it is the key feature of many new generation projects, especially the FGCS. The principal idea behind logic programming is that an algorithm prises two parts: a logical ponent and a control ponent. The users need only to specify in his program what to do (. , the logical ponent ), whereas it is the responsibility of the system to exercise the control on how to do it. One of the major feature of logic programs is its nondeterminisms. Compared with normal programs, logic programs are nondeterministic in two senses: (1)When several clauses match a given procedure call, the search strategy by means of which the alternative clauses are tride is not determined. (2)When several calls need to be executed in a single goal statement, the order of execution is not determined. The nondeterminisms of logic programs make them suitable for AI applications (., problem solving ) and potentially rich in parallelism. There is continuous effort in improving the implementation efficiency of Prolog, which is a restriction of logic programming. However, the past effort mainly focuses on interpreterbased software implementation. It is only in recent years that Prolog oriented puter architectures are developed. The PSIII in Japan and the PLM at Berkeley are two famous sequential Prolog machines, which are based on the WAM, a high performance pilerbased execution model for Prolog. It is estimated that the highest possible performance of a sequential Prolog machine constructed. In order to meet the demand of gigantic inference speed in AI applications, the inherent parallelisms in logic programs should be exploited. There are many sources of parallelism in logic programs, of which the major ones are the ANDparallelism, the ORparallelism and the stream parallelism. Substantial research has been carried out on parallel putation models utilizing these parallelisms. New logic programming languages suitable for parallel processing have been developed. For example, the Concurrent Prolog, the GHC, the Parlog, the Deltaprolog, etc. special architectures supporting efficient implementation of these languages have been investigated. Besides, multiprocessor systems have been constructed to greatly enhance the performance of parallel processing of logic programs and production systems. THE DATAFLOW COMPUTATION OF Hobbes Traditional puters are challenged with application which require tremendously highspeed putation capability, which has led puter scientists to study non vonneumann architectures, of which the most promising one is the dataflow architecture. A dataflow putation is one in which the operations are executed in an order determined by the data interdependencies and the availability of resources. In a dataflow program, the ordering of operations is not specified by the programmer, but is that implied by the data interdependencies. Two varieties of dataflow putation can be d