100,792 research outputs found
A survey of QoS-aware web service composition techniques
Web service composition can be briefly described as the process of aggregating services with disparate functionalities into a new composite service in order to meet increasingly complex needs of users. Service composition process has been accurate on dealing with services having disparate functionalities, however, over the years the number of web services in particular that exhibit similar functionalities and varying Quality of Service (QoS) has significantly increased. As such, the problem becomes how to select appropriate web services such that the QoS of the resulting composite service is maximized or, in some cases, minimized. This constitutes an NP-hard problem as it is complicated and difficult to solve. In this paper, a discussion of concepts of web service composition and a holistic review of current service composition techniques proposed in literature is presented. Our review spans several publications in the field that can serve as a road map for future research
A Bayesian Network View on Acoustic Model-Based Techniques for Robust Speech Recognition
This article provides a unifying Bayesian network view on various approaches
for acoustic model adaptation, missing feature, and uncertainty decoding that
are well-known in the literature of robust automatic speech recognition. The
representatives of these classes can often be deduced from a Bayesian network
that extends the conventional hidden Markov models used in speech recognition.
These extensions, in turn, can in many cases be motivated from an underlying
observation model that relates clean and distorted feature vectors. By
converting the observation models into a Bayesian network representation, we
formulate the corresponding compensation rules leading to a unified view on
known derivations as well as to new formulations for certain approaches. The
generic Bayesian perspective provided in this contribution thus highlights
structural differences and similarities between the analyzed approaches
The effect of scale-free topology on the robustness and evolvability of genetic regulatory networks
We investigate how scale-free (SF) and Erdos-Renyi (ER) topologies affect the
interplay between evolvability and robustness of model gene regulatory networks
with Boolean threshold dynamics. In agreement with Oikonomou and Cluzel (2006)
we find that networks with SFin topologies, that is SF topology for incoming
nodes and ER topology for outgoing nodes, are significantly more evolvable
towards specific oscillatory targets than networks with ER topology for both
incoming and outgoing nodes. Similar results are found for networks with SFboth
and SFout topologies. The functionality of the SFout topology, which most
closely resembles the structure of biological gene networks (Babu et al.,
2004), is compared to the ER topology in further detail through an extension to
multiple target outputs, with either an oscillatory or a non-oscillatory
nature. For multiple oscillatory targets of the same length, the differences
between SFout and ER networks are enhanced, but for non-oscillatory targets
both types of networks show fairly similar evolvability. We find that SF
networks generate oscillations much more easily than ER networks do, and this
may explain why SF networks are more evolvable than ER networks are for
oscillatory phenotypes. In spite of their greater evolvability, we find that
networks with SFout topologies are also more robust to mutations than ER
networks. Furthermore, the SFout topologies are more robust to changes in
initial conditions (environmental robustness). For both topologies, we find
that once a population of networks has reached the target state, further
neutral evolution can lead to an increase in both the mutational robustness and
the environmental robustness to changes in initial conditions.Comment: 16 pages, 15 figure
- …