A personalized trustworthy service selection method

A personalized trustworthy service selection method is proposed to fully express the features of trust, emphasize the importance of user preference and improve the trustworthiness of service selection. The trustworthiness of web service is defined as customized multi-dimensional trust metrics and the user preference is embodied in the weight of each trust metric. A service selection method combining AHP （analytic hierarchy process） and PROMETHEE （preference ranking organization method for enrichment evaluations） is proposed. AHP is used to determine the weights of trust metrics according to users＇ preferences. Hierarchy and pairwise comparison matrices are constructed. The weights of trust metrics are derived from the highest eigenvalue and eigenvector of the matrix. to obtain the final rank of candidate services. The preference functions are defined according to the inherent characteristics of the trust metrics and net outranking flows are calculated. Experimental results show that the proposed method can effectively express users＇ personalized preferences for trust metrics, and the trustworthiness of service ranking and selection is efficiently improved.

WEB SERVICE SELECTION ALGORITHM BASED ON PRINCIPAL COMPONENT ANALYSIS

Existing Web service selection approaches usually assume that preferences of users have been provided in a quantitative form by users. However, due to the subjectivity and vagueness of preferences, it may be impractical for users to specify quantitative and exact preferences. Moreover, due to that Quality of Service (QoS) attributes are often interrelated, existing Web service selection approaches which employ weighted summation of QoS attribute values to compute the overall QoS of Web services may produce inaccurate results, since they do not take correlations among QoS attributes into account. To resolve these problems, a Web service selection framework considering user's preference priority is proposed, which incorporates a searching mechanism with QoS range setting to identify services satisfying the user's QoS constraints. With the identified service candidates, based on the idea of Principal Component Analysis (PCA), an algorithm of Web service selection named PCA-WSS (Web Service Selection based on PCA) is proposed, which can eliminate the correlations among QoS attributes and compute the overall QoS of Web services accurately. After computing the overall QoS for each service, the algorithm ranks the Web service candidates based on their overall QoS and recommends services with top QoS values to users. Finally, the effectiveness and feasibility of our approach are validated by experiments, i.e. the selected Web service by our approach is given high average evaluation than other ones by users and the time cost of PCA-WSS algorithm is not affected acutely by the number of service candidates.

A Service Selection Approach Based on Availability-Aware in Mobile Ad Hoc Networks

Service composition is considered to be an effective way for resource sharing and node collaboration in Mobile Ad hoc NETworks (MANETs) environment.In order to improve the reliability and shorten the response time of composite services,this paper first analyzes the node environments and network environments that affect the component services' availability,and then proposes an Environment-aware Quantitative Evaluation Model for Service Availability (EQEM-SA).In addition,based on EQEM-SA,a service field concept is proposed as well as the availability attenuation equation,where the availability value is considered as the field strength.Then the service selection approach based on service field model is presented.The effectiveness of the proposed approach is illustrated and compared with related references,and the results of experimental evaluations indicate that our approach significantly reduces the failure rate and shortens the service delay.

Toward a More Accurate Web Service Selection Using Modified Interval DEA Models with Undesirable Outputs

With the growing number of Web services on the internet,there is a challenge to select the best Web service which can offer more quality-of-service(QoS)values at the lowest price.Another challenge is the uncertainty of QoS values over time due to the unpredictable nature of the internet.In this paper,we modify the interval data envelopment analysis(DEA)models[Wang,Greatbanks and Yang(2005)]for QoS-aware Web service selection considering the uncertainty of QoS attributes in the presence of desirable and undesirable factors.We conduct a set of experiments using a synthesized dataset to show the capabilities of the proposed models.The experimental results show that the correlation between the proposed models and the interval DEA models is significant.Also,the proposed models provide almost robust results and represent more stable behavior than the interval DEA models against QoS variations.Finally,we demonstrate the usefulness of the proposed models for QoS-aware Web service composition.Experimental results indicate that the proposed models significantly improve the fitness of the resultant compositions when they filter out unsatisfactory candidate services for each abstract service in the preprocessing phase.These models help users to select the best possible cloud service considering the dynamic internet environment and they help service providers to improve their Web services in the market.

A K-Median Facility Location Agent for Low-Cost Service Selection in Digital Community Network

With the increasing number of web services, it becomes a difficult task for an ordinary user to select an appropriate service. Hence, it is conventional that users in a digital community network take part in a collaborative mechanism for the purpose of service selection. The participation usually brings unnecessary burdens for users, such as giving opinions, storing service information. Extra communication overhead hinders the performance of the network. Thus, the community administrators are facing a problem of how to obtain an overall service selection result for the whole community readily and effectively. To address this problem, we present a k-median facility location agent model. The model analyzes the procedure of service selection through five entities and six types of messages. Two algorithms are elaborated in pursuit of a global optimization concerning connection costs between users and facilities where services are deployed. To evaluate our model, we conduct extensive simulations and present a detailed analysis of the simulation results.

Adaptive Service Selection Method in Mobile Cloud Computing

Despite the rapid advances in mobile technology, many constraints still prevent mobile devices from running resource-demanding applications in mobile environments. Cloud computing with flexibility, stability and scalability enables access to unlimited resources for mobile devices, so more studies have focused on cloud computingbased mobile services. Due to the stability of wireless networks, changes of Quality of Service （QoS） level and user＇ real-time preferences, it is becoming challenging to determine how to adaptively choose the ＂appropriate＂ service in mobile cloud computing environments. In this paper, we present an adaptive service selection method. This method first extracts user preferences from a service＇s evaluation and calculates the similarity of the service with the weighted Euclidean distance. Then, they are combined with user context data and the most suitable service is recommended to the user. In addition, we apply the fuzzy cognitive imps-based model to the adaptive policy, which improves the efficiency and performance of the algorithm. Finally, the experiment and simulation demonstrate that our approach is effective.

User-preferences based service selection model in large-scale services with various QoS properties

With the rapid growth of service scale, there are many services with the same functional properties but different non-flmctional properties on the Internet. There have been some global optimizing service selection algorithms for service selection. However, most of those approaches cannot fully reflect users＇ preferences or are not fully suitable for large-scale services selection. In this paper, an ant colony optimization （ACO） algorithm for the model of global optimizing service selection with various quality of srevice （QoS） properties is employed, and a user-preference based large-scale service selection algorithm is proposed. This algorithm aims at optimizing user-preferred QoS properties and selecting services that meet all user-defined QoS thresholds. Experiment results prove that this algorithm is very efficient in this regard.

Evaluation of Parameters Importance in Cloud Service Selection Using Rough Sets

With the rapid development of the cloud computing technology, it has matured enough for a lot of individuals and organizations to move their work into the cloud. Correspondingly, a variety of cloud services are emerging. It is a key issue to assess the cloud services in order to help the cloud users select the most suitable cloud service and the cloud providers offer this service with the highest quality. The criteria parameters defining the cloud services are complex which lead to cloud service deviation. In this paper, we propose an assessment method of parameters importance in cloud services using rough set theory. The method can effectively compute the importance of cloud services parameters and sort them. On the one hand, the calculation can be used as the credible reference when users choose their appropriate cloud services. On the other hand, it can help cloud service providers to meet user requirements and enhance the user experience. The simulation results show the effectiveness of the method and its relevance in the cloud context.

Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration

Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.

Qo S-Based Service Selection with Lightweight Description for Large-Scale Service-Oriented Internet of Things

Quality of Service （QoS）-based service selection is the key to large-scale service-oriented Internet of Things （lOT）, due to the increasing emergence of massive services with various QoS. Current methods either have low selection accuracy or are highly time-consuming （e.g., exponential time complexity）, neither of which are desirable in large-scale lOT applications. We investigate a QoS-based service selection method to solve this problem. The main challenges are that we need to not only improve the selection accuracy but also decrease the time complexity to make them suitable for large-scale lOT applications. We address these challenges with the following three basic ideas. First, we present a lightweight description method to describe the QoS, dramatically decreasing the time complexity of service selection. Further more, based on this QoS description, we decompose the complex problem of QoS-based service selection into a simple and basic sub-problem. Finally, based on this problem decomposition, we present a QoS-based service matching algorithm, which greatly improves selection accuracy by considering the whole meaning of the predicates. The traces-driven simulations show that our method can increase the matching precision by 69% and the recall rate by 20% in comparison with current methods. Moreover, theoretical analysis illustrates that our method has polynomial time complexity, i.e., O（m^2 × n）, where m and n denote the number of predicates and services, respectively.

A Multi-dimensional Trust-aware Cloud Service Selection Mechanism Based on Evidential Reasoning Approach

In the last few years, cloud computing as a new computing paradigm has gone through significant development, but it is also facing many problems. One of them is the cloud service selection problem. As increasingly boosting cloud services are offered through the internet and some of them may be not reliable or even malicious, how to select trustworthy cloud services for cloud users is a big challenge. In this paper, we propose a multi-dimensional trust-aware cloud service selection mechanism based on evidential reasoning(ER) approach that integrates both perception-based trust value and reputation based trust value, which are derived from direct and indirect trust evidence respectively, to identify trustworthy services. Here, multi-dimensional trust evidence, which reflects the trustworthiness of cloud services from different aspects, is elicited in the form of historical users feedback ratings. Then, the ER approach is applied to aggregate the multi-dimensional trust ratings to obtain the real-time trust value and select the most trustworthy cloud service of certain type for the active users. Finally, the fresh feedback from the active users will update the trust evidence for other service users in the future.

Dynamic Web service selection group decision-making based on heterogeneous QoS models

In open and dynamic Internet environment, multi-periods quality of service （QoS）, multiple decision-makers based on heterogeneous QoS models and uncertainty weights make optimal Web service selection hard. To solve the difficulties above, dynamic Web service selection group decision-making based on heterogeneous QoS models （DWSSGD_HQM） is proposed. Drawing on and extending technique for order preference by similarity to ideal solution （TOPSIS）, DWSSGD_HQM supports multiple decision-makers based on heterogeneous QoS models expressed in real numbers, interval numbers, triangular fuzzy numbers and intuitionistic fuzzy numbers respectively, and takes multi-periods QoS and weights of user and group into account. Six steps are detailed. They are converting heterogeneous QoS models into ones expressed in interval numbers, calculating weighted normalized decision-matrix, determining the group positive-ideal and negative-ideal solutions, calculating the close-degrees of candidates, aggregating close-degrees of multi-periods for each decision-maker, and ranking the alternatives. Finally, experiments are conducted by using actual QoS data to evaluate the effectiveness of the proposed approach.

Indeterminacy-aware service selection for reliable service composition

With the development of Intemet and Web service technology, Web service composition has been an effective way to construct software applications; service selection is the crucial element in the composition process. However, the existing selection methods mostly generate static plans since they neglect the inherent stochastic and dynamic nature of Web services. As a result, Web service composition often inevitably terminates with failure. An indeterminacy-aware service selection algorithm based on an improved Markov decision process （IMDP） has been designed for reliable service composition, but it suffers from higher computation complexity. Therefore, an efficient method is proposed, which can reduce the computation cost by converting the service selection problem based on IMDP into solving a nonhomogeneous linear equation set. Experimental results demonstrate the success rate of service composition has been improved greatly, whilst also reducing computation cost.

A Hybrid Approach for Selection in Service Community

Although there have been existing competitions among web service （WS） providers, they still have opportunities to cooperate together for common profits. WS community as a mean to provide an ontological organization of WSs that share the same domain of interest has realized this kind of fancy in the sense that providers can work together to compete against others outside the community. Service selection in WS community is different from the traditional service selection, since WS community should take into account its own benefits. Therefore, we propose a hybrid approach to make service selection in WS community. The approach considers the profits of both WS community and the services within it. The experimental evaluation shows that the approach has a great advantage over other approach without consideration of community＇s benefits.

Solving Service Selection Problem Based on a Novel Multi-Objective Artificial Bees Colony Algorithm

Service computing is a new paradigm and has been widely used in many fields. The multi-objective service selection is a basic problem in service computing and it is non-deterministic polynomial (NP)-hard. This paper proposes a novel multi-objective artificial bees colony (n-MOABC) algorithm to solve service selection problem. A composite service instance is a food source in the algorithm. The fitness of a food source is related to the quality of service (QoS) attributes of a composite service instance. The search strategy of the bees are based on dominance. If a food source has not been updated in successive maximum trial (Max Trial) times, it will be abandoned. In experiment phase, a parallel approach is used based on map-reduce framework for n-MOABC algorithm. The performance of the algorithm has been tested on a variety of data sets. The computational results demonstrate the effectiveness of our approach in comparison to a novel bi-ant colony optimization (NBACO) algorithm and co-evolution algorithm. © 2017, Shanghai Jiaotong University and Springer-Verlag GmbH Germany.

Research of service selection algorithm for net-centric simulation task community

Being a new-generation C4ISR system simulation method,the construction approach of net-centric simulation(NCS)is developing toward net-centric from the traditional approach of platform-centric.NCS is mainly completed by the construction of the simulation task community(STC),the key to which being the dynamic integration of the various services spread in the network in order to form a new STC that meets the requirements of different users.In this study,a simulation task community service selection algorithm(STCSSA)is proposed.The main idea of this algorithm is to transform the construction of STC to the searching of optimal multi-objectives services with QoS global constraints.This paper first introduces the QoS model of STC and evaluates the service composition process,then presents the detailed operating process of STCSSA and design of the dynamic inertia weight strategy of the algorithm,and also proposes an optional variation method.Comparative tests were performed on STCSSA with other particle swarm optimization algorithms.It was validated from the perspective of performance that the proposed algorithm has advantages in improving the rate of convergence and avoiding local optimum,and from the perspective of practical application STCSSA also demonstrated feasibility in the construction of large-scale NCS task community.

The Theme Selection And Language Analysis Of Outdoor Public Service Advertisement In Guangzhou

As a dynamic language phenomenon, public service advertisement reflects the social language life. This paper presents a detailed analysis of the theme selection and language of outdoor public service advertisement language in Guangzhou. It describes the features and expressions of outdoor public service advertisement in subject content, sentence form and rhetoric, aimed at understanding the basic situation and effect of public service advertisement on the audience, and guiding the audience to improve their morality and behavior.

Trust assessment of business service workflow based on complex trust network

For business service workflow,QoS-based services selection can't guarantee whether the composite service satisfies user' s requirement after delivery,because once any service interrupts or quality of service(QoS) maliciously reduces,the quality of workflow will be reduced.Trustworthy services can provide reliable QoS,so trustworthiness research could improve the efficiency of services selection.This paper investigates trust assessment in the perspective of workflow.Firstly,trust network of business service workflow(TN-BSW) is proposed to analyze trust attributes;then,the trust measurement system of TN-BSW is investigated to assess the trust value quantitatively;and then,a trust-aware service recommendation model(TaSRM) is proposed to enhance the efficiency of QoS-basedservices selection;finally,experiment shows the feasibility of TN-BSWand the performance of TaSRM.

Iterative selection algorithm for service composition in distributed environments

In service oriented architecture （SOA）, service composition is a promising way to create new services. However, some technical challenges are hindering the application of service composition. One of the greatest challenges for composite service provider is to select a set of services to instantiate composite service with end- to-end quality of service （QoS） assurance across different autonomous networks and business regions. This paper presents an iterative service selection algorithm for quality driven service composition. The algorithm runs on a peer-to-peer （P2P） service execution environment--distributed intelligent service execution （DISE）, which provides scalable QoS registry, dynamic service selection and service execution services. The most significant feature of our iterative service selection algorithm is that it can work on a centralized QoS registry as well as cross decentralized ones. Network status is an optional factor in our QoS model and selection algorithm. The algorithm iteratively selects services following service execution order, so it can be applied either before service execution or at service run-time without any modification. We test our algorithm with a series of experiments on DISE. Experimental results illustrated its excellent selection and outstanding performance.

QoS Requirement Generation and Algorithm Selection for Composite Service Based on Reference Vector

Under SOA （Service-Oriented Architecture）, composite service is formed by aggregating multiple component services together in a given workflow. One key criterion of this research topic is QoS composition. Most work on service composition mainly focuses on the algorithms about how to compose services according to assumed QoS, without considering where the required QoS comes from and the selection of user preferred composition algorithm among those with different computational cost and different selection results. In this paper, we propose to strengthen current service composition mechanism by generation of QoS requirement and its algorithm selection based on the QoS reference vectors which are calculated optimally from the existing individual services＇ QoS by registry to represent QoS overview about the best QoS, the worst （or most economical） QoS, or the average QoS of all composite services. To implement QoS requirement, which is determined according to QoS overview, this paper introduces two selection algorithms as two kinds of experiment examples, one aiming at the most accurate service selection and the other chasing for trade-off between selection cost and result. Experimental results show our mechanism can help the requester achieve his expected composite service with appropriate QoS requirement and customized selection algorithm.