VB与VC优化配合在安全监察软件系统中的应用

安全监察是矿山安全中很重要的环节。利用VC的强大计算功能和VB的编程简单性采用VB与VC优化配合使用的方法开发安全监察软件系统是快速、简单、高效的设计方法。文章对系统的整体结构和信息流程作了简要的介绍，并对系统的每个部分各以一个例子进行简单的阐述。     

人参皂苷Rg分子轨道微扰理论的研究

人参皂苷Rg是具有生理活性的物质，它包括三个异构体：Rg1；Rg2；Rg3其中R83具有很强的抗癌作用。本文通过休克尔分子图形理论对Rg异构体的各分子轨道进行约化，并且根据分子轨道微扰理论求出它们不同本征多项式和本征值。     

压电主动杆位置和增益在随机智能桁架结构振动控制中的优化

对结构物理参数、几何尺寸、作用荷载和控制力同时具有随机性时 ,随机压电智能桁架结构中主动杆的配置位置和闭环控制系统增益进行了优化 ,基于系统最小储存能 ,构建了具有动应力、动位移可靠性约束的主动杆配置和控制增益的优化模型 ;并对结构动力响应的数字特征进行了推导。通过算例 ,验证了该优化配置模型的合理性和有效性 ,获得了若干有意义的结论。     

地震相控非线性随机反演研究与应用

 在地震相模型控制下，通过原始数据将各个单一反演问题转化为一个联合反演问题，可降低反演在描述参数几何形态时的单个反演问题的自由度，从本质上提高地球物理反演的效果。本文在计算过程中采用了非线性随机反演算法，能有效提高地震资料的分辨率，并充分考虑地质条件的随机特性，使反演结果更符合实际地质情况。在胜利、中原油田等地区的储层预测中，应用本文方法均取得了良好的效果，为岩性油气藏勘探提供了可靠基础数据。     

基于特征选择的集成分类器抗噪性能分析

特征选择有助于增强集成分类器成员间的随机差异性,从而提高泛化精度。研究了随机子空间法（RandomSub-space）和旋转森林法（RotationForest）两种基于特征选择的集成分类器构造算法,分析讨论了两算法特征选择的方式与随机差异程度之间的关系。通过对UCI数据集引入噪声,比较两者在噪声环境下的分类精度。实验结果表明：当噪声增加及特征关联度下降时,基本学习算法及噪声程度对集成效果均有影响,当噪声增强到一定程度后。集成效果和单分类器的性能趋于一致。     

Joint spatial registration and multi-target tracking using an extended PM-CPHD filter

An extended product multi-sensor cardinalized probability hypothesis density (PM-CPHD) filter for spatial registration and multi-target tracking (MTT) is proposed. The number and states of targets and the biases of sensors are jointly estimated by this method without the data association. Monte Carlo (MC) simulation results show that the proposed method (i) outperforms, although computationally more expensive than, the extended multi-sensor PHD filter which has been proposed for joint spatial registration and MTT; (ii) outperforms the multi-sensor joint probabilistic data association (MSJPDA) filter which is also extended in this study for joint spatial registration and MTT when the clutter is relatively dense.     

基于JavaScript实现随机数的分组抽取

通过一个随机数的分组抽取小实例,对JavaScript脚本语言做了简要说明,对初学者入门深有裨益。     

SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS

The purpose of this paper is to examine the impact of scheduling parallel tasks onto non-uniform memory access (NUMA) shared-memory multiprocessor systems by considering non-negligible intertask communications and communication contentions. Communication contentions arise from the communication medium having insufficient capacity to serve all transmissions, thereby causing significant contention delays. Therefore, a new scheduling algorithm, herein referred to as the Extended Critical Path (ECP) algorithm is proposed. The proposed algorithm schedules parallel tasks by considering non-negligible intertask communications and the contentions among shared communication resources. Moreover, it ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results demonstrate the superiority of the ECP algorithm over the scheduling algorithms presented in previous literature.     

COMPUTING MAXIMUM CLIQUES OF CIRCULAR ARCS IN PARALLEL*

Given a set S of n proper circular arcs, it is required to identify a largest cardinality subset K[S] of S each two of whose members intersect. This paper describes an optimal parallel algorithm to compute K[S]. The algorithm is not based on any previously known sequential solution, and is designed for the CREW PRAM model of computation. It uses 0(n/logn) processors and runs in O(logn) time. An interesting feature of the algorithm is that it transforms the computational geometric problem at hand, to a problem involving computations on 0-1 matrices, and then transforms the latter back into a ray shooting problem in computational geometry.     

无线传感器网络中d-Hop 2-连通容错支配集的分布式构造算法

无线传感器网络随节点移动组成自我维持的自组织系统,采用连通支配集的虚拟骨干技术可使平面网络系统层次化而简化节点路由、管理和维护。但大规模无线传感器网络的连通支配集节点数目依然庞大,d-hop连通支配集可以大大减小支配集节点数目。另外,由于存在节点失效、链路断裂等无线特性,虚拟骨干网需要具备一定的容错性。在单位圆盘图网络模型中为构建精简且具有容错能力的虚拟骨干网,提出d-hop 2-连通支配集的分布式构造算法,先构造d-hop独立支配集后再连通形成d-hop 2-连通支配集。并从理论和仿真上对算法的复杂度、近似比和算法性能作了进一步探讨和验证。