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.     

柔性冗余度机器人残余振动主动控制

研究柔性冗余度机器人的残余振动主动控制问题，设计了具有压电作动器与应变传感器的机敏杆件，建立了受控系统的状态空间表达式，采用独立模态空间控制理论设计LQR状态反馈控制器，并基于对偶原理设计了具有指定收敛特性的Luenberger全维状态观测器，最后，以平面3R柔性冗余度机器人为例进行了计算机仿真，结果表明，采用这种主动控制方法可以显著改善柔性冗余度机器人的动力学品质。     

提高油田集输系统可靠性的研究

应用现代可靠性理论,从设计、工艺、技术等方面对油田集输系统进行了可靠性探讨,提出了增强系统可靠性的措施。     

New quadratic models for the maximum weighted cut problem

New quadratic models are proposed to improve the upper-bound estimates in the maximum weighted cut problem. They are found by two original methods for deriving redundant quadratic constraints. A well-known linear model is shown to follow from the models proposed. Recommendations on how to develop its strengthened analogs are given. This study is partially sponsored from the grant UM2-2574-KV-03 (CRDF Cooperative Grants Program). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 63—75, January–February 2006.     

The Locus of Redundant-Targets and Nontargets Effects: Evidence From the Psychological Refractory Period Paradigm.

In target detection tasks, responses are faster when displays have 2 targets (redundant-targets effect; RTE) and slower when they have no targets (nontargets effect; NTE) relative to displays with a single target. The psychological refractory period paradigm was used to localize these effects. In Experiment 1, participants classified tones as high or low and then classified letters as targets or nontargets after a short or long stimulus onset asynchrony (SOA). The magnitudes of the RTE and NTE did not depend on SOA. In Experiment 2, the order of the tasks was reversed, and at short SOAs the RTE and NTE had similar magnitudes for both tone discrimination and target detection responses. These findings suggest that the RTE and NTE arise during response selection. Interactive effects of tone pitch with the number and type of target features were also observed, and these were tentatively interpreted as synesthetic effects. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

RAID技术综述

通过对各种RAID级别的实现原理进行描述，综合分析了各种模式的性能、优缺点以及应用范围。     

可编程序控制器在催化联锁系统的应用

随着工厂自动化程度的提高，对可编程控制器系统的可靠性要求越来越高，特别是炼油厂、化工厂、电站、钢铁厂以及环保项目中，停车将会给工厂带来的昂贵的代价。在这种情况下,冗余控制器能显著降低生产停滞的风险。简单介绍了可编程序控制器的冗余系统，并结合具体实例说明了冗余系统在其应用过程中的安全可靠性。     

冗余技术在维持DCS系统稳定运行中的作用

以浙江中控JX300-XP为例,介绍冗余系统在系统长周期运行中的关键作用。     

基于地面先验的3D目标检测算法

为了提高自动驾驶汽车环境感知的性能,增强单目相机对障碍物三维和边界信息的感知能力,提出了一种基于地面先验的3D目标检测算法。基于优化的中心网络(CenterNet)模型,以DLA(deep layer aggregation)为主干网络,增加目标3D边沿框中心点冗余信息预测。根据自动驾驶场景的地面先验信息,结合针孔相机模型,获取目标3D中心深度信息,以优化深度网络学习效果。使用KITTI 3D数据集评测算法性能,结果表明:在保证2D目标检测准确性的基础上,该算法运行帧率约20 fps,满足自动驾驶感知实时性要求;同时相比于CenterNet模型,在平均方位角得分(average orientation score)和鸟视图平均准确率(bird eye view AP)上分别有4.4和4.4%的性能提升。因而,该算法可以提高自动驾驶汽车对障碍物三维和边界信息的感知能力。     

快速的层次树集合分划编码算法*

设计了一个改进算法,它仅需对小波分解矩阵进行一遍扫描即可确定层次树集合分划编码(SPIHT)算法所需的所有D(i,j)和L(i,j)重要性并完成对所有(i,j)子系数的编码,使得按照SPIHT的排序方法编码时只需查找存放D(i,j)和L(i,j)的重要性及(i,j)子系数的编码表,从而大大提高了SPIHT的编码速度.