基于Web Service的电力数据库安全审计系统

由于传统系统在电力数据库安全审计中应用效果不佳,不仅误报率比较高,而且平均响应时间比较长,无法达到预期的审计效果,为此提出基于Web Service的电力数据库安全审计系统。遵循“业务驱动”设计原则构建系统顶层架构,由数据源层、数据存储层、审计功能层、应用交互层四个功能层组成。在系统软件方面,通过平台、系统对接,采集电力企业各业务系统自有数据、外部数据、非直采数据、内部法治数据以及机器学习产生的二次数据,按照不同等级的流程,将分流异常数据进入下一步对应处置流程,确定异常数据安全等级,利用Web Service技术对系统审计交互界面设计,以此完成系统设计。经实验证明,设计系统误报率在1%以内,平均响应时间在3s以内,设计系统在电力数据库安全审计方面具有良好的应用前景。

Dynamic Service Discovery, Composition and Reconfiguration in a Model Mapping Business Process to Web Services

In any organization where SOA has been implemented, all of the web services are registered in UDDI and users’ needs are served by using appropriate web services. So in this paper, we will try to discover a service from repository first that can provide the required output to the user. The process becomes difficult when a single service is not able to fulfill a user’s need and we need a combination of services to answer complex needs of users. In our paper, we will suggest a simpler approach for dynamic service composition using a graph based methodology. This will be a design time service composition. This approach uses the functional and non-functional parameters of the services to select the most suitable services for composition as per user’s need. This approach involves “service classification” on the basis of functional parameters, “service discovery” on the basis of user’s need and then “service composition” using the selected services on the basis of non-functional parameters like response time, cost, security and availability. Another challenge in SOA implementation is that, once the composition has performed, some services may become faulty at runtime and may stop the entire process of serving a user’s need. So, we will also describe a way of “dynamic service reconfiguration” in our approach that will enable us to identify and replace a faulty service that is violating the SLA or is not accessible anymore. This service reconfiguration is done without redoing or reconfiguring the entire composition. In the end, to simulate the proposed approach, we will represent a prototype application built on php 5.4 using My SQL database at backend.

基于Web Service的数字图书馆资源共建共享模型

文章首先讨论了3种数字资源共享模型,接着提出了一种基于Web Service技术的数字图书馆资源共建共享模型系统。该模型以Web Service作为通信协议,以DC元数据抽象的序列化对象作为交互单元,以XML文件进行传输。文章最后对几种系统进行了比较,阐述了今后研究方向。

基于Web Service的分布式电网营销数据共享方法

分布式电网营销数据具有大规模、多源多端口、多方参与的特点,为了提高电网营销数据协作能力,提出基于Web Service的分布式电网营销数据共享方法。基于多个综合能源联供型微网调度模式下的电网营销数据统计分析模型,采用Web Service构架模式,构建分布式电网营销数据的分散控制模型。通过适用性分析与模型测度分析,实现分布式电网营销数据的调度和信息融合。通过综合指数衡量,实现大规模多端口分布式电网营销数据共享调度。测试结果表明:采用该方法进行分布式电网营销数据共享的融合度较高,平均数据融合度高于0.9,提高了分布式电网营销数据共享水平。该方法能够解决大规模多端口电网营销数据调度问题,实现高效、实时、安全的电网营销数据共享。

Hybridizing Artificial Bee Colony with Bat Algorithm for Web Service Composition

In the Internet of Things(IoT),the users have complex needs,and the Web Service Composition(WSC)was introduced to address these needs.The WSC’s main objective is to search for the optimal combination of web services in response to the user needs and the level of Quality of Services(QoS)constraints.The challenge of this problem is the huge number of web services that achieve similar functionality with different levels of QoS constraints.In this paper,we introduce an extension of our previous works on the Artificial Bee Colony(ABC)and Bat Algorithm(BA).A new hybrid algorithm was proposed between the ABC and BA to achieve a better tradeoff between local exploitation and global search.The bat agent is used to improve the solution of exhausted bees after a threshold(limits),and also an Elitist Strategy(ES)is added to BA to increase the convergence rate.The performance and convergence behavior of the proposed hybrid algorithm was tested using extensive comparative experiments with current state-ofthe-art nature-inspired algorithms on 12 benchmark datasets using three evaluation criteria(average fitness values,best fitness values,and execution time)that were measured for 30 different runs.These datasets are created from real-world datasets and artificially to form different scale sizes of WSC datasets.The results show that the proposed algorithm enhances the search performance and convergence rate on finding the near-optimal web services combination compared to competitors.TheWilcoxon signed-rank significant test is usedwhere the proposed algorithm results significantly differ fromother algorithms on 100%of datasets.

Neighborhood Search Based Improved Bat Algorithm for Web Service Composition

Web services are provided as reusable software components in the services-oriented architecture.More complicated composite services can be combined from these components to satisfy the user requirements represented as a workflow with specified Quality of Service(QoS)limitations.The workflow consists of tasks where many services can be considered for each task.Searching for optimal services combination and optimizing the overall QoS limitations is a Non-deterministic Polynomial(NP)-hard problem.This work focuses on the Web Service Composition(WSC)problem and proposes a new service composition algorithm based on the micro-bats behavior while hunting the prey.The proposed algorithm determines the optimal combination of the web services to satisfy the complex user needs.It also addresses the Bat Algorithm(BA)shortcomings,such as the tradeoff among exploration and exploitation searching mechanisms,local optima,and convergence rate.The proposed enhancement includes a developed cooperative and adaptive population initialization mechanism.An elitist mechanism is utilized to address the BA convergence rate.The tradeoff between exploration and exploitation is handled through a neighborhood search mechanism.Several benchmark datasets are selected to evaluate the proposed bat algorithm’s performance.The simulation results are estimated using the average fitness value,the standard deviation of the fitness value,and an average of the execution time and compared with four bat-inspired algorithms.It is observed from the simulation results that introduced enhancement obtains significant results.

基于Web Service的高校人事信息管理系统

为提升人事管理中信息的安全性,引进Web Service,以某高校为例,对人事信息管理系统的开发展开全面的设计研究。系统中的主要硬件设备包括Web应用程序服务器、数据库服务器、负载平衡服务器、内部网络交换机以及路由器等,根据系统设计需求,进行Web应用程序服务器的选型。实验表明:设计的系统在实际应用中,可以避免信息在传输、共享、导出、录入等过程中发生异常现象,全面保障校内人事信息流通的安全性。

Research on web service wrapping for command line programs

A web service wrapping approach for command line programs,which are commonly used in scientific computing,is proposed.First,software architecture for a basic web service wrapper implementation is given and the functions of the main components are explained.Then after a comprehensive analysis of data transmission and a job life cycle model,a novel proactive file transmission and job management mechanism is devised to enhance the software architecture,and the command line programs are wrapped into web services in such a way that they can efficiently transmit files,supply instant status feedback and automatically manage the jobs.Experiments show that the proposed approach achieves higher performance with less memory usage compared to the related work, and the usability is also improved.This work has already been put into use in a production system of scientific computing and the data processing efficiency of the system is greatly improved.

A Formal Model for BPEL4WS Description of Web Service Composition

Communicating Sequential Processes （CSP） is a kind of process algebra, which is suitable for modeling and verifying Web service composition. This paper describes how to model Web service composition with CSP. A set of rules for translating composition constructor of Business Process Execution Language for Web Services （BPEL4WS） to CSP notations is defined. According to the rules that have been defined, the corresponding translation algorithm is designed and illustrated with examples . The methods for model checking, model verification and model simulation are also introduced.

Business domain oriented AI planning for web service composition

In order to improve the effectiveness of the artificial intelligence （AI） planning based web service composition problem, a business domain oriented AI planning algorithm for web service composition is introduced. The algorithm uses the proposed business relation model to minimize the searching space and uses the proposed goal distance as a heuristic rule. Compared with other algorithms tackling web service composition such as AI planning, the proposed algorithm focuses not only on how to convert the web service composition problem to the AI planning problem, but also exerts its effort on how to apply the business feature of web service composition into planning in order to improve the effectiveness. The experiment shows the better performance of the proposed algorithm.

Typed formal model for WS-CDL specification of web services composition

In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL（web services choreography description language）for WS-CDL specifications is proposed.In typed Abstract WS-CDL,the syntax of type and session,typing rules and operational semantics are formalized;the collaborations of web services are formally described by sessions;the operational semantics of a session can help to formally reason the execution of the choreography;the typing rules can help to formally check the data type consistency of exchanged information between web services and capture run-time errors due to type mismatches.Particularly,the concepts of type assumption set extension and type assumption set compatibility are proposed,and the merging algorithm of type assumption sets is defined so as to eliminate type assumption conflict.Based on the formal model,typed mapping rules for mapping web services choreography to orchestration is also defined.With the typed mapping rules,orchestration stubs and their type assumption sets can be generated from a given choreography; thus, web services composition can be verified at choreography and orchestration levels,respectively.The model is proved to have properties of type safety,and how the model can help to reason and verify web services composition is illustrated through a case study.

Development of a Smart Technique for Mobile Web Services Discovery

Web service(WS)presents a good solution to the interoperability of different types of systems that aims to reduce the overhead of high processing in a resource-limited environment.With the increasing demand for mobile WS(MWS),the WS discovery process has become a significant challenging point in the WS lifecycle that aims to identify the relevant MWSs that best match the service requests.This discovery process is a resource-consuming task that cannot be performed efficiently in a mobile computing environment due to the limitations of mobile devices.Meanwhile,a cloud computing can provide rich computing resources for mobile environments given its unlimited and easily scalable resources.This paper proposes a semantic WS discovery and invocation framework in mobile environments based on cloud and a relationship-aware matchmaking algorithm.The discovery algorithm enriches MWS and user requests semantically with the functional and non-functional properties of Ontology Web Language for Services,such as Quality of Web Service,device context,and user preferences.The WS repository is filtered based on logical reasoning and a parameter-based matching algorithm to minimize the matching space and improve runtime performance.The cosine similarity between the user request and services repository is then assessed to generate the most relevant WS.The relationships among concepts in the ontology are considered to improve the recall and precision ratio.After the WS discovery process,users can invoke and test these services in a mobile environment through a dynamic user interface.The interface of the invocation process is changed according to the WS description document.An application prototype is also developed to evaluate the framework based on a Cordova cross-mobile development framework.

Reachability analysis of web service compositions via NWA

In order to improve the design and implementation quality of web service compositions,formal methods are used to model them and certain properties are verified.WCFA （web service interface control flow automata）is used to model web services,especially the control flow and possible interactions with other web services.A web service composition consists of a set of interacting WCFA.The global behavior of web service compositions is captured by NWA（nested word automata）.A variation of the depth-first search algorithm is used to transform a set of WCFA into an NWA.State formulae and call stacks at each node of NWA are computed by a path-sensitive reachability analysis.Safety properties,call stack inspection properties and pre/post-conditions of service invocations are described by assertions.Then verification of these assertions is carried out by an automated SAT tool.

Web services composition with QoS bound based on simulated annealing algorithm

In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.

Web service based spatial forest information system using an open source software approach

For technical and other reasons there is a dilemma that data providers cannot find an appropriate way to redistribute spatial forest data and data users who need spatial data cannot access and integrate available forest resources information. To overcome this dilemma, this paper proposed a spatial forest information system based on Web service using an open source software approach. With Web service based architecture, the system can enable interoperability, integrate Web services from other application servers, reuse codes, and shorten the development time and cost. At the same time, it is possible to extend the local system to a regional or national spatial forest information system. The growth of Open Source Software （OSS） provides an alternative choice to proprietary software for operating systems, web servers, Web-based GIS applications and database management systems. Using open source software to develop spatial forest information systems can greatly reduce the cost while providing high performance and sharing spatial forest information. We chose open source software to build a prototype system for Xixia County, Henan Province, China. By integrating OSS packages Deegree and UMN MapServer which are compliant to the OGC open specifications, the prototype system enables users to access spatial forest information and travelling information of Xixia County which come from two different data servers via a standard Web browser and promotes spatial forest information sharing.

Capability matchmaking of semantic web services with preconditions and effects

In order to solve the problem that the current matchmaking methods for semantic web service mainly focus on the matchmaking of IO （inputs, outputs） descriptions which may result in one-sidedness, a description-logic-based IOPE （inputs, outputs, preconditions, effects） description and matchmaking method is proposed for semantic web service. The description logic concept is used to annotate service IO and the description logic assertion is employed to describe service PE（preconditions, effects）. TBox subsumption checking is used to measure the subsumption relationship between IO descriptions of service request and advertising; ABox consistency checking is used for checking the logical implication between PE descriptions of service request and advertising. Based upon the logical implication, four kinds of PE matching degrees are proposed to measure and compare the pros and cons of the results of matchmaking. They are the exact, perfect, side-effect and common match. Experiments show that the method has a higher precision rate under the same recall rate compared with the existing method.

Task-oriented web service discovery algorithm using semantic similarity for adaptive service composition

In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition （TWC） graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.

Reducing semantic bias of annotations for semantic web service discovery

In order to improve the effectiveness of semantic web service discovery, the semantic bias between an interface parameter and an annotation is reduced by extracting semantic restrictions for the annotation from the description context and generating refined semantic annotations, and then the semantics of the web service is refined. These restrictions are dynamically extracted from the parsing tree of the description text, with the guide of the restriction template extracted from the ontology definition. New semantic annotations are then generated by combining the original concept with the restrictions and represented via refined concept expressions. In addition, a novel semantic similarity measure for refined concept expressions is proposed for semantic web service discovery. Experimental results show that the matchmaker based on this method can improve the average precision of discovery and exhibit low computational complexity. Reducing the semantic bias by utilizing restriction information of annotations can refine the semantics of the web service and improve the discovery effectiveness.

Web services selection based on semantic similarity

Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service selection method based on semantic similarity is proposed. First, this method defines a web services ontology including QoS and context as semantic supporting, which also provides a set of terms to describe the interfaces of web services. Secondly, the similarity degree of two web services is evaluated by computing the semantic distances of those terms used to describe interfaces. Compared with existing methods, interfaces of web services can be interpreted under ontology, because it provides a formal and semantic specification of conceptualization. Meanwhile, efficiency and accuracy of services selection are improved.

A Service Design Oriented Web Services Composite Platform

In order to realize flexible, adaptable, extensible, efficient, and user-friendly service composition, we propose a service design oriented Web Service composite platform （SDOWSCP） and a service composition mechanism called composed-service-requestor-orient ed service composition （OBSDOSC）. SDOWSCP imports ontology into UDDI to define and annotate services in a flexible and intuitive manner and employs a concept of bond as a solution to the process heterogeneity. OBSDOSC is proposed in order to do some efforts to overcome some defects which current design tools usually have such as not user friendly and too professional. This paper proposes a pattern which describes the basic features of semi-automatic composite mode, discusses the whole lifetime of composed service and highlights how to lessen the descriptive heterogeneity and process heterogeneity and how to facilitate the design of composing a service.