1) Dynamic Test Reconfiguration for Composite Web Services

ABSTARCT : this paper introduces a testing strategy that is suitable for testing service-based
applications. We describe an architecture that responds to changes of service operation, operation
arguents and service coposition changes. !ur proof-of-concept test syste perfors runtie
testing on our odel atoic and coposite "eb services using a rando testing techni#ue. A novel
change identification ethod "as developed to capture changes at the service interface. The test
syste is able to identify changes that occur in service operations and operational arguents in a
service description of a test candidate. !ur approach uses a ne" ethod to detect changes in a
service inventory. Autoated reconfiguration is used to support the continuous operation of the
testing systes during a test candidate change.
$%Commitments to Regulate Social Web Services Operation
ABTRACT : This paper discusses ho" social Web services are held responsible for the actions they
ta&e at run tie. Copared to 'regular% Web services, social Web services perfor different actions,
for instance establishing and aintaining net"or&s of contacts and foring "ith soe privileged
contacts strong and long lasting collaborative groups. Assessing these actions( outcoes, to avoid
any violation, occurs through coitents that the social Web services are re#uired to bind to. T"o
types of coitents are identified: social coitents that guarantee the proper use of the social
net"or&s in "hich the social Web services sign up, and business coitents that guarantee the
proper developent of coposite Web services in response to users( re#uests. )etecting
coitent violation and action prohibition using onitoring results in iposing sanctions on the
*guilty+ social Web services and ta&ing corrective actions. A syste for coitent anageent
in ters of definition, binding, onitoring, and violation detection is also discussed in this paper.
3)LASA!"#$ !euristic Approac% for Service Selection in Composite Web
Services
ABSTARCT : ,uerous functionally siilar services are evolving day by day. Selecting the
service "hich atches e-actly "ith the re#uireents of the consuer is a tedious tas&. The .oS-
based Service Selection /roble 'SS/% is a process of allocating a .oS based e-terior "eb service
coponent to each tas& of the "or&flo" that describes a coposite "eb service. 0ence, the
aggregate .oS of the coposite "eb service is the best. 1t is a planning proble by its nature. This
paper provides the brief overvie" of the heuristic based Service Selection Algorith '2ASA-034%
for the 556/ for of reliability enforced SS/. This paper also copares the proposed 2ASA-
034 "ith the e-isting heuristic based SSA and proved that the proposed 2ASA-034 perfors
better than the e-isting heuristic based SSA based on the reliability.
&)Service Selection for Web Services 'it% (robabilistic )oS
ABSTARCT : Web services can be specified fro t"o perspectives, naely functional and non-
functional properties. 5ultiple services ay possess the sae function "hile vary in their non-
functional properties, or called #uality-of-service '.oS%. .oS values are iportant criteria for
service selection or recoendation. 5ost of the forer "or&s in Web service selection and
recoendation treat the .oS values as constants. 0o"ever, .oS values of a service as perceived
by a given user are intrinsically rando variables because .oS value prediction can never be
precise and there are al"ays soe unobserved rando effects. 1n this "or&, "e address the service
selection proble by representing services7 .oS values as discrete rando variables "ith
probability ass functions. The goal is to select a set of atoic services for coposing a coposite
service such that the probability of satisfying constraints iposed on the coposite service is high
and the e-ecution tie is reasonable. !ur proposed ethod starts "ith an initial Web service
assignent and increentally ad8usts it using siulated annealing. We conduct several e-perients
and the results sho" that our approach generally perfors better than previous "or&s, such as the
integer prograing ethod and the cost-driven ethod
*) A +rame'or, for Composing SOA(- .onSOA( an/ .onWeb Services
ABSRACT : Recently, there is a trend on developing obile applications based on service-oriented
architecture in nuerous application doains, such as teleatics and sart hoe. Although efforts
have been ade on developing coposite S!A/ services, little ephasis has been put on invo&ing
and coposing a cobination of S!A/, non-S!A/, and non-"eb services into a coposite process
to e-ecute cople- tas&s on various obile devices. 5ain challenges are t"o-fold: one is ho" to
invo&e and copose heterogeneous "eb services "ith various protocols and content types,
including S!A/, R3STful, and !S9i services: and the other is ho" to integrate non-"eb services,
li&e Web contents and obile applications, into a coposite service process. 1n this "or&, "e
propose an approach to invo&ing and coposing S!A/, non-S!A/, and non-"eb services "ith t"o
&ey features: an e-tended B/32 engine bundled "ith adapters to enable direct invocation and
coposition of S!A/, R3STful and !S9i services based on Adapter pattern: and t"o
transforation echaniss devised to enable conversion of Web contents and Android activities
into !S9i services. 1n the e-periental evaluations, "e deonstrate net"or& traffic and turnaround
tie of our approach are better than those of the traditional ones.
;% Web service selection algorit%m for /ynamic service composition using LSLO
approac%
ABSTRACT : Web service selection aong a collection of functionally identical Web services for
runtie service coposition is a challenging issue. 1n this paper, a local selection and local
optii<ation approach for Web service selection based on linear prograing is proposed. This
approach forulates the proble of selecting best candidate Web service fro each service class as
an assignent proble of linear prograing. The approach uses a heap data structure to place the
services in an appropriate order for coposition based on the highest #uality score. The proposed
approach can help in iproving the coposition tie, #uality of the generated coposite Web
service and the transission delay by for"arding only a fe" nubers of selected services to the
coposer.
=%DataDriven Composition for ServiceOriente/ Situational Applications
ABSTRACT : The convergence of Services Coputing and Web $.> gains a large space of
opportunities to copose ?*situational+? "eb applications fro Web-delivered services. 0o"ever,
the large nuber of services and the cople-ity of coposition constraints a&e anual
coposition difficult to application developers, "ho ight be non-professional prograers or
even end-users. This paper presents a systeatic data-driven approach to assisting situational
application developent. We first propose a techni#ue to e-tract useful inforation fro ultiple
sources to abstract service capabilities "ith a set tags. This supports intuitive e-pression of user7s
desired coposition goals by siple #ueries, "ithout having to &no" underlying technical details.
A planning techni#ue then e-ploits coposition solutions "hich can constitute the desired goals,
even "ith soe potential ne" interesting coposition opportunities. A bro"ser-based tool
facilitates visual and iterative refineent of coposition solutions, to finally coe up "ith the
satisfying outputs. A series of e-perients deonstrate the efficiency and effectiveness of our
approach.
@%Access Control 0ec%anisms for 1nterOrgani2ational Wor,flo'
ABSTRACT : As ore businesses engage in globali<ation, inter-organi<ational collaborative
coputing gro"s in iportance. Since "e cannot e-pect hoogeneous coputing environents in
participating organi<ations, heterogeneity and 1nternet-based technology are prevalent in inter-
organi<ational collaborative coputing environents. !ne technology that provides solutions for
data sharing and "or& coordination at the global level is inter- organi<ational "or&flo". 1n this
paper, "e investigate the access control re#uireents for inter-organi<ational "or&flo". We then
present access control solutions for inter-organi<ational "or&flo" based on our ipleentation.
5any of the re#uireents and solutions in this paper address the scalability of e-isting security
solutions, the separation of inter-organi<ational "or&flo" security fro concrete organi<ation level
security enforceent, and the enforceent of fine-grained access control for inter-organi<ational
"or&flo".
A% A .ovel 0et%o/ for Web Service Composition 3ase/ on "4ten/e/ 3D1
ABSTRACT : Web Service Coposition 'WSC% has been a hot research topic in the past decade
because it can carry out cople- tas&s. The ain ethods to study WSC include "or&flo", process
algebra and seantics. 1t(s very possible that user(s goal is not consistent "ith WSC(s goal. Bor this,
a ne" ethod of WSC based on B)1 'Belief-)esire-1ntention% has been provided. 1n this ethod,
Belief and )esire are apped into the environent and the goal of "eb service 'and user%
respectively. 1ntention and WSC are deterined by the. An iproved B)1 odel has been applied
to WSC and dynaic evolution of established processes. At last, a classic e-aple in "eb service,
travel service process, is utili<ed to illustrate the consistency bet"een WSC(s goal and user(s goal.
C>% An Online (erformance (re/iction +rame'or, for ServiceOriente/ Systems
ABSTRACT : The e-ponential gro"th of Web service a&es building high-#uality service-oriented
systes an urgent and crucial research proble. /erforance of the service-oriented systes highly
depends on the reote Web services as "ell as the unpredictability of the 1nternet. /erforance
prediction of service-oriented systes is critical for autoatically selecting the optial Web service
coposition. Since the perforance of Web services is highly related to the service status and
net"or& environents "hich are variable over tie, it is an iportant tas& to predict the
perforance of service-oriented systes at run-tie. To address this critical challenge, this paper
proposes an online perforance prediction frae"or&, called !pred, to provide personali<ed
service-oriented syste perforance prediction efficiently. Based on the past usage e-perience
fro different users, !/red builds feature odels and eploys tie series analysis techni#ues on
feature trends to a&e perforance prediction. The results of large-scale real-"orld e-perients
sho" the effectiveness and efficiency of !/red.