数字签名技术在医院电子病历中的设计与应用

为推进病历数字化发展,并确保其信息的安全性,将以HIS电子病历系统为基础,采用安信数字签名技术和PKI或PMI系统搭建相信并加以任用的授权服务,经过针对实际的PKC和CA的确认、委托与管控构建整体的数字签名平台,完成电子病历数字签名功能设计,以加强电子文件的完整性、真实性和不可抵赖性。最后以某医院的XML结构化的电子病历系统为基础进行项目实施,完成了医护人员通过HIS的快速身份认证,和准确地数字签名。     

基于测绘地理信息技术的涉地税源风险识别模式应用研究

为解决沧州市涉地税源管理手段单一等问题,文中提出以测绘地理信息技术为支撑,通过对多源数据组织管理,建立风险分析指标,采用多种GIS空间分析方法构建了涉地风险税源识别模式并在沧州进行应用。结果表明:该模式能有效识别多种涉地风险,为涉地税源管理提供了支撑。     

基于光谱尺度空间与管道滤波的红外目标检测

为了准确地从复杂干扰背景下检测出真实弱小目标，本文引入视觉显著性，设计了基于快速光谱尺度空间与动态管道滤波的红外目标检测算法。基于真实目标与背景内容之间的整体差异，引入快速光谱尺度空间与阈值分割技术，设计视觉显著性机制，对红外图像完成处理，输出全局显著性映射，以高效过滤干扰背景内容。考虑目标与背景的局部特征差异，构建自适应局部对比度增强机制，对粗检测结果实施处理，获取对应的局部显著性映射，改善视觉显著性区域内目标的对比度。引入高斯差分理论，通过估算每一帧红外图像中的目标像素直径，形成动态管道滤波，充分消除虚警，准确识别出弱小目标。多组实验数据显示：较已有的红外目标检测技术而言，在各种不同的复杂背景干扰下，所提算法呈现出更好的检测能力，拥有更理想的接收机工作特性ROC曲线。     

WSN低功耗低时延路径式协同计算方法

针对云计算应用于无线传感器网络(Wireless Sensor Network,WSN)时延敏感型业务时存在的高传输时延问题,提出了一种WSN低功耗低时延路径式协同计算方法。该方法基于一种云雾网络架构开展研究,该架构利用汇聚节点组成雾计算层;在数据传输过程中基于雾计算层的计算能力分步骤完成任务计算,降低任务处理时延;由于汇聚节点计算能力较弱,时延降低将导致能耗增加,WSN工作寿命减短,为此提出能耗约束下的任务映射策略,并利用离散二进制粒子群优化(Binary Particle Swarm Optimization,BPSO)算法解决能耗约束下的时延优化问题。仿真结果表明,在相同的能耗约束下,对比其他算法,基于BPSO算法得出的映射方案能有效降低业务处理时延,满足时延敏感型业务的需求。     

Adaptive finite-time tracking control for parameterized nonlinear systems with full state constraints

In this article, the issue of adaptive finite-time dynamic surface control (DSC) is discussed for a class of parameterized nonlinear systems with full state constraints. Using the property of logarithmic function, a one-to-one nonlinear mapping is constructed to transform a constrained system into an unconstrained system with the same structure. The nonlinear filter is constructed to replace the first-order linear filter in the traditional DSC, and the demand on the filter time constant is reduced. Based on finite-time stable theory and using modified DSC, the finite-time controller is designed via DSC. Theoretical analysis shows that all the signals in the closed-loop system are semiglobal practical finite-time stable. Furthermore, none of the states are outside the defined open set. In the end, simulation results are presented to demonstrate the effectiveness of the proposed control schemes with both linear filters and nonlinear filters.     

Improving EBSD precision by orientation refinement with full pattern matching

We present a comparison of the precision of different approaches for orientation imaging using electron backscatter diffraction (EBSD) in the scanning electron microscope. We have used EBSD to image the internal structure of WC grains, which contain features due to dislocations and subgrains. We compare the conventional, Hough-transform based orientation results from the EBSD system software with results of a high-precision orientation refinement using simulated pattern matching at the full available detector resolution of 640 × 480 pixels. Electron channelling contrast imaging (ECCI) is used to verify the correspondence of qualitative ECCI features with the quantitative orientation data from pattern matching. For the investigated sample, this leads to an estimated pattern matching sensitivity of about 0.5 mrad (0.03°) and a spatial feature resolution of about 100 nm. In order to investigate the alternative approach of postprocessing noisy orientation data, we analyse the effects of two different types of orientation filters. Using reference features in the high-precision pattern matching results for comparison, we find that denoising of orientation data can reduce the spatial resolution, and can lead to the creation of orientation artefacts for crystallographic features near the spatial and orientational resolution limits of EBSD.     

Grain mapping to freeform surface for machining using parameter-based incremental tracking method

This paper presents a novel method for mapping a texture for machining onto a freeform surface. When a grain texture designed on a 2D plane is projected onto a freeform surface simply, the texture is distorted along the curvature of the surface in the projection direction. Therefore, a method is required to suppress this distortion. The algorithm proposed in this paper rapidly generates a point cloud that represents a texture with less distortion on a simply connected parametric surface. Specifically, four equations that express local geometry constraints instead of conventional parameterization methods are presented to reduce the distortion between adjacent points on the point cloud. Solving these equations can generate grain textures on freeform surfaces. This paper examines two grain images mapped to two freeform surfaces that were prepared as case studies to demonstrate the effectiveness of the proposed method.     

Cost-based holistic twig joins

An evaluation of XML queries such as XQuery or XPath expressions represents a challenging task due to its complexity. Many algorithms have been introduced to cope with this problem. Some of them, called binary joins, evaluate separated parts of a query and subsequently merge intermediate results, while the others, called holistic twig joins, evaluate a query as a whole. Moreover, these algorithms also differ in what index data structure they use to handle XML data. There exist cost-based approaches utilizing binary joins and various index data structures; however, they share a limitation. The limitation is that they cannot perform a join between query nodes not having a direct XPath relationship. Such a join can be advantageous especially if their joint selectivity is high. Since holistic joins work with all query nodes they overcome this limitation. In this article, we introduce such a holistic twig join called CostTwigJoin. To the best of our knowledge, CostTwigJoin is the first holistic join capable of combining various index data structures during an evaluation of an XML query. Usage of the holistic join has yet another advantage for cost-based approaches: an optimizer does not have to resolve the order of binary joins; therefore, the search space is reduced. In this article, we perform thorough experiments on hundreds of queries to evaluate our approach and demonstrate its advantages.     

Intelligent scheduling of a feature-process-machine tool supernetwork based on digital twin workshop

Modern manufacturing enterprises are shifting toward multi-variety and small-batch production. By optimizing scheduling, both transit and waiting times within the production process can be shortened. This study integrates the advantages of a digital twin and supernetwork to develop an intelligent scheduling method for workshops to rapidly and efficiently generate process plans. By establishing the supernetwork model of a feature-process-machine tool in the digital twin workshop, the centralized and classified management of multiple data types can be realized. A feature similarity matrix is used to cluster similar attribute data in the feature layer subnetwork to realize rapid correspondence of multi-source association information among feature-process-machine tools. Through similarity calculations of decomposed features and the mapping relationships of the supernetwork, production scheduling schemes can be rapidly and efficiently formulated. A virtual workshop is also used to simulate and optimize the scheduling scheme to realize intelligent workshop scheduling. Finally, the efficiency of the proposed intelligent scheduling strategy is verified by using a case study of an aeroengine gear production workshop.