下一代HTTP协议

为了克服当前ＨＴＴＰ协议的缺点,Ｗ３Ｃ开始研究制定了下一代ＨＴＴＰ协议－ＨＴＴＰ－ＮＧ。它分三个层次：应用层,消息层,传输层,现有ＷＥＢ上应用将转换到ＨＴＴＰ－ＮＧ平台上,最后整个都会更新为ＨＴＴＰ－ＮＧ。     

威胁与防御

随着Ｉｎｔｅｒｎｅｔ的发展,客户／服务器结构逐渐向浏览器／服务器结构迁移,因此Ｗｅｂ服务在很短时间内也成为Ｉｎｔｅｒｎｅｔ上的主要服务。Ｗｅｂ文本发布具有简洁、生动、形象等特点,所以,无论是单位和个人,都越来越倾向于用Ｗｅｂ来发布自己的信息。Ｗｅｂ服务基于超文本传输协议,即ＨＴＴＰ协议。目前,ＨＴＴＰ协议共有三个版本,分别为ＨＴＴＰ０．９、ＨＴＴＰ１．０和ＨＴＴＰ１．１。其中ＨＴＴＰ１．０为大多数服务器和浏览器所使用,是一个面向连接的无状态的协议,在ＴＣＰ的端口８０上进行信息的传输。大多数Ｗｅ…     

如何提高ⅡS5.0的性能

启用ＨＴＴＰ的持续作用可以改善１５－２０％的执行效率。 不启用记录可以改善５－８％的执行效率。 使用独立的处理程序会损失２０％的执行效率。 增加 Ｃａｃｈｅ的保存文档数量,可握高Ａｃｔｉｖｅ Ｓｅｒｖｅｒ Ｐａｇｅｓ的性能。 　不使用ＣＧＩ程序。 增加ＣＰＵ数量。 不启用ＡＳＰ侦错功能。 静态网页采用ＨＴＴＰ压缩,大约可以减少２０％的传输量。 简单介绍如下。 启用ＨＴＴＰ的持续作用 可改善１５—２０％的执行效率 启用ＨＴＴＰ的持续作用（Ｋｅｅｐ—Ａｌｉｖｅ）时,ＩＩＳ与浏览器的连线不会断线,可以改善执行效率,…     

Web服务器性能优化

该文论述ＨＴＴＰ协议的主要特性,分析了ＴＣＰ和ＨＴＴＰ的传输过程,阐述了ＨＴＴＰ与ＴＣＰ影响Ｗｅｂ服务器性能的原因,分析了各种网络特性对Ｗｅｂ服务器性能的影响和影响Ｗｅｂ服务器性能的主要因素,最后提出了优化ＷＷＷ系统性能的主要方法。     

HTTP代理服务系统的买现与分析

论述了ＨＴＴＰ代理协议的实现过程,并就ＨＴＴＰ代理的身份认证和缓冲机制作出分析研究和探讨．     

如何用Java实现Web服务器

本文介绍了ＨＴＴＰ协议的作用原理,以及根据ＨＴＴＰ协议,利用Ｊａｖａ编写Ｗｅｂ服务器的方法和实例。这对Ｊａｖａ在Ｗｅｂ中的应用,具有实践指导意义。     

HTTP代理防火墙工具的原理与实现

本文阐述了ＨＴＴＰ代理防火墙工具的原理与实现。首先介绍防火墙技术在网络安全模型中 的重要性,分析现有防火墙技术,然后深入讲解ＨＴＴＰ代理防火墙工具的原理和实现。     

用Java开发HTTP服务器

在对ＨＴＴＰ协议的分析基础上,用Ｊａｖａ开了一个ＨＴＴＰ服务器原型系统,说明了其实现模型,并讨论了多线程及虚拟终端等若干实现问题。     

HTTP协议及其发展

ＨＴＴＰ（超文本传输协议）是浏览器与Ｗｅｂ服务器共同遵守的协议。本文详细介绍了ＨＴＴＰ协议的消息格式、工作原理及客户机服务器间的互连方式。     

基于UNIX系统的WWW服务器程序的实现

本文介绍了ＷＷＷ的通信规程和核心协议－－－ＨＴＴＰ，通过对广泛使用的ＮＣＳＡ版本的ＨＴＴＰ服务器程序的分析，使用户了解如何在ＵＮＩＸ操作系统上实现ＷＷＷ服务。     

ON THE THEORY OF BAGS

We introduce the bag structure as a set-like object in which repeated elements are significant. We discuss operations on bags such as intersection, union and addition. We introduce the operation of selecting elements from a bag based upon their membership in a set. We show the usefulness of the bag structure in relational data bases. We provide a definition for fuzzy bags. In these fuzzy bags the count of the number of elements itself becomes a crisp bags. We investigate a calculus for fuzzy bags.     

Generalized triangular norm and conorm aggregation operators on ordinal spaces

We describe the basic features of the t-norm operator and then introduce a family of t-norm operators that are defined on an ordinal space. We then do the same for the t-conorms. We note the strong limitation that the requirement of associativity places on the t-norm and t-conorm operators. We particularly note how it limits our ability to model different types of reinforcement. We then define a generalization of the t-conorm aggregation operator, which relaxes the requirement of associativity, we denote these operators as GENOR operators. We show that these operators have the same functionality as the t-conorm. We provide some examples of GENOR operators which allow us to control the reinforcement process. We define a related extension for the t-norm, the GENAND operator and provide some examples.     

Phrase-based correction model for improving handwriting recognition accuracies

We propose a method for increasing word recognition accuracies by correcting the output of a handwriting recognition system. We treat the handwriting recognizer as a black box, such that there is no access to its internals. This enables us to keep our algorithm general and independent of any particular system. We use a novel method for correcting the output based on a “phrase-based” system in contrast to traditional source-channel models. We report the accuracies of two in-house handwritten word recognizers before and after the correction. We achieve highly encouraging results for a large synthetically generated dataset. We also report results for a commercially available OCR on real data.     

Byzantine broadcast with fixed disjoint paths

We consider the problem of reliably broadcasting a message in a multihop network. We assume that some nodes may be Byzantine, and behave arbitrarily. We focus on cryptography-free solutions.     

Pythagorean Membership Grades,Complex Numbers,and Decision Making

We describe the idea of Pythagorean membership grades and the related idea of Pythagorean fuzzy subsets. We focus on the negation and its relationship to the Pythagorean theorem. We look at the basic set operations for the case of Pythagorean fuzzy subsets. A relationship is shown between Pythagorean membership grades and complex numbers. We specifically show that Pythagorean membership grades are a subclass of complex numbers called Π‐i numbers. We investigate operations that are closed under Π‐i numbers. We consider the problem of multicriteria decision making with satisfactions expressed as Pythagorean membership grades, Π‐i numbers. We look at the use of the geometric mean and ordered weighted geometric operator for aggregating criteria satisfaction.     

Cumulative distribution functions from Dempster-Shafer belief structures

We discuss the Dempster-Shafer belief structure. We introduce the idea of a cumulative distribution induced by a Dempster-Shafer belief structure. We call these belief-cumulative distribution (B-CDs) functions. We study the properties of these distribution functions and show that they are interval functions. We investigate the possibility of using these distribution functions as a tool for knowledge representation.     

An Expressive Query Language for Product Recommender Systems

We argue that existing approaches to the construction of content-based Product Recommender Systems (Filter-Based Retrieval and Similarity-Based Retrieval) use inadequately expressive query languages. We introduce a new approach, which we call Order-Based Retrieval. We define and exemplify the six operators that constitute its query language. We show how these operators can better support the elicitation of both the customer's initial requirements and refinements to the initial requirements.     

OWA aggregation over a continuous interval argument with applications to decision making

We briefly describe the ordered weighted average (OWA) operator. We discuss its role in decision making under uncertainty. We provide an extension of the OWA operator to the case in which our argument is a continuous valued interval rather than a finite set of values. We look at some examples of this type of aggregation. We show how it can be used in some tasks that arise in decision making. We consider the extension of the continuous interval argument OWA operator to the more general case in which the argument values have importance weights. We use this to introduce the idea of an attitudinal-based expected value associated with a continuous random variable.     

Modeling multi-criteria objective functions using fuzzy measures

We introduce the idea of a measure. We describe several important finite integrals useful for obtaining an average value of a collection of argument values weighted by a measure. We particularly look at the case of binary measures and show that all integrals in this case evaluate to the same value. We describe the use of measures in multi-criteria decision making as a way of expressing a decision maker’s objective function in terms of collection of relevant criteria. We look at the role of an integral as a way to evaluate an alternative’s overall satisfaction to their objective function in terms of its satisfaction to the individual criteria. We look at a number of special types of measure based decision objective functions.     

An object-oriented database system Jasmine: implementation,application, and extension

We have devised an object oriented DBMS called Jasmine for advanced applications. The paper describes the implementation, application and extension of Jasmine in detail. We focus on the impact of the design of its object oriented model and language on database implementation technology. We describe what part of traditional relational database technology we extend to handle object oriented features such as object identifiers, complex objects, class hierarchies, and methods. We introduce nested relations to efficiently store and access clustered complex objects. We use hash based methods to efficiently access nonclustered complex objects. We provide user defined functions directly evaluated on page buffers to efficiently process method invocation. We devise object oriented optimization of queries including class hierarchies, complex objects, and method invocation. We incorporate dedicated object buffering to allow efficient access to objects through object identifiers. We also describe nontrivial applications of Jasmine and discuss the validity of object oriented databases. We focus on a constraint management facility, which can be implemented by taking advantage of the extensibility of Jasmine. The facility includes constraint rules, called design goals, for automatic database population required by engineering applications. Finally, we describe a view facility for schema integration also needed by engineering applications in distributed environments. We focus on how we extend Jasmine to implement the facility