An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client‘s queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

一种基于P2P的可扩展Web缓存方法

在分析现有P2P网络缓存技术的基础上,提出了一种基于P2P的可扩展Web缓存方法, 系统原型包括胖节点和瘦节点,胖节点负责某一区域内所有节点的信息,它保存着该区域内所有节点的地址列表和节点所共享的缓存内容的索引.瘦节点可以和区域内的所有节点直接进行通信.实验表明,和现有的P2P网络缓存方法相比,该方法只需在每个节点上增加很低的开销就可以扩展节点,增加了容错性,且易于管理和易于发现节点.     

基于区块链存储扩展的结构化数据管理方法

研究基于区块链存储扩展的结构化数据管理方法,解决目前在区块链存储方面存在的容量扩展、存储结构扩展等问题.通过节点动态组网、DHT通信协议,网络中节点仅需存储部分数据,实现数据的存储、查询管理;通过数据签名及定时验证,保障数据安全存储及查询;本地数据库存储结构化数据,扩展业务数据管理.实验结果表明,该方法实现了结构化数据的区块链存储扩展管理,充分利用了节点的网络资源,降低了节点存储压力,提升了数据存储、查询效率,进一步促进区块链应用的开发.      

帧存储器容量受限条件下编码视频码率变换的研究

提出了一种帧存储器容量受限条件下编码视频码率变换结构。在这种结构中，将压缩的参考图像存入帧存储器中以节省存储空间，同时通过截除适量与高频ＤＣＴ系数对应的码字以适应任意容量的帧存储器，而运动补偿直接在ＤＣＴ域实现，避免频域怀空间域转换所需的运算量，这种结构的性能随配置帧存储器容量的增加呈单调递增的关系，为存储器容量受限的情况下获得满意的变换图像质量提供了有效途径。     

Constructing Projection Frequent Pattern Tree for Efficient Mining

Frequent Pattern mining plays an essential role in data mining. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns.In this study, we introduce a novel frequent pattern growth (FP-growth) method, which is efficient and scalable for mining both long and short frequent patterns without candidate generation. And build a new projection frequent pattern tree (PFP-tree) algorithm on this study, which not only heirs all the advantages in the FP-growth method, but also avoids it's bottleneck in database size dependence when constructing the frequent pattern tree (FP-tree). Efficiency of mining is achieved by introducing the projection technique, which avoid serial scan each frequent item in the database, the cost is mainly related to the depth of the tree, namely the number of frequent items of the longest transaction in the database, not the sum of all     

分布式时态关联规则挖掘

提出了在分布式环境下对于每一层使用不同支持度的时态关联规则挖掘问题及其算法DMARM。该算法使用轮询方法处理分布式系统中各个节点间的通讯问题,在各个节点上利用集合“或”和“与”运算,在求候选频繁模式的同时求出了模式的支持度,减少了数据库的扫描次数。     

阈值上限一定时超大规模数据库的查询方法研究

在确定查询阈值上限时,当前数据库查询方法只能使用查询树的一条路径,并行性能较差;在对超大规模数据进行查询时,具有查询时间长、响应不及时的弊端。为此,提出一种新的阈值上限一定时超大规模数据库的查询方法,通过RSA算法对超大规模数据库进行加密和解密处理,依据多叉树的定义构造多叉索引树,在此基础上计算各代表数据点与查询点之间的距离;在阈值上限一定时,利用多个从节点机并行处理后,使用主节点机汇集结果,运用后续子树递归处理,直至获取查询结果。实验结果表明,所提方法不仅具有很高的查询效率,而且CPU使用率很高。     

密态数据库的检索与信息渗漏

为了提高数据库的安全,防止越过权限控制的信息泄露,利用数据项这一最小粒度作为加密单元,以增强数据库安全。分析了目前数据库中加密数据的方案。提出一种基于平均差值排序的密态数据库检索方法,以隐藏明文序列防止动态追踪。对字段级加密,通过引入干扰因子来隐藏信息的泄露。对可能出现的有限值域信息泄露进行了研究。对文献[5]提出的防泄露算法进行了分析。实验结果表明:改进的方法在增强数据安全的同时,也具有较短的响应时间。     

嵌入空间数据库的地图服务

传统的Web地图服务必须由运行于独立进程的“地图服务器”提供．栅格地图不能直接通过查询谓词“select”从空间数据库中得到．通过在空问数据库增加模块提供查询谓词“select”对地图服务的支持．地图渲染模块负责地图绘制,Symbol扩充数据类型为空间数据提供不同的地图表现形式．扩充后的空问数据库被称作“MapBase”．最后提供了MapBase的应用实例,同时和以往的地图服务方式进行了比较．实验表明,扩展空间数据库的方式简化了地图服务的系统结构,便于WebGIS二次开发．图6,参9．     

混合动态数据库集群的并行空间连接优化算法

传统算法数据划分冗余度和倾斜度高,无用连接数据多,降低负载均衡性,对整体效率产生不好的影响,不适于实际应用。为此,面向混合动态数据库集群提出一种新的并行空间连接优化算法。采用网格划分法对数据进行划分,依据空间数据划分结果获取数据分布状态,计算节点按照数据分布状态得到候选集。通过平面扫描形成若干子空间连接的子任务,利用构建节点花费模型,依据花费模型对并行空间连接所需的平均节点访问个数进行评估,把候选任务集分配至不同计算节点,在不同节点执行并行空间连接操作。通过边界过滤策略,删除不可能有结果的元组,提高效率,增强算法的实用性。实验结果表明,所提算法适于实际应用,效率高。     

露天矿运输道路网络的建立及其路径优化

 分析露天矿道路组成,对露天矿道路的不同路段进行合理划分,划分方法涉及到道路的路面质量、坡度和承载能力等因素,从而完成对露天矿道路的描述。提出露天矿道路网络节点的选取原则及其网络边权值的计算方法。建立起露天矿道路网络模型,设计露天矿道路网络数据库作为道路网络模型的后台数据库支持,数据库中包括网络节点数据表和节点间关系数据表,每个网络节点对应一个路段端点,每个关系对应一条网络边。设计出网络图节点的自动提取程序,并将节点数据信息自动存储到露天矿道路网络数据库中。选择粒子群算法作为道路网络路径的优化算法,实现了求解指定两点间的最短路径的粒子群算法。程序将搜索到的最优路径自动显示到网络图中,并达到了较高的搜索精度。     

一种编译指导的实时动态电压调节低功耗算法

提出了一种编译指导的实时动态电压调节低功耗算法.算法在编译器的帮助下,在条件语句,循环语句等影响程序实际执行时间的控制语句结构中设置电压调节点,插入电压调节代码,从而最大限度地利用了程序运行时的空闲时间,达到了降低系统功耗的效果.在RTLPower实时低功耗系统上对算法进行了实验,实验结果表明该算法可以减少50%的能量消耗.     

Parallel recovery method in shared-nothing spatial database cluster system

Shared-nothing spatial database cluster system provides high availability since a replicated node can continue service even if any node in cluster system was crashed. However if the failed node wouldn‘t be recovered quickly, whole system performance will decrease since the other nodes must process the queries which the failed node may be processed. Therefore the recovery of cluster system is very important to provide the stable service. In most previous proposed techniques, external logs should be recorded in all nodes even if the failed node does not exist. So update transactions are processed slowly. Also recovery time of the failed node increases since a single storage for all database is used to record external logs in each node. Therefore we propose a parallel recovery method for recovering the failed node quickly.     

Parallel recovery method in shared-nothing spatial database cluster system

Shared-nothing spatial database cluster system provides high availability since a replicated node can continue service even if any node in cluster system was crashed.However if the failed node wouldn't be recovered quickly, whole system performance will decrease since the other nodes must process the queries which the failed node may be processed. Therefore the recovery of cluster system is very important to provide the stable service. In most previous proposed techniques, external logs should be recorded in all nodes even if the failed node does not exist. So update transactions are processed slowly.Also recovery time of the failed node increases since a single storage for all database is used to record external logs in each node. Therefore we propose a parallel recovery method for recovering the failed node quickly.     

基于灰度直方图窗口扫描分类的FGS图像编码

针对静止图像网络传输数据量大,网络用户对接收图像质量要求不同的问题,对图像基本层的编码策略加以改进,提出了基于灰度直方图窗口扫描分类的FGS(Fine Granularity Scalable)图像编码方法\.该方法根据像素点出现概率的大小对灰度区间进行分类,像素值根据所属的类别进行不同程度的编码,并通过与用户之间的交互式操作满足用户不同的需求\.研究结果表明,该方法可使编码图像的每位数据信息在解码时得到充分利用,同时兼顾了网络传输性质与用户对内容的关注方式,更加便于网络传输与浏览。     

一种构造正交尺度函数的方法

由于多小波解决了单小波不可能同时具有正交性、紧支性和对称性的困难,其更具有研究的价值.在正交多小波理论的基础上,研究了利用两尺度函数构造正交的尺度函数的方法,从理论上给出了直接用尺度函数正交化方法构造正交多尺度函数的方法.     

基于自适应模型的数据库入侵检测方法

提出了一种基于自适应模型数据库入侵检测方法(ASIDS).该方法基于矩阵和最小支持度函数的AprioriZ关联算法,依据在训练和自适应入侵检测阶段产生数据库的操作特征,用户根据实际需求动态调整最小支持度函数的值,更高效挖掘操作特征.结合层次聚类算法产生动态规则库,通过计算待检测数据操作特征与规则库中聚类的距离是否超过聚类间最大距离来判断异常,以避免已有检测系统中判断"边界尖锐"问题,并实时把正常操作特征归入动态规则库,通过对报警信息的关联分析降低误警率.实验结果表明,ASIDS能够实时地进行入侵检测,具有很高的检测率和较低的误警率.     

具有双电压调节处理器的最优DVS算法

为了解决嵌入式实时系统如何节省电能的问题,针对具有两种运行状态的微处理器提出了最优的动态电压调节(DV S)算法。对具有周期性硬实时任务集的嵌入式系统,引进了部分降频的新概念,建立了精确实用的数学模型,在此基础上证明了该算法的最优性。分别从实例实验、仿真试验两个方面,证实了该算法的正确性和有效性。实验结果表明,采用这种最优DV S算法的系统,比不采用DV S算法的系统明显地节省能量,具体减少的数值依赖于任务集的构成和处理器状态,但是减少量平均达到20%以上。和其他类似的调度算法相比,也能更好地减少能耗。     

Adaptive Distributed Admission Control in Differentiated Services Domains

In this paper we propose a scalable admission control scheme for the QoS sensitivity traffic in DiffServ domains. In our scheme, the ingress routers perform admissibility test in a fully distributed and parallel fashion for requests based on our resource per-assigning mechanism.Then, we introduce a novel two phase token passing mechanism to adaptively optimize resource per-assigning among contending edge ronters in proportion to their traffic.In addition, we adopt a measurement based admission decision-making criterion to gain the benefit of high utilization of statistical multiplexing. Our simulation results indicate that even under very high request load it is possible to perform admission control and resource allocation in parallel without suffering in terms of response time, packet loss rate, or utilization.     

Comments on scaling effect of reciprocity in BRDF study

Reciprocity principle is a common theory in electromagnetics and optics. It is also one of the general principles of the radiation transformation theory. However, in many remote sensing studies, this principle cannot be always supported by experimental data, especially when the scaling effect of the remote sensing image pixel is considered. The debate over the issue of whether the reciprocity principle can be used as a fundamental standard in evaluating the effectiveness of remote sensing observations has lasted for years. Using geometrical optics model, Li and Wan proved the existence of the scaling effect in applying the reciprocity principle to a remote sensing image pixel in 1998. In 2002, Snyder challenged Li's proof, and attempted to prove that reciprocity principle is universally valid without any scale limitation. In this paper, we will argue with Snyder's theory and point out that Snyder's theory had neglected an important condition used in Li's proof and, as a result, drawn the wrong conclusion. Here we will restate Li's condition in his demonstration and offer a further proof to verify that reciprocity principle cannot be applied unconditionally to the study of bi-directional reflectance distribution function (BRDF) of land surfaces in field or satellite remote sensing observation scale.