Semantic based aspect-oriented programming for context-aware Web service composition
An aspect-oriented programming (AOP) based approach is proposed to perform context-aware service composition on the fly. It realises context-aware composition by semantically weaving context into Web service composition. The context weaver algorithm is ...
Reliable distributed data stream management in mobile environments
The proliferation of sensor technology, especially in the context of embedded systems, has brought forward novel types of applications that make use of streams of continuously generated sensor data. Many applications like telemonitoring in healthcare or ...
Pyracanthus: A scalable solution for DHT-independent content-based publish/subscribe data networks
We study the problems associated with building large-scale, content-based, publish/subscribe networks. In particular, we focus on network-independent solutions, in an effort to isolate and bypass the difficult problems of ensuring the desirable ...
Demaq/Transscale: Automated distribution and scalability for declarative applications
The goal of the Demaq/TransScale system is to automate the distribution of applications to multiple hosts. Today, in order to create highly scalable architectures, developers have to manually restructure the application logic, creating balanced ...
A model and architecture for open cross-media annotation and link services
Over the last decade, we have seen a tremendous increase in the number of digital media types that we deal with as part of our daily work. While the Web with its linking functionality was originally designed for organizing information in the form of ...
The dark side of the Internet: Attacks, costs and responses
The Internet and Web technologies have originally been developed assuming an ideal world where all users are honorable. However, the dark side has emerged and bedeviled the world. This includes spam, malware, hacking, phishing, denial of service attacks,...
Suffix trees for inputs larger than main memory
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current methods for constructing suffix trees do not scale for large inputs. As suffix ...
Checking determinism of XML Schema content models in optimal time
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors vulnerable to exponential resource needs by pathological schemas, and we ...
A hybrid approach for estimating document frequencies in unstructured P2P networks
Scalable search and retrieval over numerous web document collections distributed across different sites can be achieved by adopting a peer-to-peer (P2P) communication model. Terms and their document frequencies are the main components of text ...
