A Semantic Grid Oriented to E-Tourism

With increasing complexity of tourism business models and tasks, there is a clear need of the next generation e-Tourism infrastructure to support flexible automation, integration, computation, storage, and collaboration. Currently several enabling technologies such as semantic Web, Web service, agent and grid computing have been applied in the different e-Tourism applications, however there is no a unified framework to be able to integrate all of them. So this paper presents a promising e-Tourism framework based on emerging semantic grid, in which a number of key design issues are discussed including architecture, ontologies structure, semantic reconciliation, service and resource discovery, role based authorization and intelligent agent. The paper finally provides the implementation of the framework.Comment: 12 PAGES, 7 Figure

Bicycle traffic and its interaction with motorized traffic in an agent-based transport simulation framework

Cycling as an inexpensive, healthy, and efficient mode of transport for everyday traveling is becoming increasingly popular. While many cities are promoting cycling, it is rarely included in transport models and systematic policy evaluation procedures. The purpose of this study is to extend the agent-based transport simulation framework MATSim to be able to model bicycle traffic more realistically. The network generation procedure is enriched to include attributes that are relevant for cyclists (e.g. road surfaces, slopes). Travel speed computations, plan scoring, and routing are enhanced to take into account these infrastructure attributes. The scoring, i.e. the evaluation of simulated daily travel plans, is furthermore enhanced to account for traffic events that emerge in the simulation (e.g. passings by cars), which have an additional impact on cyclists’ decisions. Inspired by an evolutionary computing perspective, a randomizing router was implemented to enable cyclists to find realistic routes. It is discussed in detail why this approach is both feasible in practical terms and also conceptually consistent with MATSim’s co-evolutionary simulation approach. It is shown that meaningful simulation results are obtained for an illustrative scenario, which indicates that the developed methods will make real-world scenarios more realistic in terms of the representation of bicycle traffic. Based on the exclusive reliance on open data, the approach is spatially transferable

Modelling trust in semantic web applications

This paper examines some of the barriers to the adoption of car-sharing, termed carpooling in the US, and develops a framework for trusted recommendations. The framework is established on a semantic modelling approach putting forward its suitability to resolving adoption barriers while also highlighting the characteristics of trust that can be exploited. Identification is made of potential vocabularies, ontologies and public social networks which can be used as the basis for deriving direct and indirect trust values in an implementation

A semantic approach to reachability matrix computation

The Cyber Security is a crucial aspect of networks management. The Reachability Matrix computation is one of the main challenge in this field. This paper presents an intelligent solution in order to address the Reachability Matrix computational proble

Towards a Convenient Category of Topological Domains

We propose a category of topological spaces that promises to be convenient for the purposes of domain theory as a mathematical theory for modelling computation. Our notion of convenience presupposes the usual properties of domain theory, e.g. modelling the basic type constructors, fixed points, recursive types, etc. In addition, we seek to model parametric polymorphism, and also to provide a flexible toolkit for modelling computational effects as free algebras for algebraic theories. Our convenient category is obtained as an application of recent work on the remarkable closure conditions of the category of quotients of countably-based topological spaces. Its convenience is a consequence of a connection with realizability models