国家电网边缘计算应用安全风险评估研究

依据国家网络安全等级保护与风险评估系列标准以及电力信息系统特点,提出国家电网边缘计算应用安全的风险评估模型,然后采用漏洞扫描工具AWVS、AppScan分别对集成最新安全漏洞的开源Web应用靶机软件BWAPP进行安全漏洞评测与风险评估实验,再运用模糊层次分析法对Web应用安全进行综合安全评价。针对应用程序的安全检测实验结果整理安全评估数据,实现对国家电网边缘计算应用安全风险评估的实例化验证。     

Web Service模型现存问题的研究

本文通过研究Web Service的相关技术．对现存的模型和技术提出了新的问题和看法．并且在实践基础上提出了新的Web Service安全应用模型，并将此模型应用于信息服务的共享，查询．安全等各个方面，尤其Web Service的安全方面提出了自己的设想．通过三层认证方式．对手Web Service模型中现存的不安全因素进行了相应的改进．并取得了—定成果。     

航空订票业务的Web服务建模及组合兼容性验证

Web服务通过组合基本服务为解决复杂问题提供了方法,于是近年来越来越受到关注。当前交互式下的Web服务在实际组合中还存在诸多问题,其中就包括Web服务组合验证问题。运用Pi演算对航空订票业务的Web服务进行形式化建模,改进基于Pi演算的推理,提供一种验证多个Web服务组合是否兼容的方法。为证实该验证方法,进一步采用MWB工具展示了Web服务组合兼容性的验证过程。     

基于Petri网的Web服务组合与分析

Web服务为互联网提供了一种新的应用环境。然而,Web服务还有许多需要进一步研究的问题。Web服务的组合及其验证就是需要深入研究的问题。本文针对通用构件描述语言（UCDL）提出一种Petri网模拟和验证方法,即对于Web服务的元活动和构件,提出相应的Petri网模型和建模方法。在此基础上进一步研究了Web服务系统Petri网的语言表达式生成算法,从而为Web服务系统的验证分析提供了有效工具。     

面向跨企业多方协同应用的Web服务安全模型

现有的Web服务安全工具仅提供单个服务的安全策略配置功能,忽略了业务流程层面的安全需求。为此,提出一种面向跨企业多方协同应用的Web服务安全模型,将Web服务安全建模、部署与监控过程,融合到企业业务流程管理过程中。在此基础上构造基于Secure-WSCDL的建模工具、转换工具和监控工具,实现SOA架构下业务模型与安全建模在软件工程生命周期中的同步。通过简化的国际贸易进出口流程实例,验证了该模型与相应工具的有效性。     

基于角色的访问控制在WFPN模型中的实现

大多数现存工作流系统缺乏如验证、网络安全等基本安全服务，本文研究了基于角色的访问控制并应用于WFPN模型：首先定义了扩展的RBAC模型及WFPN模型，然后描述了安全机制的实现过程，最后采用COTS技术来实现我们的系统结构。     

基于Delphi和ANN的网络安全综合评价方法研究

网络安全评价是一复杂的系统工程，现有的安全评估工具大都只是用于对网络系统安全漏洞进行扫描、检测。为了对网络安全进行综合评价，必须要运用系统工程的思想和方法。文中采用德尔菲法（Ddphi）对影响网络安全的各种因素进行了深入研究。确立了网络安全综合评价指标体系，提出了人工神经网络（ANN）安全评价模型，并进行了计算机仿真试验。结果表明，这一模型能有效地对网络安全等级进行综合评价，从而为全面评价计算机网络安全状况提供了新的思路和方法。     

改进属性证书和WSDL的Web Services授权机制

Web Services使得基于XML技术的分布式计算成为可能，它被看作是将会替代现存的诸如CORBA、Java RMI和DCOM等旧的分布式应用解决方案的一种新兴技术。Web Services应用中的最为基本的问题就是Web Services的安全问题，它是诸多需要被解决的问题中的最为重要的部分，所以保障用户的验证、授权、信息的机密性、完整性和不可否认性就显得十分必要了。论文中，通过引进Web Services属性证书和对WSDL进行扩展的方法为Web Services用户提供了一种行之有效的用户授权方法。     

现代网络WSE软件安全模型的分析与应用

针对现代网络安全,本文系统分析研究了WSE安全模型,在此模型中,根据不同的场景、采用不同的技术保证SOAP消息的机密性和完整性,同时利用SOAP头验证身份以便控制对Web服务的访问,从而保证了Web Services的安全。本文还对其典型应用进行了研究。     

用扫描工具加强校园网的安全

校园网的广泛使用为学校教育信息化铺平了道路,同时信息安全问题也日益突出,黑客和恶意代码正不断威胁着校园网的安全。本文首先介绍了扫描工具及其功能,通过扫描工具在校园网上的应用实例说明扫描工具可以加强校园网络安全。     

Local path planning using a new artificial potential function composition and its analytical design guidelines

This paper presents a new framework for path planning based on artificial potential functions (APFs). In this scheme, the APFs for path planning have a multiplicative and additive composition between APFs for goal destination and APFs for obstacle avoidance, unlike conventional composition where the APF for obstacle avoidance is added to the APF for goal destination. In particular, this paper presents a set of analytical guidelines for designing potential functions to avoid local minima for a number of representative scenarios based on the proposed framework for path planning. Specifically the following cases are addressed: (i) a non-reachable goal problem (a case in which the potential of the goal is overwhelmed by the potential of an obstacle), (ii) an obstacle collision problem (a case in which the potential of the obstacle is overwhelmed by the potential of the goal) and (iii) a narrow passage problem (a case in which the potential of the goal is overwhelmed by the potential of two obstacles). The example results for each case show that the proposed scheme can effectively construct a path-planning system with the capability of reaching a goal and avoiding obstacles despite possible local minima.     

Approximation by fat arcs and fat biarcs

A general discussion of the including approximation of a curve by a fat arc is given followed by an algorithm for constructing an including fat arc for a parametric Bézier curve. An example of applying the algorithm is given. The results for a fat arc are then used to develop an including approximation for a curve segment using a fat biarc. An algorithm for a fat biarc including approximation is provided followed by examples of Bézier curves being included by a fat biarc.     

Reliable detection and separation of components for solid objects defined with scalar fields

The detection of the number of disjoint components is a well-known procedure for surface objects. However, this problem has not been solved for solid models defined with scalar fields in the so-called implicit form. In this paper, we present a technique which allows for detection of the number of disjoint components with a predefined tolerance for an object defined with a single scalar function. The core of the technique is a reliable continuation of the spatial enumeration based on the interval methods. We also present several methods for separation of components using set-theoretic operations for further handling these components individually in a solid modelling system dealing with objects defined with scalar fields.     

Compact disc standards: an introductory overview

The success of the compact disc (CD) as a storage medium for digital audio has, over the last ten years, resulted in a number of initiatives to use the CD for other applications as well, e.g., as read-only memory for computers, as a storage medium for audio-visual material for multimedia applications, and as a storage medium for photographs. Each of these applications poses additional requirements on how the corresponding information is stored and retrieved, resulting in a range of different CD standards. The functional specifications of these standards are each given a specific color for ease of reference: the Red Book for CD-DA, the Yellow Book for CD-ROM, the Green Book for CD-I, etc. This paper aims at giving an overview of the various CD standards by explaining what is specified in each of the colored books and by indicating how they relate to one another.     

LIY: learn-it-yourself software interfaces

An increasing number of people are becoming users of unfamiliar software. They can be genuinely "new" computer users or part of a growing group who are transferring skills and knowledge from a familiar product such as a word processor to a functionally similar, but different, unfamiliar one. The problem for users in this position is that they do not have access to training courses to teach them how to use such software and are usually forced to rely on text-based documentation. LIY is a method for producing computer-based tutorials to teach the user ofasoftware product.This paper describes how LIY is, in turn, (1) a method for application system design which recognizes the need for tutorial design (a task analysis and user interface specification provide information structures that are passed to the tutorial designer); (2) a support environment for the tutorial designer (in addition to prompting for courseware for nodes in the task analysis, LIY provides a ready-made rule base for constraining the degree of learner control available while the tutorial is in use. The designer is able to tailor this rule base for a specific tutorial); and (3) a tutorial delivery environment (the tutorial adapts to individual learners and offers a degree of learner control).     

Power and sample size requirements for non-inferiority in studies comparing two matched proportions where the events are correlated

Consider clustered matched-pair studies for non-inferiority where clusters are independent but units in a cluster are correlated. An inexpensive new procedure and the expensive standard one are applied to each unit and outcomes are binary responses. Appropriate statistics testing non-inferiority of a new procedure have been developed recently by several investigators. In this paper, we investigate power and sample size requirement of the clustered matched-pair study for non-inferiority. Power of a test is related primarily to the number of clusters. The effect of a cluster size on power is secondary. The efficiency of a clustered matched-pair design is inversely related to the intra-class correlation coefficient within a cluster. We present an explicit formula for obtaining the number of clusters for a given cluster size and the cluster size for a given number of clusters for a specific power. We also provide alternative sample size calculations when available information regarding parameters are limited. The formulas can be useful in designing a clustered matched-pair study for non-inferiority. An example for determining sample size to establish non-inferiority for a clustered matched-pair study is illustrated.     

Finite horizon planning for a production system with permitted shortage and fixed-interval deliveries

Raw material ordering policy and the manufacturing batch size for frequent deliveries of finished goods for a finite horizon plays a significant role in managing the supply chain logistics economically. This research develops an ordering policy for raw materials and determines an economic batch size for a product in a manufacturing system that supplies finished products to customers for a finite planning horizon. Fixed quantities of finished products are delivered to customers frequently at a fixed interval of time. In this model, an optimal multi-ordering policy for procurement of raw materials and production cycle time for a two-stage production and supply system is developed to minimize the total cost incurred due to raw materials and finished goods inventories. The problem is then extended to compensate for the lost sales of finished products. A closed-form solution to the problem is obtained for the minimal total cost. A lower bound on the optimal solution is also developed for problem with lost sale. It is shown that the solution and the lower bound are consistently tight.     

Toward Fine-grained Image Retrieval with Adaptive Deep Learning for Cultural Heritage Image

Fine-grained image classification is a challenging research topic because of the high degree of similarity among categories and the high degree of dissimilarity for a specific category caused by different poses and scales. A cultural heritage image is one of the fine-grained images because each image has the same similarity in most cases. Using the classification technique, distinguishing cultural heritage architecture may be difficult. This study proposes a cultural heritage content retrieval method using adaptive deep learning for fine-grained image retrieval. The key contribution of this research was the creation of a retrieval model that could handle incremental streams of new categories while maintaining its past performance in old categories and not losing the old categorization of a cultural heritage image. The goal of the proposed method is to perform a retrieval task for classes. Incremental learning for new classes was conducted to reduce the re-training process. In this step, the original class is not necessary for re-training which we call an adaptive deep learning technique. Cultural heritage in the case of Thai archaeological site architecture was retrieved through machine learning and image processing. We analyze the experimental results of incremental learning for fine-grained images with images of Thai archaeological site architecture from world heritage provinces in Thailand, which have a similar architecture. Using a fine-grained image retrieval technique for this group of cultural heritage images in a database can solve the problem of a high degree of similarity among categories and a high degree of dissimilarity for a specific category. The proposed method for retrieving the correct image from a database can deliver an average accuracy of 85 percent. Adaptive deep learning for fine-grained image retrieval was used to retrieve cultural heritage content, and it outperformed state-of-the-art methods in fine-grained image retrieval.     

Properties and convergence of a posteriori probabilities in classification problems

This report investigates the behavior of the a posteriori probabilities for classification problems in which the observations are not identically distributed. Some basic properties of the a posteriori probabilities are presented; then, it is shown that for each class the a posteriori probability converges a.s. to a random variable. Conditions are given for a.s. convergence of the a posteriori probability to 1 for the true class (and to 0 for all other classes).The results are illustrated for the case of two classes and binary observations, and finally a numerical example is presented.