Large-scale service-oriented computing is based on the idea that services from various servers are combined into one distributed application. Referring to a collection of services on one server as a ??service cloud??, the problem investigated in this paper is to define formal high-level specifications of such distributed applications and to enable the location of suitable services for them. Based on the language-independent model of Abstract State Services (AS2s), which serves as a universal integrated model for data and software as services, we extend AS2s by high-level action schemes called ??plots?? as a means to specify permitted sequences of service operations. On these grounds, we develop a model for service mediators, that is, specifications of composed services in which service slots have to be filled by actual services, and investigate matching conditions for slots of mediators and services. For a services to match a slot in a mediator, a (generalised) projection of the mediator must comply with the plot of the service. Furthermore, the service must be semantically adequate, which requires the use of a service ontology. 相似文献
Water Resources Management - The Active River Area (ARA) is a spatial approach for identifying the extent of functional riparian area. Given known limitations in terms of input elevation data... 相似文献
International Journal of Computer Vision - In this paper, we propose a novel continuous latent semantic analysis fitting method, to efficiently and effectively estimate the parameters of model... 相似文献
The Journal of Supercomputing - With the fast growth of big data applications, it has brought about a huge increase in the energy consumption for big data processing in Cloud data centers. In this... 相似文献
Journal of Mathematical Imaging and Vision - Different from the traditional watermarking schemes, zero-watermarking schemes are lossless embedding methods, which are applicable to be used in... 相似文献
We propose a novel online multiple object tracker taking structure information into account. State-of-the-art multi-object tracking (MOT) approaches commonly focus on discriminative appearance features, while neglect in different levels structure information and the core of data association. Addressing this, we design a new tracker fully exploiting structure information and encoding such information into the cost function of the graph matching model. Firstly, a new measurement is proposed to compare the structure similarity of two graphs whose nodes are equal. With this measurement, we define a complete matching which performs association in high efficiency. Secondly, for incomplete matching scenarios, a structure keeper net (SKnet) is designed to adaptively establish the graph for matching. Finally, we conduct extensive experiments on benchmarks including MOT2015 and MOT17. The results demonstrate the competitiveness and practicability of our tracker.
Neural Computing and Applications - Muti-focus image fusion is the extraction of focused regions from different images to create one all-in-focus fused image. The key point is that only objects... 相似文献