Many application domains are increasingly leveraging service-oriented architecture (SOA) techniques to facilitate rapid system
deployment. Many of these applications are time-critical and, hence, real-time assurance is an essential step in the service
composition process. However, there are gaps in existing service composition techniques for real-time systems. First, admission
control is an essential technique to assure the time bound for service execution, but most of the service composition techniques
for real-time systems do not take admission control into account. A service may be selected for a workflow during the composition
phase, but then during the grounding phase, the concrete service may not be able to admit the workload. Thus, the entire composition
process may have to be repeated. Second, communication time is an important factor in real-time SOA, but most of the existing
works do not consider how to obtain the communication latencies between services during the composition phase. It is clear
that maintaining a full table of communication latencies for all pairs of services is infeasible. Obtaining communication
latencies between candidate services during the composition phase can also be costly, since many candidate services may not
be used for grounding. Thus, some mechanism is needed for estimating the communication latency for composite services. In
this paper, we propose a three-phase composition approach to address the above issues. In this approach, we first use a highly
efficient but moderately accurate algorithm to eliminate most of the candidate compositions based on estimated communication
latencies and assured service response latency. Then, a more accurate timing prediction is performed on a small number of
selected compositions in the second phase based on confirmed admission and actual communication latency. In the third phase,
specific concrete services are selected for grounding, and admissions are actually performed. The approach is scalable and
can effectively achieve service composition for satisfying real-time requirements. Experimental studies show that the three-phase
approach does improve the effectiveness and time for service composition in SOA real-time systems. In order to support the
new composition approach, it is necessary to effectively specify the needed information. In this paper, we also present the
specification model for timing-related information and the extension of OWL-S to support this specification model. 相似文献
In this paper, we develop a method to lower the computational complexity of pairwise nearest neighbor (PNN) algorithm. Our approach determines a set of candidate clusters being updated after each cluster merge. If the updating process is required for some of these clusters, k-nearest neighbors are found for them. The number of distance calculations for our method is O(N2), where N is the number of data points. To further reduce the computational complexity of the proposed algorithm, some available fast search approaches are used. Compared to available approaches, our proposed algorithm can reduce the computing time and number of distance calculations significantly. Compared to FPNN, our method can reduce the computing time by a factor of about 26.8 for the data set from a real image. Compared with PMLFPNN, our approach can reduce the computing time by a factor of about 3.8 for the same data set. 相似文献
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times. 相似文献
This paper introduces a model-based hand gesture recognition system, which consists of three phases: feature extraction,
training, and recognition. In the feature extraction phase, a hybrid technique combines the spatial (edge) and the temporal
(motion) information of each frame to extract the feature images. Then, in the training phase, we use the principal component
analysis (PCA) to characterize spatial shape variations and the hidden Markov models (HMM) to describe the temporal shape
variations. A modified Hausdorff distance measurement is also applied to measure the similarity between the feature images
and the pre-stored PCA models. The similarity measures are referred to as the possible observations for each frame. Finally,
in recognition phase, with the pre-trained PCA models and HMM, we can generate the observation patterns from the input sequences,
and then apply the Viterbi algorithm to identify the gesture. In the experiments, we prove that our method can recognize 18
different continuous gestures effectively.
Received: 19 May 1999 / Accepted: 4 September 2000 相似文献
Watermarking protocols are designed for tracing illegal distributors when unauthorized copies are found. So far, most of the proposed schemes set up two or more watermarks embedded to a copy by the seller before it was sold. The main potential concerns of multiple watermarking are the image quality would be damaged and any earlier embedded watermarks would be destroyed as well. Thanks to visual cryptography which encodes the secret image into two shares, and recovers the secret by collecting these two shares. Therefore, a new buyer-seller watermarking protocol is proposed in this paper by applying the technique of visual cryptography to Lei et al.’s scheme so as to free from the disadvantages of multiple-watermarking insertion.
The local implicit scheme of Reddyet al. is extended to the minmod and third-order upwind TVD schemes. Numerical tests show that the proposed scheme is stable. In addition, it is found that if the flow field has a dominant direction, setting the iteration sweep to align with this direction can significantly improve the converging speed. 相似文献
An improved numerical method, based on a variational approach with isoparametric finite elements, is presented for the solution of the boundary integral equation formulation of three-dimensional fields. The technique provides higher-order approximation of the unknown function over a bounding surface described by two-parameter, non-planar elements. The integral equation is discretized through the Rayleigh–Ritz procedure. Convergence to the solution for operators having a positive-definite component is guaranteed. Kernel singularities are treated by removing them from the relevant integrals and dealing with them analytically. A successive element iterative process, which produces the solution of the large dense matrix of the complete structure, is described. The discretization and equation solution take place one element at a time resulting in storage and computational savings. Results obtained for classical test models, involving scalar electrostatic potential and vector elastostatic displacement fields, demonstrate the technique for the solution of the Fredholm integral equation of the first kind. Solution of the Fredholm equation of the second kind is to be reported subsequently. 相似文献