【正文】 ................................................................................................ 24 I 摘要 隨著 Inter 的快速發(fā)展，互聯(lián)網(wǎng)已成為人們快速獲取、發(fā)布和傳遞信息的重要渠道，顯然它已成為社會(huì)生活的一部分。 通過這樣的系統(tǒng)，我們可以做到信息的規(guī)范管理和快速查詢，實(shí)現(xiàn)了公交信息管理的系統(tǒng)化、規(guī)范化和自動(dòng)化，這樣不僅減少了管理工作量，還提高了管理效率，降低了管理成本。 城市公交查詢系統(tǒng)的背景 近十幾年 來，我國汽車工業(yè)蓬勃發(fā)展，特別是家用轎車的增長。相似之處在于 系統(tǒng)的核心都是 B/S 架構(gòu)。 其次：節(jié)省時(shí)間。 內(nèi)存： 512MB（最好 1GB 以上） 。開發(fā)人員可以方便地獲得這些技術(shù)的優(yōu)點(diǎn)，其中包括托管的公共語言運(yùn)行庫環(huán)境、類型安全、繼承等等 [3]。按照工業(yè)標(biāo)準(zhǔn)生成所有通信，以確?；? .NET Framework 的代碼可與任何其他代碼集成 [5]。 .NET Framework 不但提供若干個(gè)運(yùn)行庫宿主，而且還支持第三方運(yùn)行庫宿主的開發(fā)。 （ 4） 、易控制 在 里，你將會(huì)擁有一個(gè)“ DataBounds” (數(shù)據(jù)約束 )，這意味著它會(huì)與數(shù)據(jù)源連接，并會(huì)自動(dòng)裝入數(shù)據(jù)，使控制工作簡單易行。 ADO .NET 提供了一組用來連接到數(shù)據(jù)庫，運(yùn)行命令，返回記錄集的類庫，與從前的 ADO(ActiveX Data Object)相比， Connection 和 Command 對(duì)象很類似，而 ADO .NET 的革新主要體現(xiàn)在如下幾個(gè)方面： 首先， ADO .NET 提供了對(duì) XML 的強(qiáng)大支持，這也是 ADO .NET 的一個(gè)主要設(shè)計(jì)目標(biāo)。 ASP .NET 是 Microsoft .NET 中的網(wǎng)絡(luò)編程結(jié)構(gòu)，它使得建造、運(yùn)行和發(fā)布網(wǎng)絡(luò)應(yīng)用非常方便和高效 [9]。當(dāng)用 Visual 創(chuàng)建一個(gè) 工程時(shí)， Visual 會(huì)自動(dòng)配置好 IIS 應(yīng)用，用戶直接應(yīng)用即可 [11]。用戶還可以在留言簿中直接進(jìn)行留言，留言內(nèi)容可以是對(duì)線路的詢問，也可以對(duì)系統(tǒng)的不足地方提出用戶自己的見解。 (3)查詢車站信息：選擇要查詢的車站進(jìn) 行搜索，可以查詢出于它相應(yīng)的車次名、發(fā)車時(shí)間、收車時(shí)間和車次描述信息 (4)查詢站站信息：輸入要查詢的起始站和終點(diǎn)站進(jìn)行搜索，可以查詢出于它相應(yīng)的乘車路線。 系統(tǒng)流程設(shè)計(jì) 在城市公交查詢系統(tǒng)中，其核心內(nèi)容就是公交查詢的實(shí)現(xiàn)。其中正向搜索線路的流程如圖 所示。 表 info表 列名 數(shù)據(jù)類型 長度 是否為空 說明 Infoid Int 4 Not null 留言編號(hào)（主鍵） Title Varchar 50 Null 留言標(biāo)題 Name Varchar 50 Null 留言者 (含管理員 )名 Letter Varchar 350 Null 留言內(nèi)容 （ 3） 、 車次基本信息表 line 此表包括五個(gè)字段：其中 lineid 字段為 line 表的主鍵，另外四個(gè)分別為車次名、發(fā)車時(shí)間、收車時(shí)間和車次描述。在 文件中可，項(xiàng)目應(yīng)用的所有配置信息都包含在 configuration和 /configuration標(biāo)記之間，另外，可以在appSettings標(biāo)記中，使用 add.../標(biāo)記中定義 0到多個(gè)設(shè)置 [14]。 站 點(diǎn) 表站 點(diǎn) I D 站 點(diǎn) 描 述站 點(diǎn) 名 圖 ER圖 包括站點(diǎn) ID，站點(diǎn)名，站點(diǎn)描述。與應(yīng)用程序中的函數(shù)過程類似，存儲(chǔ)過程可以通過名字來調(diào)用，而且它們 同樣有輸入?yún)?shù)和輸出參數(shù)。其中有四個(gè)用戶控件，它們分別是：、 、 和 。如圖 。如圖 所示。如圖 所示。另外頁面的美化 也是一個(gè)重要的問題，系統(tǒng)的頁面做的過于粗糙，而且功能有些簡陋。 [8] 哈特 著 .孟憲瑞，易磊 譯 . 經(jīng)典教程 —— C篇 .人民郵電出版社 . 2020 [9] David Sceppa 著 . 梁超 ， 張莉 ， 賀堃 譯 . 技術(shù)內(nèi)幕 .清華大學(xué)出版社 .2020 [10] 胡百敬 ， 姚巧玫 著 .SQL Server 2020 數(shù)據(jù)庫開發(fā)詳解 .電子工業(yè)出版社 .2020 [11] Jason Beres 著 .袁鵬飛 譯 . 21天學(xué)通 Visual 版社 .2020 [12] 明日科技 . 數(shù)據(jù)庫系統(tǒng)開發(fā)案例精選 .人民郵電出版社 . 2020 [13] 金銀秋 著 .數(shù)據(jù)庫原理與設(shè)計(jì) .北京 :科學(xué)出版社 ,2020 [14] 劉乃麗 著 . 精通 +SQL Server 2020 項(xiàng)目開發(fā) .人民郵電出版社 . 2020 [15] 譚振林 著 . 道不遠(yuǎn)人 —— 深入解析 控件開發(fā) .電子工業(yè)出版社 . 2020 24 附錄 Dynamic Web Service Selection for ReliableWeb Service Composition SanYih Hwang, Member, IEEE Computer Society, EePeng Lim, Senior Member, IEEE, ChienHsiang Lee, and ChengHung Chen Abstract—This paper studies the dynamic Web service selection problem in a failureprone environment, which aims to determine a subset of Web services to be invoked at runtime so as to successfully orchestrate a posite Web service. We observe that both the posite and constituent Web services often constrain the sequences of invoking their operations and, therefore, we propose using a finite state machine to model the permitted invocation sequences of Web service operations. We assign each state of execution an aggregated reliability to measure the probability that the given state will lead to successful execution in the context where each Web service may fail with some probability. We show that the putation of aggregated reliabilities is equivalent to eigenvector putation and adopt the power method to efficiently derive aggregated reliabilities. In orchestrating a posite Web service, we propose two strategies to select Web services that are likely to successfully plete the execution of a given sequence of operations. A prototype that implements the proposed approach using BPEL for specifying the invocation order of a Web service is developed and serves as a testbed for paring our proposed strategies and other baseline Web service selection strategies. Index Terms—Reliability, service position, Web services, Web service selection. 1 INTRODUCTION THE Inter today has radically changed how businesses interact with applications distributed within and across anizational boundaries. With Web service (WS) technologies fast being the de facto standard to expose the functions of business applications, WSs will be the building blocks for developing the next generation applications using he serviceoriented architecture (SOA). Although the current WS architecture supports registry, discovery, and consumption of WSs, how to effectively integrate several WSs into a posite one remains to be a challenge and attracts much attention from both industry and academia. The position of WSs involves using an orchestration model to 1) define the possible orders of calling WSs at design time and 2) dynamically select WSs to be invoked at runtime. To address the former, several theoretical orchestration models have been proposed in the literature, including finite state machine (FSM), Petri , calculus, activity hierarchies, and rulebased orchestration [2]. Practical service position languages, such as BPEL, WSChoreography, WSCL, XPDL, and OWLS have also been proposed, and many mercial service platforms or products that implement the available standards and position languages are available in the market, including the Sun ONE framework based on J2EE, , the Oracle BPEL Process Manager, the HP WSs Management Platform, and the IBM Web Sphere Application Server. However, none of the 25 above works provide strategies or mechanisms to dynamically select WSs to be invoked when executing a series of operations in a posite WS. While deciding on a set of constituent WSs for a posite WS a priori is simple and practically used by most of today’s applications, it promises the flexibility and is especially vulnerable to failures in a dynamic environment on which WSs are executed. Dynamic WS selection refers to choosing the available WSs to be invoked so as to realize the functionality of a posite WS constructed using an orchestration model at runtime. While the WS selection