Win32.SQLExp.Worm蠕虫病毒分析与对策

分析了Win32．SQt,Exp．Worm蠕虫病毒原理，并给出相应解决方案。     

Mechanistic modelling of the milling process using an adaptive depth buffer

A mechanistic model of the milling process based on an adaptive and local depth buffer is presented. This mechanistic model is needed for speedy computations of the cutting forces when machining surfaces on multi-axis milling machines. By adaptively orienting the depth buffer to match the current tool axis, the need for an extended Z-buffer is eliminated. This allows the mechanistic model to be implemented using standard graphics libraries, and gains the substantial benefit of hardware acceleration. Secondly, this method allows the depth buffer to be sized to the tool as opposed to the workpiece, and thus improves the depth buffer size to accuracy ratio drastically. The method calculates tangential and radial milling forces dependent on the in-process volume of material removed as determined by the rendering engine depth buffer. The method incorporates the effects of both cutting and edge forces and accounts for cutter runout. The simulated forces were verified with experimental data and found to agree closely. The error bounds of this process are also determined.     

Entropy maximisation and open queueing networks with priorities and blocking

A review is carried out on the characterisation and algorithmic implementation of an extended product-form approximation, based on the principle of maximum entropy (ME), for a wide class of arbitrary finite capacity open queueing network models (QNMs) with service and space priorities. A single server finite capacity GE/GE/1/N queue with R (R>1) distinct priority classes, compound Poisson arrival processes (CPPs) with geometrically distributed batches and generalised exponential (GE) service times is analysed via entropy maximisation, subject to suitable GE-type queueing theoretic constraints, under preemptive resume (PR) and head-of-line (HOL) scheduling rules combined with complete buffer sharing (CBS) and partial buffer sharing (PBS) management schemes stipulating a sequence of buffer thresholds {N=(N₁,…,N_R),0<N_i≤N_i−1,i=2,…,R}. The GE/GE/1/N queue is utilised, in conjunction with GE-type first two moment flow approximation formulae, as a cost-effective building block towards the establishment of a generic ME queue-by-queue decomposition algorithm for arbitrary open QNMs with space and service priorities under repetitive service blocking with random destination (RS-RD). Typical numerical results are included to illustrate the credibility of the ME algorithm against simulation for various network topologies and define experimentally pessimistic GE-type performance bounds. Remarks on the extensions of the ME algorithm to other types of blocking mechanisms, such as repetitive service blocking with fixed destination (RS-FD) and blocking-after-service (BAS), are included.     

Automatic Flow-Control Adaptation for Enhancing Network Performance in Computational Grids

With the advent of computational Grids, networking performance over the wide-area network (WAN) has become a critical component in the Grid infrastructure. Unfortunately, many high-performance Grid applications only use a small fraction of their available bandwidth because operating systems and their associated protocol stacks are still tuned for yesterday's WAN speeds. As a result, network gurus undertake the tedious process of manually tuning system buffers to allow TCP flow control to scale to today's WAN Grid environments. And although recent research has shown how to set the size of these system buffers automatically at connection set-up, the buffer sizes are only appropriate at the beginning of the connection's lifetime. To address these problems, we describe an automated and lightweight technique called dynamic right-sizing that can improve throughput by as much as an order of magnitude while still abiding by TCP semantics.     

狄利克雷积分的几种计算方法

利用含参量非正常积分的一些性质,给出了狄利克雷积分integral from n=0 to +∞(sinx)的几种计算方法。     

Windows 2000环境下基于Miniport Driver实现软阵列的Buffer管理

Windows 2000操作系统下,通过Miniport Driver可以实现软阵列的功能。本文探讨了在这种软阵列中缓存的设计与实现,尤其是在缓存替换算法和通道并行性方面作了比较深入的研究。经在Takram公司的DC-200 EIDE扩展卡上进行测试,缓存的设计使小块I/O请求的性能得到明显改善。     

基于BSP算法和模板缓存的阴影实现方法

阴影的生成在体现虚拟现实环境的真实感程度方面起着重要的作用。随着支持模板缓存的3D加速图形卡在个人计算机市场上的普及，使得用采用模板缓存的影域多边形算法来实现实时动态阴影成为可能。综合BSP算法以及OpcnGL中的模板缓存，提出了一种实时生成三维阴影的算法。     

关于电位缓冲溶液的理论初探

首次讨论了“电位缓冲溶液”的问题,并推导了Pe,Pe~0与E,E~0和C_(ox)/C_(Red)间的关系,给出了缓冲指数β及定义式:,求得,验证了当α_(ox):α_(Red)(C_(ox):C_(Red)=1:1时,β有极大值,由此得电位缓冲溶液最佳缓冲范围为。     

移动实时数据库系统综述

移动实时数据库系统涉及到信息处理技术、分布式计算技术、移动通讯技术、实时处理技术等多个学科领域,是当前信息领域中前沿、开创性的课题。论文对移动实时数据库系统的体系结构、系统需求及移动实时环境下事务模型、数据复制和缓存、位置相关查询、数据广播、故障恢复等相关研究做了一个综述。     

Striping and Scheduling for Large Scale Multimedia Servers

When designing a multimedia server, several things must be decided: which scheduling scheme to adopt, how to allocate multimedia objects on storage devices, and the round length with which the streams will be serviced. Several problems in the designing of large-scale multimedia servers are addressed, with the following contributions: (1) a striping scheme is proposed that minimizes the number of seeks and hence maximizes the performance; (2) a simple and efficient mechanism is presented to find the optimal striping unit size as well as the optimal round length, which exploits both the characteristics of VBR streams and the situation of resources in the system; and (3) the characteristics and resource requirements of several scheduling schemes are investigated in order to obtain a clear indication as to which scheme shows the best performance in realtime multimedia servicing. Based on our analysis and experimental results, the CSCAN scheme outperforms the other schemes. It is believed that the results ar