基于电子病历的三甲精神专科医院管理平台应用

根据精神专科医院的实际情况提出了以电子病历为核心,整合现有资源、统一集成、信息共享,服务患者的医院综合信息管理解决方案.也为未来实现医疗信息的区域共享打下基础.     

基于通用知识的软件设计安全性评估

安全性作为软件系统的重要属性,越来越受到人们的重视．在软件开发的早期对安全性进行评估,对软件的质量控制和成本控制有着重要意义．当前的软件安全性评估主要依靠专家评审,结果的客观性及准确性常常受到专家主观意见的影响．通过使用通用知识作为评估依据,提出一种可以对UML顺序图形式的软件设计文档进行自动化分析的方法,可以发现软件设计中潜在的安全性漏洞．该方法可以减少结果中的主观性,同时,通过基于该方法的辅助工具的使用,可以大大提高评估效率．     

云计算安全及应用探析

随着云计算的普及和越来越多的云计算产品投入使用,频频爆发的安全事件也呈现在人们眼前,安全问题更加重要并且已经严重制约了其发展。首先对云计算的概念和发展进行了概述,分析了云计算面临的安全威胁,对提出了应对风险的云计算安全防范关键技术,最后对云计算环境下少数民族文化知识服务进行了探讨。     

面向RFID的框架化数据融合中间件研究与设计

介绍了基于数据融合的结构可扩展软件开发框架（xDFF）及其规范体系,在此框架下,主要研究并设计了包括RFID数据资源集成与融合应用平台的建模方法、工具及实现方法,旨在设计一种高效且可扩展的,支持海量RFID数据采集、过滤、聚合、事件管理以及存储、维护、查询和安全管理等功能的环境与工具,实现普遍适配,提供二次开发接口,与企业数据集成并进行统一管理的模块化框架化RFID数据融合中间件产品.     

P2P soft security: On evolutionary dynamics of P2P incentive mechanism

This paper thoroughly investigates the evolutionary dynamics of soft security mechanism, namely, reciprocity-based incentive mechanism, in P2P systems based on Evolutionary Game Theory (EGT). By soft security mechanism, it means social control mechanisms to overcome peers’ selfish (rational) behaviors, and encourage cooperation in P2P systems. Specifically, there exist three strategies in P2P systems: always cooperative (ALLC), always defect (ALLD) and reciprocator (R). Instead of existing work which take it for granted that, like ALLC users, R users did not bear any information-seeking cost, we assume small reciprocation cost, and study generalized mutation-selection dynamics. Our contributions are threefold: firstly, we prove and illustrate that, in a well-mixed P2P structure, ALLD is the only strict Nash equilibrium; secondly, we infer the specific condition under which evolution dynamics exhibits rock-scissors-paper oscillation in a structured P2P population. That is, the population cycles from ALLD to R to ALLC and back to ALLD; finally, we theoretically illustrate that the intensity of selection plays an important role in the evolutionary dynamics of P2P incentive mechanism. That is, when the intensity of selection is relatively weak and reciprocation cost limits to zero, the time average can be mostly concentrated on reciprocator. In brief, considering the existence of reciprocation cost and the small mutation in P2P incentive mechanisms, unlike existing work, it is impossible to simply achieve the “absolute cooperative” in P2P incentive mechanisms. On the other hand, stochastic evolution in P2P incentive mechanism with finite population and network structure still favor reciprocation.     

Separating computation and storage with storage virtualization

Recent advances of hardware, software, and networks have made the management and security issues increasingly challenging in PC usage. Due to the tight coupling of hardware and software, each one of the hundreds or thousands of PCs connected in a networked environment has to be managed and administrated individually, leading to a high Total Cost of Ownership (TCO). We argue that a centralized storage of software and data, while distributed computation in clients, i.e., transparent computing, can address these challenges potentially and reduce the complexity with reduced software maintenance time, improved system availability, and enhanced security.This paper presents a novel approach, named StoreVirt, to realize transparent computing, which separates computation and storage from inside a single physical machine to different machines with a storage virtualization mechanism. With virtualization, all the OSes, applications, and data of clients are centered on the servers and scheduled on demand to run on different clients in a “block-streaming” way. Therefore, due to the central storage of OSes and applications, the installation, maintenance, and management are also centralized, leaving the clients light-weighted. Further, due to timely patching and upgrading, the system security can be improved. Experimental and real-world experiences demonstrate that this approach is efficient and feasible for real usages.     

Predicting the unexpected

Dagstuhl seminar no. 10102 on discrete event logistic systems recognized a network of persistent models to be a “Grand Challenge.” Such on-line model network will offer an infrastructure that facilitates the management of logistic operations. This ambition to create a network of persistent models implies a radical shift for model design activities as the objective is an infrastructure rather than application-specific solutions. In particular, model developers can no longer assume that they know what their model will be used for. It is no longer possible to design for the expected.This paper presents insights in model development and design in the absence of precise knowledge concerning a model's usage. Basically, model developers may solely rely on the presence of the real-world counterpart mirrored by their model and a general idea about the nature of the application (e.g. coordination of logistic operations). When the invariants of their real-world counterpart suffice for models to be valid, these models become reusable and integrate-able. As these models remain valid under a wide range of situations, they become multi-purpose and durable resources rather than single-purpose short-lived components or legacy, which is even worse.Moreover and more specifically, the paper describes how to build models that allow their users to generate predictions in unexpected situations and atypical conditions. Referring to previous work, the paper concisely discusses how these predictions can be generated starting from the models. This prediction-generating technology is currently being transferred into an industrial MES.     

A new DFM approach to combine machining and additive manufacturing

Design for manufacturing (DFM) approaches aim to integrate manufacturability aspects during the design stage. Most of DFM approaches usually consider only one manufacturing process, but product competitiveness may be improved by designing hybrid modular products, in which products are seen as 3-D puzzles with modules realized individually by the best manufacturing process and further gathered. A new DFM system is created in order to give quantitative information during the product design stage of which modules will benefit in being machined and which ones will advantageously be realized by an additive process (such as Selective Laser Sintering or laser deposition). A methodology for a manufacturability evaluation in case of a subtractive or an additive manufacturing process is developed and implemented in a CAD software. Tests are carried out on industrial products from automotive industry.     

Decision support for Cybersecurity risk planning

Security countermeasures help ensure the confidentiality, availability, and integrity of information systems by preventing or mitigating asset losses from Cybersecurity attacks. Due to uncertainty, the financial impact of threats attacking assets is often difficult to measure quantitatively, and thus it is difficult to prescribe which countermeasures to employ. In this research, we describe a decision support system for calculating the uncertain risk faced by an organization under cyber attack as a function of uncertain threat rates, countermeasure costs, and impacts on its assets. The system uses a genetic algorithm to search for the best combination of countermeasures, allowing the user to determine the preferred tradeoff between the cost of the portfolio and resulting risk. Data collected from manufacturing firms provide an example of results under realistic input conditions.     

Buyer-supplier games: Optimization over the core

In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called suppliers, offer various components of the structure for sale. Any combinatorial minimization problem can be transformed into a buyer-supplier game. While most previous work has been concerned with characterizing the core of buyer-supplier games, in this paper we study optimization over the set of core vectors. We give a polynomial time algorithm for optimizing over the core of any buyer-supplier game for which the underlying minimization problem is solvable in polynomial time. In addition, we show that it is hard to determine whether a given vector belongs to the core if the base minimization problem is not solvable in polynomial time. Finally, we introduce and study the concept of focus point price, which answers the question: If we are constrained to play in equilibrium, how much can we lose by playing the wrong equilibrium?