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

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

On recommendation problems beyond points of interest

Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead.     

GOS+MU:一种查询对象选择新方法

在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。     

Learning keyword phrases from query logs of USPTO patent examiners for automatic query scope limitation in patent searching

Professional search in patent repositories poses several unique challenges. One key requirement is to search the entire affected space of concepts, following well-defined procedures to ensure traceability of results obtained. Several techniques have been introduced to enhance query generation, preferably via automated query term expansion, to improve retrieval effectiveness. Currently, these approaches are mostly limited to computing additional query terms from patent documents based on statistical measures. For conceptual search to solve the limitation of traditional keyword search standard dictionaries are used to provide synonyms and keyword phrases for query refinement. Studies show that these are insufficient in such highly specialized domains. In this paper, we present an approach to extract keyword phrases from query logs created during the validation procedure of the patent applications. This creates valuable domain-specific lexical databases for several specific patent classes that can be used to both expand as well as limit the scope of a patent search. This provides a more powerful means to guide a professional searcher through the search process. We evaluate the lexical databases based on real query sessions of patent examiners.     

自动生成XML测试脚本的类测试

针对手工编写测试脚本工作量大且容易出错的问题，提出了以XML文档描述测试脚本，利用DOM技术自动生成测试脚本的方法。在此基础上，设计了一个类测试框架，并用一个实例描述了其具体的流程。     

结合RDF实现对XML文档的RBAC

文章提出了一种面向XML文档的基于XMLschema并结合RDF的访问控制模型,它实现了对XML文档的细粒度的安全访问控制,同时提供了对XML文档中associationsecurityobject的安全访问控制。     

用JSP技术实现XML方案

介绍了网络应用中的XML、JSP及其二者相结合的技术，讨论了在JSP中使用XML数据源的方法和如何使用JSP生成XML数据格式。     

基于ERP系统的电子商务平台的分析

提出了利用DNA和XML技术构建基于ERP系统的电子商务平台的解决方案，并且给出了数据接口的几种实现方式。     

标识化语言的发展及在电子物流中的应用

重点阐述了XML技术的发展和对EDI技术的有效补充与改进，并展望基于XML技术的电子商务物流数据交换技术的发展前景。