基于PBFT区块链技术的电网企业仓储系统

提出了一种基于实用拜占庭容错(PBFT)算法的区块链技术,首先对传统的实用拜占庭容错算法原理进行了阐述,该传统算法包含前期、需求、预准备、准备、确认、答复6个阶段,但传统算法具有实时性差、缺乏惩罚机制、带宽高的缺点。针对出现的这些问题,又对传统算法进行了改进,具体涉及记账节点、共识过程以及视图切换过程。通过测试进一步证明了该改进算法的实用性,并将该算法应用于电网企业中,构建的虚拟仓库实现了联储联备,降低了库存资金的耗费,并且提高了电网企业库存管理的效率。     

机载通信电台通电老炼检测系统设计与实现

为保证航材备件的完好率，解决仓储机载通信电台长期不通电导致的装备性能下降甚至出现故障的问题，综合运用自动测试、虚拟仪器、面向信号设计等技术，以计算机为核心，以PXI仪器、GPIB仪器为依托，以多种总线接口为纽带，构建了一种可靠性高、通用性好、操作简便、可扩展性强的自动化通电老炼平台。通过在航材仓库中使用，证明该电台老炼检测系统降低了仓储通信电台的失效率，提高了仓储电台的完好率。     

User activities and the heterogeneity of urban space:The case of Dahiyat Al Hussein park

Urban researchers have maintained a constant interest in the complexity and continuity of urban space usage. Some have applied actor–network theory (ANT) to investigate the heterogeneity of spaces and present them through the networks of their users’ activities. However, these accounts are predominantly limited in examining the extent to which these spaces may be heterogeneous when exploring such networks. This paper draws on recent ANT scholarship, which employs an ethnographic research conducted in a main park in a housing project at Dahiyat Al Hussein in Amman, Jordan. The findings describe the complex and unpredictable negotiations that occur within spaces by documenting the varieties and interrelations among user activity networks within this common and shared urban space. This research reveals the extent to which spaces, parks in this case, may be heterogeneous by unpacking their usage. The conclusions and insights assert the necessity of paying attention to design detail and creating designs that are responsive to evolving user activities.     

从数据库到数据仓库——广电未来的制胜武器

在目前数据爆炸、信息匮乏的情况下，需要利用数据仓库系统集成1个或多个独立传统数据库数据，通过分析海量数据发现市场潜在规律，获取商业信息以支持商业决策，这将是广电未来的制胜武器。     

基于数据挖掘的OLAP分析技术及应用

数据仓库和数据挖掘技术是目前信息技术研究的热点问题之一,介绍了数据挖掘(data mining)、数据仓库(datawarehouse)及联机分析处理(OLAP)技术。并以零售业决策支持系统为例,介绍了该系统的体系结构、数据仓库的设计、系统实现关键技术及各子系统功能,着重论述了如何利用OLAP技术实现企业决策支持系统。     

High training set size reduction by space partitioning and prototype abstraction

Instance-based learning methods like the nearest neighbour classifier generally suffer from the indiscriminate storage of all training instances, resulting in large memory requirements and slow execution speed. In this paper, new training set size reduction methods based on prototype generation and space partitioning are proposed. Experimental results show that the new algorithms achieve a very high reduction rate with still an important classification accuracy.     

A space- and time-efficient local-spin spin lock

A simple code transformation is presented that reduces the space complexity of Yang and Anderson's local-spin mutual exclusion algorithm. In both the original and the transformed algorithm, only atomic read and write instructions are used; each process generates Θ(logN) remote memory references per lock request, where N is the number of processes. The transformed algorithm uses Θ(N) distinct variables, which is clearly optimal.     

金属/聚合物复合材料对中能电子的屏蔽作用研究

运用MULASSIS计算程序模拟计算了不同组成的屏蔽材料对空间辐射环境的屏蔽效果,在此基础上进行屏蔽材料的初步设计,并制备了一系列不同组成的金属/聚合物复合材料,结合中能电子照射的实验结果,讨论了组成对金属/聚合物复合材料的屏蔽效果的影响.研究发现,高原子序数和低原子序数金属混合添加的复合物样品具有较好的屏蔽效果.     

非平面对称磁场的空间展开及样条函数表述

为了研究带电粒子光学系统的光学特性,需要知道系统中磁场的空间分布。实际磁场往往不具有严格的平面对称性质,一些作者曾就这类磁场的空间展开做过不少工作。但他们的工作是在柱坐标系统中进行的,适用于诸如回旋加速器、双向聚焦磁分析器、环形磁β谱仪等一类装置的磁场分析。对于大型同位素电磁分离器(calutron)那样一类装置,其磁场分布需要     

Graph‐Theory Approach to Eigenvalue Problem of Large Space Structures

The dynamic analysis and control system design of large space structures involve the solution of the large‐dimensional generalized matrix eigenvalue problem. The computational effort involved is proportional to the third power of the dimension of the matrices involved. To minimize the computational time a graph‐theory approach to reduce a matrix to lower‐ordered submatrices is proposed. The matrix‐reduction algorithm uses the Boolean matrices corresponding to the original numerical matrices and, thus, the computational effort to reduce the original matrix is nominal. The computational savings directly depend upon the number of submatrices into which the original matrix is reduced. A free‐free square plate is considered as an example to illustrate the technique. In this example a matrix of 16th order is reduced to three scalars corresponding to three rigid‐body modes, and three matrices of order three and one matrix of order four.