目的:目前全国各医疗卫生单位信息化建设步调不一,信息化程度也大不相同.但医院信息化建设的重心都是由基础建设向运维保障转变.考虑到各医疗机构信息化发展现状,运维保障工作主要面临安全机制差,被动响应,定位不清,排查困难,运维工具落后等困境.方法:利用IPMI、SNMP、Agent、WMI等技术,采用了堡垒机、事前预警、清晰定位、自适应知识库等方案.结果:既保证了系统的绝对安全,又实现了对网络状况、交换机、服务器、HIS业务、LIS业务、PACS业务、数据库、动力环境等的管理和监控.结论:提出的安全智能综合运维管理系统从实际出发,很好地解决了目前存在的问题.

本文基于对慢病管理模式(CCM)的概况研究,从优势、劣势、机会、威胁四方面入手,结合国内新医改背景,对新型慢病管理模式在社区推行及应用前景开展SWOT分析,明确新型慢病管理模式发展的目标、特点、人才和技术支撑需求及政策支持等,以期促进国内新型慢病管理模式的形成及慢病管理工作的发展.

In this paper, we introduce a new way of certifying assembly programs. Unlike previous program logics, we extract the control-flow information from the code and generate an intermediate trail between the specification and the real code. Trails are auxiliary specifications and treated as modules in the certification process. We define a simple modular program logic called trail-based certified assembly programming (TCAP) to certify and link different parts of a program using the corresponding trails. Because the control flow information in trails is explicit, the rules are easier to design. We show that our logic is powerful enough to prove partial correctness of assembly programs with features including stack-based abstractions and self-modifying code.We also provide a semantics for TCAP and prove that the logic is sound with respect to the semantics.

Compiling a Java program into native executable file statically is an alternative way of using Java VM(Virtual Machine) to mna Java. program dynamically. This paper introduces an algorithm to implement Java exception mechanism in a Java static compiler, and presents the implementation of this algorithm based on the Java Open64 open source compiler. The effectiveness of this algorithm is proved by the test with SPECjvm98 testsuite.

Safety of the software is getting more and more important.One of the hot researches is the verification method for software to satisfy its safety policy.And the safety verification of the pointer programs is especially difficult to deal with.On the basis of our framework for the design and verification of safe program,and the PointerC pointer logic,this paper mainly introduces our research on an assembly pointer logic system for the assembly pointer programs.And the soundness of the assembly pointer logic has been proved using the proof assistant Coq.Moreover,using an implemented prototype,many non-trivial assembly pointer programs with shared mutable data structures such as list and tree have been verified.

The safety of pointer programs is an important issue in high-assurance software design, and their verification remains a major challenge. Pointer Logic has been proposed to verify basic safety properties of pointer programs in our previous work, but still lacks support for a wide range of pointer programs. In this work, we present an extension to Pointer Logic by: 1) introducing modular reasoning to scale better on programs involving function calls; 2) allowing pointer arithmetic to take more advantage of pointers in programming. Moreover, to demonstrate that Pointer Logic is a useful approach to verification, we implement a tool - pice to automatically verify a range of non-trivial programs, including basic operations on singly-linked lists, trees, circular doubly-linked list, dynamic arrays etc.