Web数据仓库的异步迭代查询处理方法

数据仓库信息量的飞速膨胀对数据仓库提出了巨大挑战.如何提高Web环境下数据仓库的查询效率成为数据仓库研究领域重要的研究问题.对Web数据仓库的体系结构和查询方法进行了研究和探讨.在分析几种Web数据仓库实现方法的基础上,提出了一种Web数据仓库的层次体系结构,并在此基础上提出了Web数据仓库的异步迭代查询方法.该方法充分利用了流水线并行技术,在Web数据仓库的查询处理过程中不同层次的结点以流水线方式运行,并行完成查询的处理,提高了查询效率.理论分析表明,该方法可以有效地提高Web数据仓库的查询效率.     

Interval Consistency of Asynchronous Distributed Computations

An interval of a sequential process is a sequence of consecutive events of this process. The set of intervals defined on a distributed computation defines an abstraction of this distributed computation, and the traditional causality relation on events induces a relation on the set of intervals that we call I-precedence. An important question is then, “Is the interval-based abstraction associated with a distributed computation consistent?” To answer this question, this paper introduces a consistency criterion named interval consistency (IC). Intuitively, this criterion states that an interval-based abstraction of a distributed computation is consistent if its I-precedence relation does not contradict the sequentiality of each process. More formally, IC is defined as a property of a precedence graph. Interestingly, the IC criterion can be operationally characterized in terms of timestamps (whose values belong to a lattice). The paper uses this characterization to design a versatile protocol that, given intervals defined by a daemon whose behavior is unpredictable, breaks them (in a nontrivial manner) in order to produce an abstraction satisfying the IC criterion. Applications to communication-induced checkpointing are suggested.     

一种基于广义异步值迭代的规划网络模型

近年来,如何生成具有泛化能力的策略已成为深度强化学习领域的热点问题之一,并涌现出了许多相关的研究成果,其中的一个代表性工作为广义值迭代网络.广义值迭代网络是一种可作用于非规则图形的规划网络模型.它利用一种特殊的图形卷积算子来近似地表示状态转移矩阵,使得其在学习到非规则图形的结构信息后,可通过值迭代过程进行规划,从而在具有非规则图形结构的任务中产生具有泛化能力的策略.然而,由于没有考虑根据状态重要性来合理分配规划时间,广义值迭代网络中的每一轮迭代都需要在整个状态空间的所有状态上同步执行.当状态空间较大时,这样的同步更新会降低网络的规划性能.用异步更新的思想来进一步研究广义值迭代网络.通过在值迭代过程中定义状态优先级并执行异步值更新,提出了一种新型的异步规划网络模型——广义异步值迭代网络.在未知的非规则结构任务中,与广义值迭代网络相比,广义异步值迭代网络具有更高效且更有效的规划过程.进一步地,改进了广义值迭代网络中的强化学习算法及图形卷积算子,并通过在非规则图形和真实地图中的路径规划实验验证了改进方法的有效性.     

异步时序电路的功能测试自动生成方法

异步时序电路的测试一直是一个比较困难的问题。该文通过在前人研究的基础上，提出了一种实用、高效的自动测试生成方法。该方法通过使用基于OBDD(有序二元判决图)的布尔特征函数的运算求解来确定电路的状态转换图，然后通过对转换图的强连通图的搜索运算简化状态转换图，最后使用图论的方法求出测试序列。     

Synchronous and Asynchronous Interval Newton-Schwarz Methods for a Class of Large Systems of Nonlinear Equations

We introduce a class of parallel interval arithmetic iteration methods for nonlinear systems of equations, especially of the type Ax+(x) = f, diagonal, in R ^N . These methods combine enclosure and global convergence properties of Newton-like interval methods with the computational efficiency of parallel block iteration methods: algebraic forms of Schwarz-type methods which generalize both the well-known additive algebraic Schwarz Alternating Procedure and multisplitting methods. We discuss both synchronous and asynchronous variants. Besides enclosure and convergence properties, we present numerical results from a CRAY T3E.     

Group Axioms for Iteration

Iteration theories provide a sound and complete axiomatization of the equational properties of the iteration (or fixed point) operation in many models of theoretical computer science including ordered and metric structures, trees and synchronization trees. All known equational axiomatizations of iteration theories consist of a small set of equational axioms for Conway theories and a complicated equation scheme, the commutative identity. Here we associate an identity with each finite semigroup. We prove that the set consisting of the Conway identities and the group identities associated with the finite (simple) groups is complete. Moreover, we prove that the Conway identities and a subcollection of the semigroup identities associated with a subclass of the finite semigroups is complete iff each finite (simple) group divides one of the semigroups in the subclass. We also formulate a conjecture and study its consequences. The results are a generalization of Krob's axiomatization of the equational theory of the regular sets.     

ST16C550通用异步收发器测试技术研究

介绍了ST16C550异步收发器电路结构和功能以及直流参数和交流参数的测试技术。并着重介绍了该电路各个功能块的测试原理,包括FIFO操作模式、time-out中断、可编程波特率发生器、DMA操作模式和Loop-back模式。简单分析了该电路直流参数的测试原理及在不同测试系统上交流参数的测试能力和方法。     

基于异步时钟的SoC功耗约束测试调度优化

测试调度是一种能有效减少片上系统(system-on-chip, SoC)测试耗时(test application time, TAT)以降低测试成本的经典技术.然而,随着功耗问题的日益加剧,功耗约束成为测试调度中必须考虑的重要问题.可以调节各测试周期长度的异步时钟测试在对单个电路进行测试用时优化时效果显著,但直接将其应用于SoC测试调度并非总能获得最优的调度结果,使用传统测试调度模型往往会产生明显非最优的结果.在结合图论中团(clique)的概念,并分析异步时钟机制的特点后,提出一种将异步时钟特性应用于功耗约束SoC测试调度的方案.使用测试兼容图(test compatibility graph, TCG)和混合整型线性规划(mixed integer linear programming, MILP)建立相对应数学模型,理论分析和在ITC02基准SoC集上的模拟实验结果表明,该方案能有效地减少测试耗时.     

基于区间算法的软件测试数据生成方法

软件测试过程中经常需要对大量的数值计算模块进行穷举测试,传统的软件测试方法就显露出了不足与局限。该文采用区间算法生成测试数据,比较了采用区间算法的软件测试方法和传统的软件测试方法,结果表明,区间代数方法很好地解决了传统测试方法不能解决的问题,发现程序代码中可能的计算异常,判断能否给出程序代码输出变量的上限范围和是否存在不可能达到的分支。     

An Effective High-Order Interval Method for Validating Existence and Uniqueness of the Solution of an IVP for an ODE

Validated methods for initial value problems for ordinary differential equations produce bounds that are guaranteed to contain the true solution of a problem. When computing such bounds, these methods verify that a unique solution to the problem exists in the interval of integration and compute a priori bounds for the solution in this interval. A major difficulty in this verification phase is how to take as large a stepsize as possible, subject to some tolerance requirement. We propose a high-order enclosure method for proving existence and uniqueness of the solution and computing a priori bounds.     

Asynchronous Forward-checking for DisCSPs

A new search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. Agents assign variables sequentially, but perform forward checking asynchronously. The asynchronous forward-checking algorithm (AFC) is a distributed search algorithm that keeps one consistent partial assignment at all times. Forward checking is performed by sending copies of the partial assignment to all unassigned agents concurrently. The algorithm is described in detail and its correctness proven. The sequential assignment method of AFC leads naturally to dynamic ordering of agents during search. Several ordering heuristics are presented. The three best heuristics are evaluated and shown to improve the performance of AFC with static order by a large factor. An experimental comparison of AFC to asynchronous backtracking (ABT) on randomly generated DisCSPs is also presented. AFC with ordering heuristics outperforms ABT by a large factor on the harder instances of random DisCSPs. These results hold for two measures of performance: number of non-concurrent constraints checks and number of messages sent. Research supported by the Lynn and William Frankel Center for Computer Sciences and the Paul Ivanier Center for Robotics and Production Management.     

Centroid Iteration algorithm for image tracking

A simple and elegant tracking algorithm called Centroid Iteration algorithm is proposed. It employs a new Background-Weighted similarity measure which can greatly reduce the influence from the pixels shared by the target template and background on localization. Experiments demonstrated the Background-Weighted measure performs much better than the other similarity measures like Kullback–Leibler divergence, Bhattacharyya coefficient and so on. It has been proved that this measure can compute the similarity value contribution of each pixel in the target candidate, based on which, a new target search method called Centroid Iteration is constructed. The convergence of the method has been demonstrated. Theory analysis and visual experiments both validated the new algorithm.     

Stochastic Iteration for Non-diffuse Global Illumination

This paper presents a single-pass, view-dependent method to solve the rendering equation, using a stochastic iterational scheme where the transport operator is selected randomly in each iteration. The requirements of convergence are given for the general case. To demonstrate the basic idea, a very simple,continuous random transport operator is examined, which gives back the light tracing algorithm incorporating Russian roulette. Then, a new mixed continuous and finite-element based iteration method is proposed, which uses ray-bundles to transfer the radiance in a single random direction. The resulting algorithm is fast, it provides initial results in seconds and accurate solutions in minutes and does not suffer from the error accumulation problem and the high memory demand of other finite-element and hierarchical approaches.     

An Equational Axiomatization for Multi-exit Iteration

This paper presents an equational axiomatization of bisimulation equivalence over the language of Basic Process Algebra (BPA) with multi-exit iteration. Multi-exit iteration is a generalization of the standard binary Kleene star operation that allows for the specification of agents that, up to bisimulation equivalence, are solutions of systems of recursion equations of the form wherenis a positive integer and theP_iand theQ_iare process terms. The addition of multi-exit iteration to BPA yields a more expressive language than that obtained by augmenting BPA with the standard binary Kleene star (BPA*). As a consequence, the proof of completeness of the proposed equational axiomatization for this language, although standard in its general structure, is much more involved than that for BPA*. An expressiveness hierarchy for the family ofk-exit iteration operators proposed by Bergstra, Bethke, and Ponse is also offered.     

The Kleinman Iteration for Nonstabilizable Systems

 We consider the computation of Hermitian nonnegative definite solutions of algebraic Riccati equations. These solutions are the limit, P=lim_{i →∞} P _i, of a sequence of matrices obtained by solving a sequence of Lyapunov equations. The procedure parallels the well-known Kleinman technique but the stabilizability condition on the underlying linear time-invariant system is removed. The convergence of the constructed sequence {P _i }_i≥1 is guaranteed by the minimality of P _i in the set of Hermitian nonnegative definite solutions of the Lyapunov equation in the ith iteration step. Date received: October 21, 1999. Date revised: February 14, 2002. RID="*" ID="*"This work was supported by the Acciones Integradas programme of Deutscher Akademischer Austauschdienst (Germany) and Dirección General de Infraestructura y Relaciones Internacionales (Spain).     

Experience Replay for Least-Squares Policy Iteration

Policy iteration, which evaluates and improves the control policy iteratively, is a reinforcement learning method. Policy evaluation with the least-squares method can draw more useful information from the empirical data and therefore improve the data validity. However, most existing online least-squares policy iteration methods only use each sample just once, resulting in the low utilization rate. With the goal of improving the utilization efficiency, we propose an experience replay for least-squares policy iteration (ERLSPI) and prove its convergence. ERLSPI method combines online least-squares policy iteration method with experience replay, stores the samples which are generated online, and reuses these samples with least-squares method to update the control policy. We apply the ERLSPI method for the inverted pendulum system, a typical benchmark testing. The experimental results show that the method can effectively take advantage of the previous experience and knowledge, improve the empirical utilization efficiency, and accelerate the convergence speed.      

适于进化算法的迭代式MapReduce框架

MapReduce模块化的编程大大降低了分布式算法的实现难度,但同时也限制了它的应用范围。介绍了MapReduce的基本结构及其实现迭代算法的缺陷,并针对基于MapReduce进化算法效率低下的问题,在对MapReduce的计算框架进行研究的基础上提出了一种适用于进化算法的迭代式MapReduce计算框架。描述了迭代式MapReduce计算框架的实现需求及其具体实现,提出并证明了异常机制的可行性,且在公有的Hadoop云计算平台上对提出的框架进行了验证。实验结果表明,基于迭代式MapReduce计算框架的并行遗传算法在算法的加速比上与基于MapReduce的并行遗传算法相比有较大的提高。     

基于区间必然集的测试用例生成方法

针对自动化单元测试中面向路径的测试用例生成问题,通过改进传统的基于符号执行的测试用例生成方法,提出“符号化区间”来表示和分析变量的静态取值范围,并给出简单表达式和逻辑表达式中“区间可能集”和“区间必然集”的计算方法.提出了面向路径的值区间分析算法,通过对给定路径进行前向数据流分析来计算各条边上的区间上下文环境以及各符号的必然取值区间,在路径出口处的符号值区间必然集中任意取值,可得到覆盖给定路径的测试用例.与基于约束求解的传统方法相比,文中方法省去了表达式变换及调用约束求解器的过程,对输入变量弱关联的情况能够快速、准确地生成测试用例.     

Incremental Value Iteration for Time-Aggregated Markov-Decision Processes

A value iteration algorithm for time-aggregated Markov-decision processes (MDPs) is developed to solve problems with large state spaces. The algorithm is based on a novel approach which solves a time aggregated MDP by incrementally solving a set of standard MDPs. Therefore, the algorithm converges under the same assumption as standard value iteration. Such assumption is much weaker than that required by the existing time aggregated value iteration algorithm. The algorithms developed in this paper are also applicable to MDPs with fractional costs.     

异步电路验证算法

异步电路因不受时钟偏差的限制而逐渐成为电路设计研究的热点 .发展自动化的验证工具已成为确保大规模异步电路质量和性能的关键 .其核心课题就是建立异步电路的验证算法 .该文整理列举了基于多种数学模型的验证算法 ,如逻辑模型、代数模型、符号模型、数值模型和几何模型的验证算法 ,并从应用的角度将现有的异步电路验证算法分为两类 ,分别是事件时序分析类算法和状态空间搜索类算法 ,从算法的理论基础、应用背景、模型结构、图形描述、适用范围、算法复杂度编程复杂度等多个角度作了比较研究 ,给出了部分代表算法的应用算例 ,最后总结了在实际问题中选择验证算法的原则