Estimating and eliminating redundant data transfers over the web: a fragment based approach

Redundant data transfers over the Web, can be mainly attributed to the repeated transfers of unchanged data. Web caches and Web proxies are some of the solutions that have been proposed, to deal with the issue of redundant data transfers. In this paper we focus on the efficient estimation and reduction of redundant data transfers over the Web. We first prove that a vast amount of redundant data is transferred in Web pages that are considered to carry fresh data. We show this by following an approach based on Web page fragmentation and manipulation. Web pages are broken down to fragments, based on specific criteria. We then deal with these fragments as independent constructors of the Web page and study their change patterns independently and in the context of the whole Web page. After the fragmentation process, we propose solutions for dealing with redundant data transfers. This paper has been based on our previous work on ‘Web Components’ but also on related work by other researchers. It utilises a proxy based, client/server architecture, and imposes changes to the algorithms executed on the Proxy server and on clients. We show that our proposed solution can considerably reduce the amount of redundant data transferred on the Web. Copyright © 2004 John Wiley & Sons, Ltd.     

Different insights for improving part and system reliability obtained from exactly same DFOM “failure numbers”

Techniques for improving the reliability and maintainability of both nonrepairable and repairable items can be suggested by failure data analysis. It is shown that a given set of failure numbers leads to very different improvement strategies when the numbers are the times-between-successive-failures of one or more repairable items, rather than the times-to-failure of nonrepairable items. Since this should have been obvious more than 50 years ago, at the onset of formal reliability engineering activities, several reasons are proffered for the widespread and protracted misinterpretation of even the most basic—and simple!—conceptual and practical differences between nonrepairable and repairable items.     

Object data MODEL = object-oriented + semantic models

The term ‘object-oriented database’ has been used to refer to different characteristics and mechanisms supported by semantic databases and (behaviorally) object-oriented ones. While this indicates the current confusion due to the lack of a common model, it also suggests the potential desirability of combining these two kinds of modeling facilities into the same nutshell. This paper summarizes from these two paradigms the features common to both, the features influenced/adopted by each other, and the features which are presented in one paradigm but missing from the other. After a brief analysis and discussion of these features, we conclude this paper by proposing our major theme: a complete object data model should take the union of the facilities offered by these two kinds of models.     

小波变换用于影象分割的研究

将近年来兴起的小波理论应用于影象分割技术，提出了一种基于影象直方图小波变换的影象分割方法，并从理论上给出了使用该法所得分割门限的物理意义。实例表明，这种由粗到细引导的多分辨率分析方法，对于复杂影象的分割具有较强的鲁棒性和有效性，克服了传统分割方法中的参数需要人工确定的缺点。     

地震数据采集系统中频谱均衡滤波器的理论设计

地层的高频吸收衰减效应是导致地震勘探分辨率不高的主要原因，在高分辨率野外地震数据系统中，频谱均衡滤波器所设置的重要部件。文章以频谱均衡滤波器的原理和地层吸收衰减特性为基础，用计算机模拟的方法研究地层吸收衰减使分辨率降低的程度和频谱均衡滤波器对分辨率的补偿效果，给出了较好的频谱均衡滤波器的设计方案。     

通用串行总线(USB)数据传输模型

USB作为一种数据传输接口，了解它的通信传输机制是正确利用USB利用数据传输的基础，分层次结构对USB数据传输模型加以分析，可以使读者建立起USB体系结构、通信模型和总线事务的框架和概念，并最终对USB传输工作流程有一个清晰的认识。     

Mesh data structure selection for mesh generation and FEA applications

The data structure representing a mesh and the operators to create and query such a database play a crucial role in the performance of mesh generation and FE analysis applications. The design of such a database must balance the conflicting requirements of compactness and computational efficiency. In this article, 10 different mesh representations are reviewed for linear tetrahedral and hexahedral meshes. A methodology for calculating the storage and computational costs of mesh representations is presented and the 10 data structures are analysed. Also, a system for ranking different data structures based on their computational and storage costs is devised and the various mesh representations are ranked according to this measure. Copyright © 2002 John Wiley & Sons, Ltd.     

虚拟企业图纸数据传输

图纸数据是企业间合作需交换的一种重要的信息。本文分析了虚拟企业环境下企业之间交换图纸数据的要求，提出了一种具体的解决方案，并给出实例。     

Optimal Solutions for the Temporal Precedence Problem

Abstract. In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines . This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following two operations: insert and precedes . The operation insert (a) introduces a new element a in the structure, while the operation precedes (a,b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O (log log n ) per operation and O(n log log n) space, where n is the number of elements inserted. It was also demonstrated that the precedes operation has a lower bound of Ω (log log n ) for the Pure Pointer Machine model of computation. In this paper we present two simple solutions with linear space and worst-case constant insertion time. In addition, we describe two algorithms that can handle the precedes (a,b) operation in O (log log d ) time, where d is the temporal distance between the elements a and b .