An object replication algorithm for real-time distributed databases

A real-time distributed database system (RTDDBS) must maintain the consistency constraints of objects and must also guarantee the time constraints imposed by each request arriving at the system. Such a time constraint of a request is usually defined as a deadline period, which means that the request must be serviced on or before its time constraint. Servicing these requests may incur I/O costs, control-message transferring costs or data-message transferring costs. As a result, in our work, we first present a mathematical model that considers all these costs. Using this cost model, our objective is to service all the requests on or before their respective deadline periods and minimize the total servicing cost. To this end, from theoretical standpoint, we design a dynamic object replication algorithm, referred to as Real-time distributed dynamic Window Mechanism (RDDWM), that adapts to the random patterns of read-write requests. Using competitive analysis, from practical perspective, we study the performance of RDDWM algorithm under two different extreme conditions, i.e., when the deadline period of each request is sufficiently long and when the deadline period of each request is very short. Several illustrative examples are provided for the ease of understanding. Recommended by: Ashfaq Khokhar     

On Burst Length Distribution and Preemption Probabilities in OBS Networks with Burst Segmentation

Recently, preemption techniques have attracted considerable attention as a means to provide differentiated quality of service in optical burst switching (OBS) networks. This paper is focused on the analysis of preemption probabilities for bursts within the same priority class. As proposed by Vokkarane and Jue ((2003)* IEEE J Select Areas Commun 21(7): 1198–1209) an incoming burst will preempt the burst in service, within the same priority class, if the residual length of the burst in service is smaller than the incoming burst length. For a general case with wavelength conversion, the preemption probability of contending bursts with a generic service distribution, not necessarily exponential, is analyzed. First, we show that the size distribution for the preempting bursts is shifted to larger values, in comparison to the original burst size distribution. Second, we obtain an upper and lower bound for the preemption probability. Finally, the asymptotic behavior of the OBS switch is analyzed showing that preemption will always occur for a very large number of wavelengths.     

一种新颖的基于非压缩数字视频的水印盲检测算法

数字水印是一种嵌入到多媒体数据中用来进行版权标识的工具。在众多的宿主媒体中，数字视频因具有隐藏容量大、透明性好、鲁棒性强等诸多优点而受到日益广泛的关注。但是很多文献中提到的视频水印都是从数据流中提取单帧图像进行处理，这类算法与静态图像的水印方法如出一辙，没有充分利用视频文件的各种特性。而且对帧平均、视频压缩等常见的运动图像攻击方法十分敏感。针对这些问题，本文以非压缩视频文件为实验对象，结合人类视觉模型和彩色图像场景分割的方法，提出并实现了一种基于视频时间轴的数字水印盲检测算法。实验结果表明算法有效实用。     

区域分割法辅助计算复杂图像面积

介绍计算具有复杂边缘轮廓的图像面积的区域分割法。采用鼠标多边形作图法近似圈定待处理的图像区域。本文由格林定理出发得到有限连续边界与其包围区域面积之间的函数关系,并且应用这一函数关系得出多边形与其包围区域面积的数学关系,近似得到图像区域面积。文中以烟幕图像为例对上述结论进行了验证。文章最后给出了在VC++环境下实现多边形分割的部分源代码。     

数字电视用户管理系统

课题实现了数字电视用户管理系统的设计与开发,以Oracle数据库作为后台数据库,以C Builder 6作为前台开发工具,包括表的设计与界面的设计.实现了数字电视用户管理系统基本功能,基本上满足了实际商业运营的需要.     

SQL的现状及其研究与发展

一、SQL简介 如果说七十年代关系数据库还处于研制实验阶段,那么到了八十年代大量关系数据库商用产品的面市几乎占据了整个数据库市场,其中的原因在于它们使用了统一的语言界面,那就是,SQL成为了关系数据库的通用语言。 1974年．IBM公司San Jose研究实验室的D．D．Chamberlin在开发SEQUEL-XRM原型时提出了SE-QUEL(Structured English Query Language),1976年又修改成为SEQUEL／2．也就是目前的SQL(StructuredQuer Language)。SEQUEL／2主要成形于IBM的Sys-tem R原型中[2],并在原有基础上大加扩展,其后逐渐完善并最终成为一种完备的结构化数据库查询语言。     

数据采集与监控软件Genie

Genie是具有国际先进水平的数据采集与监控软件，它提供了一个面向对象的图形化用户界面，因此简化了数据采集过程、控制应用程序开发和操作员界面。本文介绍了Genie的特点、功能、基本用途以及VISUALBA－SIC在设计这类监控软件中的作用。     

条件概率关系数据库模型

现实世界中大量存在着的不确定性信息，关系数据库模型仅视它们为空值，有必要增强其处理这类信息的能力，文章在总结前人工作的基础上推广关系数据库模型，创建有效处理随机型不确定性信息的条件概念关系数据库模型，该模型通过在关系模式中增加一个条件概率测度属性，为每条记录指定适当的条件概率的途径，来表示不确定性信息。文中以对象码为基本工具，创建了条件概率关系结构；以特征函数为基本工具，定义了一套基于该结构的代数运算规则。条件概率的语意比概率的语意广泛，灵活，因而该模型能有效克服概率关系模型的许多不足。     

A VLSI architecture for a half-edge-based corner detector

Corner detection is a low-level feature detection operator that is of great use in image processing applications, for example, optical flow and structure from motion by image correspondence. The detection of corners is a computationally intensive operation. Past implementations of corner detection techniques have been restricted to software. In this paper we propose an efficient very large-scale integration (VLSI) architecture for detection of corners in images. The corner detection technique is based on the half-edge concept and the first directional derivative of Gaussian. Apart from the location of the corner points, the algorithm also computes the corner orientation and the corner angle and outputs the edge map of the image. The symmetrical properties of the masks are utilized to reduce the number of convolutions effectively, from eight to two. Therefore, the number of multiplications required per pixel is reduced from 1800 to 392. Thus, the proposed architecture yields a speed-up factor of 4.6 over conventional convolution architectures. The architecture uses the principles of pipelining and parallelism and can be implemented in VLSI.     

高分辨率合成孔径雷达图像舰船检测方法

寻找针对高分辨率SAR图像的舰船目标检测算法。利用KSW双阈值分割技术，其效果比传统检测方法好，有利于进一步的目标分类和识别。且必须根据SAR图像分辨率来选择舰船检测算法。