81,979 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 Simple Flood Forecasting Scheme Using Wireless Sensor Networks
This paper presents a forecasting model designed using WSNs (Wireless Sensor
Networks) to predict flood in rivers using simple and fast calculations to
provide real-time results and save the lives of people who may be affected by
the flood. Our prediction model uses multiple variable robust linear regression
which is easy to understand and simple and cost effective in implementation, is
speed efficient, but has low resource utilization and yet provides real time
predictions with reliable accuracy, thus having features which are desirable in
any real world algorithm. Our prediction model is independent of the number of
parameters, i.e. any number of parameters may be added or removed based on the
on-site requirements. When the water level rises, we represent it using a
polynomial whose nature is used to determine if the water level may exceed the
flood line in the near future. We compare our work with a contemporary
algorithm to demonstrate our improvements over it. Then we present our
simulation results for the predicted water level compared to the actual water
level.Comment: 16 pages, 4 figures, published in International Journal Of Ad-Hoc,
Sensor And Ubiquitous Computing, February 2012; V. seal et al, 'A Simple
Flood Forecasting Scheme Using Wireless Sensor Networks', IJASUC, Feb.201
Tractable Pathfinding for the Stochastic On-Time Arrival Problem
We present a new and more efficient technique for computing the route that
maximizes the probability of on-time arrival in stochastic networks, also known
as the path-based stochastic on-time arrival (SOTA) problem. Our primary
contribution is a pathfinding algorithm that uses the solution to the
policy-based SOTA problem---which is of pseudo-polynomial-time complexity in
the time budget of the journey---as a search heuristic for the optimal path. In
particular, we show that this heuristic can be exceptionally efficient in
practice, effectively making it possible to solve the path-based SOTA problem
as quickly as the policy-based SOTA problem. Our secondary contribution is the
extension of policy-based preprocessing to path-based preprocessing for the
SOTA problem. In the process, we also introduce Arc-Potentials, a more
efficient generalization of Stochastic Arc-Flags that can be used for both
policy- and path-based SOTA. After developing the pathfinding and preprocessing
algorithms, we evaluate their performance on two different real-world networks.
To the best of our knowledge, these techniques provide the most efficient
computation strategy for the path-based SOTA problem for general probability
distributions, both with and without preprocessing.Comment: Submission accepted by the International Symposium on Experimental
Algorithms 2016 and published by Springer in the Lecture Notes in Computer
Science series on June 1, 2016. Includes typographical corrections and
modifications to pre-processing made after the initial submission to SODA'15
(July 7, 2014
Novel anisotropic continuum-discrete damage model capable of representing localized failure of massive structures. Part II: identification from tests under heterogeneous stress field
In Part I of this paper we have presented a simple model capable of
describing the localized failure of a massive structure. In this part, we
discuss the identification of the model parameters from two kinds of
experiments: a uniaxial tensile test and a three-point bending test. The former
is used only for illustration of material parameter response dependence, and we
focus mostly upon the latter, discussing the inverse optimization problem for
which the specimen is subjected to a heterogeneous stress field.Comment: 18 pages, 12 figures, 6 table
Exact Computation of Influence Spread by Binary Decision Diagrams
Evaluating influence spread in social networks is a fundamental procedure to
estimate the word-of-mouth effect in viral marketing. There are enormous
studies about this topic; however, under the standard stochastic cascade
models, the exact computation of influence spread is known to be #P-hard. Thus,
the existing studies have used Monte-Carlo simulation-based approximations to
avoid exact computation.
We propose the first algorithm to compute influence spread exactly under the
independent cascade model. The algorithm first constructs binary decision
diagrams (BDDs) for all possible realizations of influence spread, then
computes influence spread by dynamic programming on the constructed BDDs. To
construct the BDDs efficiently, we designed a new frontier-based search-type
procedure. The constructed BDDs can also be used to solve other
influence-spread related problems, such as random sampling without rejection,
conditional influence spread evaluation, dynamic probability update, and
gradient computation for probability optimization problems.
We conducted computational experiments to evaluate the proposed algorithm.
The algorithm successfully computed influence spread on real-world networks
with a hundred edges in a reasonable time, which is quite impossible by the
naive algorithm. We also conducted an experiment to evaluate the accuracy of
the Monte-Carlo simulation-based approximation by comparing exact influence
spread obtained by the proposed algorithm.Comment: WWW'1
- …