基于Agent的P2P协同计算任务的分解

提出了基于Agent的P2P协同计算模型,给出了一种组织分散的计算资源的行之有效的方法,解决了分布计算中的各计算实体之间的协作问题。基于合同网的资源协商方法帮助建立任务协作网络;基于元组空间的任务分解与协作,能有效地组织Agent进行任务的计算,解决任务的分解、分配和协作问题。     

矩阵奇异值分解在计算技术中的应用

奇异值是矩阵的一个良好特征。本文通过对矩阵奇异值分解的分析，对计算机图像压缩和数字水印技术方面的应用方法进行了描述，同时提供了部分应用例子。     

Computing the Primary Decomposition of Zero-dimensional Ideals

Let K be an infinite perfect computable field and let I ⊆ K [ x ] be a zero-dimensional ideal represented by a Gröbner basis. We derive a new algorithm for computing the reduced primary decomposition of I using only standard linear algebra and univariate polynomial factorization techniques. In practice, the algorithm generally works in finite fields of large characteristic as well.     

智能算法在齿轮传动优化设计的应用

以齿轮优化设计为例，分别得出用传统机械设计优化方法和用遗传算法与神经网络协同求解的结果，并进行了比较，体现了遗传算法与神经网络协同求解的特点。结果表明．该方法是非常有效的，在求解优化设计时取得了较为满意的结果。     

Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition

Abstract. Using the notion of modular decomposition we extend the class of graphs on which both the treewidth and the minimum fill-in can be solved in polynomial time. We show that if C is a class of graphs that are modularly decomposable into graphs that have a polynomial number of minimal separators, or graphs formed by adding a matching between two cliques, then both the treewidth and the minimum fill-in on C can be solved in polynomial time. For the graphs that are modular decomposable into cycles we give algorithms that use respectively O(n) and O(n ³ ) time for treewidth and minimum fill-in.     

Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition

Using the notion of modular decomposition we extend the class of graphs on which both the treewidth and the minimum fill-in can be solved in polynomial time. We show that if C is a class of graphs that are modularly decomposable into graphs that have a polynomial number of minimal separators, or graphs formed by adding a matching between two cliques, then both the treewidth and the minimum fill-in on C can be solved in polynomial time. For the graphs that are modular decomposable into cycles we give algorithms that use respectively O(n) and O(n3) time for treewidth and minimum fill-in.     

Computing 3D Shape Guarding and Star Decomposition

This paper proposes an effective framework to compute the visibility guarding and star decomposition of 3D solid shapes. We propose a progressive integer linear programming algorithm to solve the guarding points that can visibility cover the entire shape; we also develop a constrained region growing scheme seeded on these guarding points to get the star decomposition. We demonstrate this guarding/decomposition framework can benefit graphics tasks such as shape interpolation and shape matching/retrieval.     

基于MPI并行计算的信号稀疏分解

在研究信号稀疏分解理论及其最常用的匹配追踪算法的基础上,针对MP算法存在的计算量过大的问题,提出一种基于并行计算系统实现信号稀疏分解的方法。该方法利用8台微机,采用MPI消息传递机制,以100 M高速以太网作为互联网络,构建了一套Beowulf 并行计算系统,在此系统上通过编制并行程序来实现MP算法。实际测试表明这种方法具有很高的并行计算效率,分解时间从单机75 min左右下降到8机并行11 min左右,大大提高了信号稀疏分解的速度。     

并行计算在网络安全中的应用

信息技术的发展与应用促进了信息安全不断的延伸,在信息安全技术中“安全的密码算法”是最重要的。本文在简单介绍著名的对称密钥加密算法-DES和并行计算技术,并就并行计算技术在密码算法的加解密过程中的应用,在提高加解密速度方面的作用作了积极探讨。     

引入虚拟变量的时间序列分解法在卷烟销量预测中的应用

时间序列分解法依据时间序列的长期特征和季节性特征对未来进行合理预测,但处理季节因素时,在我国会受到传统节日的影响．以时间序列分解法为基础,将中国传统节日设定为虚拟变量,构建基于时间序列分解法和虚拟变量的改进模型．通过虚拟变量估测传统节日对序列的影响,对传统方法进行适用性改进．在对某省卷烟90个月总销量预测的算例中,改进后的预测方法能够提高预测精度,有利于企业据此合理安排生产销售计划．     

Java RMI在分布计算中的应用

随着网络技术、面向对象技术的成熟,分布计算已成为软件设计的主流技术.Java RMI是Java实现网络分布计算应用模型的解决方案之一.本文简单介绍RMI的编程方法,讨论了利用RMI进行分布计算的步骤,通过实例说明访问Oracle数据库的分布计算实现过程.     

Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns

The QR decomposition of a set of matrices which have common columns is investigated. The triangular factors of the QR decompositions are represented as nodes of a weighted directed graph. An edge between two nodes exists if and only if the columns of one of the matrices is a subset of the columns of the other. The weight of an edge denotes the computational complexity of deriving the triangular factor of the destination node from that of the source node. The problem is equivalent to constructing the graph and finding the minimum cost for visiting all the nodes. An algorithm which computes the QR decompositions by deriving the minimum spanning tree of the graph is proposed. Theoretical measures of complexity are derived and numerical results from the implementation of this and alternative heuristic algorithms are given.     

P2P及其在企业计算中的应用

1 引言简单地说,P2P应用是由物理上分布的节点组成,以协作完成某些任务;这些节点被称为对等实体(peer),对等意味着这些实体在执行计算、提供和消费服务时分担相同的责任。这与传统的客户/服务器模式不同。客户/服务器模式中利用少量的服务器来处理潜在的可能的大量客户的服务请求,因此系统中的实体有明确的角色划分。     

JavaRMI在分布计算中的应用

随着网络技术、面向对象技术的成熟,分布计算已成为软件设计的主流技术。JavaRMI是Java实现网络分布计算应用模型的解决方案之一。本文简单介绍RMI的编程方法,讨论了利用RMI进行分布计算的步骤,通过实例说明访问Oracle数据库的分布计算实现过程。     

PKI在P2P-Grid安全计算平台中的应用

由于P2P系统节点的分布性,集中式的安全控制方式难以有效使用。借鉴网格计算的安全技术,提出了将PKI技术应用到P2P-Grid计算平台中的设计方案,首先由客户端发出请求,通过CA服务器认证后,与网格服务器建立安全连接,并按照一定的访问控制策略将任务分配到获准使用的网格节点。网格节点资源采用P2P的PeerGroup形式进行组织和管理,由PeerGroup中的Peer完成分布式计算,然后将各个Peer的计算结果汇总到网格服务器,最后将计算结果返回到客户端。该设计方案在一定程度上实现了在P2P-Grid平台上分布计算的安全性。     

A Parallel Algorithm for Computing the Generalized Singular Value Decomposition

A parallel algorithm for computing the generalized singular value decomposition of two matrices A and B having the same number of columns is described in this paper. The algorithm is designed for efficient implementation on distributed-memory parallel computer architectures. The time cost is O(n²) units for parallel preprocessing, and O(n²/p) units for the GSVD of two upper trapezoidal matrices, where p is the dimension of the triangular array of processors.     

实名计算在企业移动计算软件控制中的应用

本文针对目前企业移动计算存在的软件安全问题,阐明软件制造者的法律责任应当得到追究。简要介绍了软件数字签名技术、实名计算概念、原理及其技术体系,将已有的软件签名技术加以总结,给出了企业移动计算软件生命期管控机制基本框架,最后阐述了企业软件控制的必要性。     

An Alternative Approach to Computing Shape Orientation with an Application to Compound Shapes

We consider the method that computes the shape orientation as the direction α that maximises the integral of the length of projections, taken to the power of 2N, of all the straight line segments whose end points belong to the shape, to a line that has the slope α. We show that for N=1 such a definition of shape orientation is consistent with the shape orientation defined by the axis of the least second moment of inertia. For N>1 this is not the case, and consequently our new method can produce different results. As an additional benefit our approach leads to a new method for computation of the orientation of compound objects.     

属性拓扑的并行概念计算算法

随着并行计算时代的到来,形式概念的并行计算成为形式概念分析领域的研究热点之一.本文以属性拓扑为基本表示形式,通过属性拓扑的图特性进行并行概念计算算法设计.首先,根据属性拓扑中属性的伴生关系对属性拓扑进行自下而上分解,将一个整体拓扑分解为若干个子拓扑;其次,根据属性间的相关关系去除各子拓扑间的概念耦合,保证不同子拓扑在概念计算层面的各自独立性,以避免后期合并运算的大规模时间消耗;最后,在各子拓扑上进行概念计算并将各子拓扑概念直接累加可得原始背景的全部概念集合.实验证明,本文所提方法不但可以无重复的计算全部概念,而且可以根据硬件平台情况提高计算效率,减少概念计算所需时间.