多重链路网络分区与QoS度量两级并行QoSR算法

在多重链路上联网络环境下,采用并行路由搜索的思想寻找最优路径,能够获得较好的路径寻优结果,并且算法的时间复杂度较低.给出一种两级并行QoSR算法,将多重链路环境按一定规则划分为若干分区,为每个分区分配一定数量的QoS度量并行处理器和1个分区处理器,在各个分区分别采用QPAS算法,由QoS度量并行处理器并行计算出各分区内的QoS度量Pareto最佳路径,最终由分区处理器调用最短路径并行算法完成分区间代价最小路径的计算.     

布尔表达式的化简与并行排序网络验证

为设计出能够验证并行排序网络正确性的有效工具,根据[0,1]原理和布尔函数的特点和性质,提出一种布尔表达式的化简算法,并根据此算法设计出验证工具.对[0,1]原理和布尔函数的特点和性质进行了讨论,指出有利于化简操作的性质.设计出的工具能够根据并行排序网络的参数显示网络图形、自动生成布尔表达式并实现化简验证,工具的输出有利于对排序网络的分析,也可以用于辅助排序网络的设计和优化.实验结果表明了该工具的有效性.     

基于并行组合模拟退火算法的过程挖掘

首先给出了过程挖掘问题的形式化描述,然后提出了一种适合过程挖掘的并行组合模拟退火算法。该算法采用因果关系矩阵作为过程模型的编码,与同类算法相比,对适应度函数、交叉和变异算子进行了改进,并利用模拟退火算法的特性提高了算法的收敛速度。仿真实验表明该算法能较有效地处理日志噪声问题。     

一种并联激光焊接机器人的机构设计与运动学分析

提出了一种3 分支5 自由度的并联激光焊接机器人,通过3 个分支共同作用,使整机具备了5 个自由 度的空间加工能力．针对激光焊接,通过分析该机器人的结构特性,建立了其正反解运动学模型,通过解析法求解 该模型并进行了计算仿真．最后,对机器人进行激光拼焊实验,仿真数据和实验结果表明,本文研究的并联机器人 机构适用于实际的高速、高精度激光焊接．     

并行测试技术及在导弹测试中的应用研究

并行测试技术是将并行处理技术引进自动测试领域形成的一种先进的测试技术和方法,拥有减少测试时间、降低测试成本的强大优势,正成为研究热点之一;首先介绍了并行测试的基本概念,分析对比了几种实现并行测试的软硬件方法及基本结构体系;然后结合导弹传统串行测试方法的不足及未来战场快速测试的要求,设计了一种导弹的网络化并行测试的基本结构;最后,针对并行测试技术在导弹测试中的应用,提出了需要注意的任务调度、死锁预防及并行测试接口设计等几点关键技术和导弹并行测试系统组建原则。     

Parallelization of a dynamic SVD clustering algorithm and its application in information retrieval

We describe an implementation of a parallel document clustering scheme based on latent semantic indexing, which uses singular value decomposition. Given a set of documents, the clustering algorithm is dynamic in the sense that it automatically infers the number of clusters to be output. The parallel version has been implemented on a LAN and on a dual‐core system. Experimental evaluation of the algorithm shows an average speed‐up of 6.22 for the LAN implementation and an average speed‐up of 3.71 for the dual‐core implementation, while still maintaining a precision and recall in the range [0.85, 1]. To put these implementations in the context of information retrieval, we use the parallel clustering algorithm and develop a document similarity search system. The similarity search system shows good performance in terms of precision and recall. Copyright © 2010 John Wiley & Sons, Ltd.     

Does India need to harmonize the law of patent exhaustion and parallel imports?

The amendment of patent law of India in 2005 to fulfill her international obligation under the TRIPS Agreement (World Trade Organization Agreement on Trade Related Intellectual Property Rights) was an outcome of an attempt to balance the competing interests of several stakeholders, including indigenous pharmaceutical companies, multi-national pharmaceutical companies, non-governmental organizations and civil society groups concerned with access to affordable drugs. The adverse consequence of this delicate balancing is introduction of some provisions in the Act whose compatibility with the TRIPS Agreement is questionable, and which therefore are prone to litigations. Section 107A(b) of the amended patent law dealing with parallel imports is one such provision, which, if interpreted word for word could have significant connotations for the rights of a patent owner. This article aims to examine the inconsistencies intrinsic in Section 107A(b) and discusses the divergences in the Indian patent law associated with the doctrine of exhaustion and parallel imports. This article also proposes legal amendments with a view to eliminate inconsistencies intrinsic in the section and enlarge the ambit of the exhaustion principle conceptualized therein, while concurrently remaining compliant with the TRIPS Agreement.     

无约束最优化问题的BFGS并行算法与实现

介绍无约束最优化问题的BFGS算法及其收敛性,提出利用行卷帘格式并行Cholesky分解法、同步并行Wolfe-Powell非线性搜索和并行处理BFGS修正公式来构建BFGS的并行算法,并对该算法的时间复杂性、加速比进行分析。在PC机群数值实验的结果表明,BFGS并行算法提高了无约束最优化问题的求解速度,理论分析与实验结果相一致,并行算法具有线性加速比。     

基于网格的散乱点曲面重构技术

提出一种利用网格技术实现散乱点曲面重构的方法,设计适合网格并行的松耦合分层重构算法,在此基础上研究基于Agent技术的智能任务分解机制和基于Condor-G技术的任务分配与调度策略,并搭建网格实验平台进行测试。对重构结果的分析表明,该技术可提高基于散乱点的曲面重构速度,降低应用成本。