基于Web的机票预订系统的设计与实现

文章主要介绍了实现机票预订系统的管理过程,该设计的完成也切实的体现了系统管理实施的优点。首先让大家了解了该系统开发的背景、研究现状及其发展趋势,让读者清楚设计该系统的目的及意义。然后较为详细地叙述了系统设计的可行性分析、需求分析、概要设计和功能的实现,其中主要以技术可行性和功能需求为主要叙述对象。最后把系统测试的方法和设计该系统出现的问题及修改完善的方法加以说明让大家更好的了解设计的过程。系统的功能主要包括基本的查询系统、订票系统、退票系统;主要的工作处理包括机票预订处理和退票处理;信息资料查询主要是管理员对客户信息查询、用户对航班信息查询、机票预定查询和退票信息查询;这些功能都满足了客户对机票预订系统的使用需求和对信息检索的要求。     

Web型课件的开发与应用

分析了Web型课件的优点及功能，并针对Web型课件的开发和应用进行了初步研究。     

Thinking and Turing's test

The questions raised by A. M. Turing in his paper on thought and machines are discussed. Human thought is considered in turn as a concept of normal language usage, as a basic concept of psychology, and as the basis of intellectual activity. It is concluded that neither of these notions of thought identifies something specific that a human being can or cannot do. The imitation game proposed by Turing for deciding whether a machine can think is found to result from an arbitrary empoverishment of the channel of communication between the interrogator and the item under investigation. Turing's notions of thinking are shown to lead to logical difficulties. An alternative view of consciousness, that would place it beyond the reach of any finite test, is finally discussed.     

Curvature of curvilinear 4-webs and pencils of one forms: Variation on a theorem of Poincaré, Mayrhofer and Reidemeister

A curvilinear d-web W = (F ₁ , . . . , F _d ) is a configuration of d curvilinear foliations F _i on a surface. When d = 3, Bott connections of the normal bundles of F _i extend naturally to equal affine connection, which is called Chern connection. For 3 < d, this is the case if and only if the modulus of tangents to the leaves of F _i at a point is constant. A d-web is associative if the modulus is constant and weakly associative if Chern connections of all 3-subwebs have equal curvature form. We give a geometric interpretation of the curvature form in terms of fake billiard in §2, and prove that a weakly associative d-web is associative if Chern connections of triples of the members are non flat, and then the foliations are defined by members of a pencil (projective linear family of dim 1) of 1-forms. This result completes the classification of weakly associative 4-webs initiated by Poincaré, Mayrhofer and Reidemeister for the flat case. In §4, we generalize the result for n + 2-webs of n-spaces. Received: September 23, 1996     

Chemical mechanical polishing of polymer films

Strategies to reduce capacitance effects associated with shrinking integrated circuit (IC) design rules include incorporating low resistivity metals and insulators with low dielectric values, or “low-κ” materials. Using such materials in current IC fabrication schemes necessitates the development of reliable chemical mechanical polishing (CMP) processes and process consumables tailored for them. Here we present results of CMP experiments performed on FLARE™ 2.0 using a specialized zirconium oxide (ZrO₂) polishing slurry. FLARE™ 2.0 is a poly(arylene) ether from AlliedSignal, Inc. with a nominal dielectric constant of 2.8. In addition, we provide insight into possible removal mechanisms during the CMP of organic polymers by examining the performance of numerous abrasive slurries. Although specific to a limited number of polymers, the authors suggest that the information presented in this paper is relevant to the CMP performance of many polymer dielectric materials.     

网格技术综述

网格技术被认为是互联网技术发展的下一次浪潮，目前对网格的研究已经成为信息领域的热点。本文首先介绍了网格的产生背景，接着阐述了网格的概念和目的，然后分析了网格的系统构成，最后展望了网格技术的应用前景。     

基于Web管理技术的安全网络管理系统

分析了基于Web的网络管理技术，提出了一种解决网络管理安全的方法。     

ASP+ADO实现医院门诊在线查询

ASP技术由于其方便 ,灵活及可扩充性等特点和简明、高效的技术优势 ,在Web数据库的开发中获得了广泛的应用。简述了开发Web数据库的重要性 ,介绍了ASP技术的特点及其数据库访问原理 ,ADO对象。实例介绍了ASP实现医院门诊在线查询的方法     

Partitioning multi-edge graphs

We introduce a new kind of graph called multi-edge graph which arises in many applications such as finite state Markov chains and broadcasting communication networks. A cluster in such a graph is a set of nodes such that for any ordered pair of nodes, there is a path of multi-edges from one to the other such that these edges remain within the same set. We give two algorithms to partition a multi-edge graph into maximal clusters. Both these algorithms are based on the depth-first search algorithm to find strongly connected components of the directed graph. We also discuss some applications of clustering in multi-edge graphs.     

全球信息网WWW上的化学资源

文献查阅是化学工作者必须掌握的基本技能之一.随着计算机网络技术的迅速发展,利用全球信息网WWW浏览和获取化学信息已成为查阅化学文献最重要的方法之一.在化学工作者中普及万维网WWW查阅各类化学信息和获取化学资源的方法是非常重要的.作者简要叙述WWW的基本原理和通过WWW获取化学信息和化学资源的方法,并给出部分Internet化学资源.