检索结果-南通市图书馆

Neighborhood Search Based Improved Bat Algorithm for web service composition

Computer Systems Science & Engineering 2023年第5期45卷 1343-1356页

作者： Fadl Dahan Department of Information System College of Computer Engineering and SciencesPrince Sattam bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia Department of Computer Sciences Faculty of Computing and Information Technology AlturbahTaiz UniversityTaiz9674Yemen

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.

关键词： Cloud computing web service composition bat algorithm serviceoriented architecture

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Hybrid Metaheuristics web service composition Model for QoS Aware services

引用

Computer Systems Science & Engineering 2022年第5期41卷 511-524页

作者： P.Rajeswari K.Jayashree Department of Computer Science and Engineering Rajalakshmi Engineering CollegeChennai602105India

Recent advancements in cloud computing(CC)technologies signified that several distinct web services are presently developed and exist at the cloud data centre.Currently,web service composition gains maximum attention among researchers due to its significance in real-time applications.Quality of service(QoS)aware service composition concerned regarding the election of candidate services with the maximization of the whole QoS.But these models have failed to handle the uncertainties of QoS.The resulting QoS of composite service identified by the clients become unstable and subject to risks of failing composition by end-users.On the other hand,trip planning is an essential technique in supporting digital map services.It aims to determine a set of location based services(LBS)which cover all client intended activities quantified in the query.But the available web service composition solutions do not consider the complicated spatio-temporal features.For resolving this issue,this study develops a new hybridization of the firefly optimization algorithm with fuzzy logic based web service composition model(F3L-WSCM)in a cloud environment for location awareness.The presented F3L-WSCM model involves a discovery module which enables the client to provide a query related to trip planning such as flight booking,hotels,car rentals,etc.At the next stage,the firefly algorithm is applied to generate composition plans to minimize the number of composition plans.Followed by,the fuzzy subtractive clustering(FSC)will select the best composition plan from the available composite plans.Besides,the presented F3L-WSCM model involves four input QoS parameters namely service cost,service availability,service response time,and user rating.An extensive experimental analysis takes place on CloudSim tool and exhibit the superior performance of the presented F3L-WSCM model in terms of accuracy,execution time,and efficiency.

关键词： web service composition trip planning hybrid models firefly algorithm QoS aware services fuzzy logic

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Hybridizing Artificial Bee Colony with Bat Algorithm for web service composition

引用

Computer Systems Science & Engineering 2023年第8期46卷 2429-2445页

作者： Tariq Ahamed Ahanger Fadl Dahan Usman Tariq Department of Management Information Systems College of Business AdministrationPrince Sattam Bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia Department of Management Information Systems College of Business Administration-Hawtat Bani TamimPrince Sattam Bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia Department of Computer Sciences Faculty of Computing and Information Technology Al-TurbahTaiz UniversityTaiz9674Yemen

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.

关键词： Internet of things artificial bee colony bat algorithm elitist strategy web service composition

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A colored Petri net-based model for web service composition

引用

Journal of Shanghai University(English Edition) 2008年第4期12卷 323-329页

作者：张昭理洪帆肖海军 College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 P. R. China

In this paper, a model based colored Petri net （CPN） to provide semantic support for web service composition is proposed, and the reliability and maintainability of composite services are improved. The composite constructs in the model are sequence, concurrent, choice, loop and replace. The web service is formally defined by a CPN. A closed composing algebra is defined to obtain a framework which enables declarative composition of web services. Availability, confidentiality, and integrity of composite service are analyzed within the framework of the model based CPN.

关键词： web service colored Petri net （CPN） web service composition model

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Credible web service composition based on Improved Multi-objective Particle Swarm Optimization

Credible Web Service Composition based on Improved Multi-obj...

引用

第40届中国控制会议

作者： Feng Liu Min Han Jianwei Liu Faculty of Electronic Information and Electrical Engineering Dalian University of Technology Key Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education Dalian University of Technology Faculty of Infrastructure Engineering Dalian University of Technology

In the field of web service composition,since the published value of Quality of service(QoS) is not necessarily reliable,the research on the credibility of web services has become a research hotspot.However,the current credibility research cannot well describe the difference between the published value and the actual operating value.At the same time,the algorithm used to solve the web service composition scheme generally has the problem of poor solution effect.Based on this,this paper proposes a credible web service composition method based on improved multi-objective particle swarm optimization(IMOPSO).Firstly,this paper proposes a similarity-based credibility calculation model,and combines it with the QoS published value through the inverse of the similarity,so that the QoS of the web service meets the actual operation effect.Secondly,this paper proposes an improved multi-objective particle swarm optimization algorithm,which solves the problem of premature convergence by expanding the population diversity,and the solution effect is significantly improved.Finally,the improved multi-objective particle swarm algorithm is used to solve the web service composition problem based on credible Qo S.Simulation experiments on the QWS2 data set and the Synthetic data set prove that the method proposed in this paper can effectively improve the credibility of the service composition scheme,and has higher composition efficiency and better composition effect.

关键词： credibility web service composition QoS multi-objective particle swarm optimization

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Minimal role mining method for web service composition

引用

Journal of Zhejiang University-Science C(Computers and Electronics) 2010年第5期11卷 328-339页

作者： Chao HUANG Jian-ling SUN Xin-yu WANG Yuan-jie SI Department of Computer Science and Technology Zhejiang University Hangzhou 310027 China

web service composition is a low cost and efficient way to leverage the existing resource and implementation.In current web service composition implementations,the issue of how to define the role for a new composite web service has been little addressed.Adjusting the access control policy for a new composite web service always causes substantial administration overhead from the security administrator.Furthermore,the distributed nature of web service based applications makes traditional role mining methods obsolete.In this paper,we analyze the minimal role mining problem for web service composition,and prove that this problem is NP-complete.We propose a sub-optimal greedy algorithm based on the analysis of necessary role mapping for interoperation across multiple domains.Simulation shows the effectiveness of our algorithm,and compared to the existing methods,our algorithm has significant performance advantages.We also demonstrate the practical application of our method in a real agent based web service system.The results show that our method could find the minimal role mapping efficiently.

关键词： web service composition Role base access control(RBAC) Role mining Access control policy Role mapping web service security

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Formal Model for BPEL4WS Description of web service composition

引用

Wuhan University Journal of Natural Sciences 2006年第5期11卷 1311-1319页

作者： GU Xiwu LU Zhengding College of Computer Science and Technology HuazhongUniversity of Science and Technology Wuhan 430074Hubei China

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.

关键词： communicating sequential processes web service web service composition business process execution language for web services

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Artificial Bee Colony with Cuckoo Search for Solving service composition

引用

Intelligent Automation & Soft Computing 2023年第3期35卷 3385-3402页

作者： Fadl Dahan Abdulelah Alwabel Department of Information System College of Computer Engineering and SciencesPrince Sattam bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia Department of Computer Sciences Faculty of Computing and Information Technology AlturbahTaiz UniversityTaiz9674Yemen Department of Computer Sciences College of Computer Engineering and SciencesPrince Sattam bin Abdulaziz UniversityAl-Kharj11942Saudi Arabia

In recent years,cloud computing has provided a Software As A service(SaaS)platform where the software can be reused and applied to fulﬁll compli-cated user demands according to speciﬁc Quality of services(QoS)constraints.The user requirements are formulated as a workﬂow consisting of a set of tasks.However,many services may satisfy the functionality of each task;thus,searching for the composition of the optimal service while maximizing the QoS is formulated as an NP-hard problem.This work will introduce a hybrid Artiﬁcial Bee Colony(ABC)with a Cuckoo Search(CS)algorithm to untangle service composition problem.The ABC is a well-known metaheuristic algorithm that can be applied when dealing with different NP-hard problems with an outstanding record of performance.However,the ABC suffers from a slow convergence problem.Therefore,the CS is used to overcome the ABC’s limitations by allowing the abandoned bees to enhance their search and override the local optimum.The proposed hybrid algorithm has been tested on 19 datasets and then compared with two standard algorithms(ABC and CS)and three state-of-the-art swarm-based composition algorithms.In addition,extensive parameter study experiments were conducted to set up the proposed algorithm’s parameters.The results indicate that the proposed algorithm outperforms the standard algorithms in the three comparison criteria(bestﬁtness value,averageﬁtness value,and average execution time)overall datasets in 30 different runs.Furthermore,the proposed algorithm also exhibits better performance than the state–of–the–art algorithms in the three comparison criteria over 30 different runs.

关键词： Cloud computing web service composition artiﬁcial bee colony cuckoo search

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

THE INNOVATIONS AND service EXCELLENCE IN web serviceS composition

THE INNOVATIONS AND SERVICE EXCELLENCE IN WEB SERVICES COMPO...

引用

The 11th Annual Conference of Asia Pacific Decision Sciences Institute

作者： Wen Yau Liang Department of Information Management National Changhua University of Education Changhua Taiwan

＜正＞web services are being adopted, more and more, as a viable means of accessing web-based applications, and can be viewed as a technology based on maximal decoupling （and thus maximal reusability）, available over an existing economic infrastructure （the Internet）. This powerful concept is gradually taking root, because of the convergence of business and government efforts in making the web the choice for all types of activities. web services are self-contained, self-describing, modular applications that can be published, located and invoked across the web, offering a web-native XML based solution. Thus, web services can tackle the challenge of heterogeneous sources, creating interoperability. Currently, services composition is basically created through a predefined workflow or business logic model. Using the UML state chart analysis tool, the abstract specification and context-oriented approach can be attended to, or it can be incorporated with ontology, in a semantic way. These studies have specialized in the availability and reliability enhancement of web services compositions and have concentrated on the execution of web services, focusing on availability, and service selection, and even the verification of web services. However, a problem exists in the current distribution process of web services compositions: the general analysis and selection of services can be overly complex and un-systemic. There is a need to manage composite web services, based on these emerging technologies, but the research related to ranking candidate services and selection of optimization strategies is sparse. Nothing has yet been published, that considers the constraints of non-functional service properties. In this paper, a novel approach is proposed. This present an approach to web services composition;then practical implementation is illustrated;a case study, composing web services for a collaborative design project is illustrated finally.

关键词： web services web service composition functional and non-functional properties

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Efficient composition of Semantic web services with End-to-End QoS Optimization

引用

Tsinghua Science and Technology 2010年第6期15卷 678-686页

作者：许斌罗森闫奕歆 Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University

The efficiency of QoS-aware service composition is important since most service composition problems are known to be NP-hard. With the growing number of web services, service composition is like a decision problem on selecting services or/and execution plans to satisfy the users＇ end-to-end QoS requirements （e.g. response time, throughput）. Composite services with the same functionality may have dif-ferent execution plans, which may cause different end-to-end QoS. This paper presents a model combining semantic data-links and QoS, which leads to an efficient approach to automatic construction of a composite service with optimal end-to-end QoS. The approach is based on a greedy algorithm to select both services and execution plans for composite services. Empirical and theoretical analyses of the approach show that its time complexity is O（mn2） for a repository with n services and an ontology with m concepts. Moreover, the approach increases linearly in time when using an index to search services in the repository. Tests with a repository with 20 000 services and an ontology with 300 000 concepts show that the algorithm significantly outperforms current existing algorithms in terms of composition efficiency while achieving optimal end-to-end QoS.

关键词： semantic web service web service composition QoS optimization

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：