基于SaaS的矿震远程预警系统关键技术初探

现有的矿震预警系统都是以独立形式运行于各矿区,相互之间没有关联,重复投资严重,且矿震数据海量繁杂,仅依靠现场分析无法满足实时预警需求。文章基于感知矿山物联网示范工程(夹河矿),对采用云计算SaaS模式构建的矿震远程预警系统关键技术进行了相关研究:首先给出了系统整体框架,然后重点探讨了该系统所涉及的三个关键技术,包括基于SaaS的矿震预警专家分析软件架构、多源SaaS数据库构建技术以及基于MapReduce的并发数据过滤接收技术。现场应用表明,所构建的系统已基本具备全国统一远程矿震预警系统的架构,能满足多矿区远程矿震预警的基本要求。     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

分布式计算环境中的协同分配任务调度仿真系统

协同分配是在分布式计算环境中进行资源分配的一种重要技术,用于把一个应用程序分解为多个子作业,然后将其分配到多个资源上同时处理来满足特定的性能要求。本文提出了一个离散事件驱动的网格资源协同分配仿真系统,实现了对用户、调度器、协同分配器、协同预留器等协同分配相关实体的仿真,实现了FCFS、FPFS、Backfill等主要的协同分配调度算法和策略,可用于资源协同分配相关的分布式计算环境的资源管理和调度算法的仿真和研究。     

一种基于多Agent的人群仿真多机并行平台研究

本文提出了一种针对多Agent人群仿真模型的多机并行平台,该平台利用MPI作为节点间的通讯软件,采用主从模式设计多机并行执行环境。在主控节点中设置结果回收模块与监控模块,通过K-means算法保证执行节点之间的负载均衡,同时以此作为任务分发与调度的依据;在执行节点(从节点)中,则根据主控节点的任务调度执行相关Agent模型,并执行仿真同步与状态信息汇报等任务。实验结果表明,该多机并行平台能够执行基于多Agent的人群仿真模型,能有效地提高仿真的性能,同时具有良好的可扩展性。     

Characterization and Reconstitution of Human Lipoyl Synthase (LIAS) Supports ISCA2 and ISCU as Primary Cluster Donors and an Ordered Mechanism of Cluster Assembly

Lipoyl synthase (LIAS) is an iron–sulfur cluster protein and a member of the radical S-adenosylmethionine (SAM) superfamily that catalyzes the final step of lipoic acid biosynthesis. The enzyme contains two [4Fe–4S] centers (reducing and auxiliary clusters) that promote radical formation and sulfur transfer, respectively. Most information concerning LIAS and its mechanism has been determined from prokaryotic enzymes. Herein, we detail the expression, isolation, and characterization of human LIAS, its reactivity, and evaluation of natural iron–sulfur (Fe–S) cluster reconstitution mechanisms. Cluster donation by a number of possible cluster donor proteins and heterodimeric complexes has been evaluated. [2Fe–2S]-cluster-bound forms of human ISCU and ISCA2 were found capable of reconstituting human LIAS, such that complete product turnover was enabled for LIAS, as monitored via a liquid chromatography–mass spectrometry (LC–MS) assay. Electron paramagnetic resonance (EPR) studies of native LIAS and substituted derivatives that lacked the ability to bind one or the other of LIAS’s two [4Fe–4S] clusters revealed a likely order of cluster addition, with the auxiliary cluster preceding the reducing [4Fe–4S] center. These results detail the trafficking of Fe–S clusters in human cells and highlight differences with respect to bacterial LIAS analogs. Likely in vivo Fe–S cluster donors to LIAS are identified, with possible connections to human disease states, and a mechanistic ordering of [4Fe–4S] cluster reconstitution is evident.     

基于数据融合的ABC-SVM社区疾病预测方法

针对现有社区医疗服务中的疾病预测方法存在数据利用率低、疾病分析类型单一、自动化程度差、疾病预测效果不理想等不足,提出在物联网大数据环境下可用于社区医疗的健康数据融合及疾病预测方法. 通过主成分分析(PCA)和聚类分析对社区中居民的生理指标数据进行特征提取;结合人工蜂群(ABC)算法构造支持向量机(SVM)非线性分类器对数据进行特征级融合分析并预测潜在疾病. 实验结果表明,所提方法的疾病识别准确率达到93.10%,相较于传统SVM方法和BP神经网络方法分别提高17.24% 和72.41%. 该方法能够在提高数据利用率、降低计算资源消耗的前提下有效识别多种潜在疾病,可实现疾病早发现、早预防、早治疗;可广泛应用于社区健康管理、老年社区监护甚至临床医疗.     

C JDBC：可扩展的数据库集群中间件

多层软件结构中已经成功地应用了集群,但在后台数据库上还缺乏这种工具,所以当数据库层出现瓶颈时,就得在硬件上花费高额的费用.开源数据库集群中间件--C-JDBC解决了上述问题.它通过JDBC接口引进了一个虚拟数据库,只要基于拥有JDBC驱动的数据库上面的应用程序,程序无须任何改动就能运行.C-JDBC具有灵活的体系结构,支持大型复杂的数据库集群体系结构,为数据库集群提供的高性能、强容错能力、易用的平台.     

基于生物启发计算的警用流动人口分析系统

目前对流动人口的管理仅停留在数据查询比对和简单统计上,缺少对数据的深层次分析,难以对决策指挥提供支持。针对流动人口的分析问题,提出了构建一个基于生物启发计算的智能分析系统,用于发现流动人口中各类人员的流动模式以及流动人口的趋势性问题,找出异常的流动信息和模式。该系统综合运用了前沿的生物启发计算技术——基于多层染色体基因表达式编程算法、重叠基因表达进化算法、基于概念相似度神经网络分类模型和层次距离计算的聚类算法搭建了一个警用流动人口的分析平台。同时根据实际需求,提出了一种新的基于智能分析结果的分级报警模型。实验表明系统具有较高的性能和实用性。     

Fast computation of computer-generated hologram using Xeon Phi coprocessor

We report fast computation of computer-generated holograms (CGHs) using Xeon Phi coprocessors, which have massively x86-based processors on one chip, recently released by Intel. CGHs can generate arbitrary light wavefronts, and therefore, are promising technology for many applications: for example, three-dimensional displays, diffractive optical elements, and the generation of arbitrary beams. CGHs incur enormous computational cost. In this paper, we describe the implementations of several CGH generating algorithms on the Xeon Phi, and the comparisons in terms of the performance and the ease of programming between the Xeon Phi, a CPU and graphics processing unit (GPU).     

Detecting stable locality-aware predicates

In a large-scale locality-driven network such as in modular robotics and wireless sensor networks, knowing the state of a local area is sometimes necessary due to either interactions being local and driven by neighborhood proximity or the users being interested in the state of a certain region. We define locality-aware predicates (LAP) that aim at detecting a predicate within a specified area. We model the area of interest as the set of processes that are within a breadth-first search tree (BFST) of height k$k$ rooted at the initiator process. Although a locality-aware predicate specifies a predicate only within a local area, observing the area consistently requires considering the entire system in a consistent manner. This raises the challenge of making the complexities of the corresponding predicate detection algorithms scale-free, i.e., independent of the size of the system. Since all existing algorithms for getting a consistent view of the system require either a global snapshot of the entire system or vector clocks of the size of the system, a new solution is needed. We focus on stable LAP, which are those LAP that remain true once they become true. We propose a scale-free algorithm to detect stable LAP within a k$k$-height BFST. Our algorithm can detect both stable conjunctive LAP and stable relational LAP. In the process of designing our algorithm, we also propose the first distributed algorithm for building a BFST within an area of interest in a graph, and the first distributed algorithm for recording a consistent sub-cut within the area of interest. This paper demonstrates that LAPs are a natural fit for detecting distributed properties in large-scale distributed systems, and stable LAPs can be practically detected at low cost.