Eine SPARQL-Schnittstelle für OData-Services

Enterprise-Resource-Planning-Systeme (ERP-Systeme) bilden für die meisten mittleren und großen Unternehmen einen essentiellen Bestandteil ihrer IT-Landschaft zur Verwaltung von Geschäftsdaten und Geschäftsprozessen. Geschäftsdaten werden in ERP-Systemen in Form von Geschäftsobjekten abgebildet. Ein Geschäftsobjekt kann mehrere Attribute enthalten und über Assoziationen zu anderen Geschäftsobjekten einen Geschäftsobjektgraphen aufspannen. Existierende Schnittstellen ermöglichen die Abfrage von Geschäftsobjekten, insbesondere mit Hinblick auf deren Attribute. Die Abfrage mit Bezug auf ihre Position innerhalb des Geschäftsobjektgraphen ist jedoch über diese Schnittstellen häufig nur sehr schwierig zu realisieren. Zur Vereinfachung solcher Anfragen können semantische Technologien, wie RDF und die graphbasierte Abfragesprache SPARQL, verwendet werden. SPARQL ermöglicht eine wesentlich kompaktere und intuitivere Formulierung von Anfragen gegen Geschäftsobjektgraphen, als es mittels der existierenden Schnittstellen möglich ist. Die Motivation für diese Arbeit ist die Vereinfachung bestimmter Anfragen gegen das im Rahmen dieser Arbeit betrachtete SAP ERP-System unter Verwendung von SPARQL. Zur Speicherung von Geschäftsobjekten kommen in ERP-Systemen typischerweise relationale Datenbanken zum Einsatz. Die Bereitstellung von SPARQL-Endpunkten auf Basis von relationalen Datenbanken ist ein seit längerem untersuchtes Gebiet. Es existieren verschiedene Ansätze und Tools, welche die Anfrage mittels SPARQL erlauben. Aufgrund der Komplexität, der Größe und der Änderungshäufigkeit des ERP-Datenbankschemas können solche Ansätze, die direkt auf dem Datenbankschema aufsetzen, nicht verwendet werden. Ein praktikablerer Ansatz besteht darin, den SPARQL-Endpunkt auf Basis existierender Schnittstellen zu realisieren. Diese sind weniger komplex als das Datenbankschema, da sie die direkte Abfrage von Geschäftsobjekten ermöglichen. Dadurch wird die Definition des Mappings erheblich vereinfacht. Das ERP-System bietet mehrere Schnittstellen an, die sich hinsichtlich des Aufbaus, der Zielsetzung und der verwendeten Technologie unterscheiden. Unter anderem wird eine auf OData basierende Schnittstelle zur Verfügung gestellt. OData ist ein REST-basiertes Protokoll zur Abfrage und Manipulation von Daten. Von den bereitgestellten Schnittstellen weist das OData-Interface gegenüber den anderen Schnittstellen verschiedene Vorteile bei Realisierung eines SPARQL-Endpunktes auf. Es definiert eine Abfragesprache und einen Link-Adressierungsmechanismus, mit dem die zur Beantwortung einer Anfrage benötigten Service-Aufrufe und die zu übertragende Datenmenge erheblich reduziert werden können. Das Ziel dieser Arbeit besteht in der Entwicklung eines Verfahrens zur Realisierung eines SPARQL-Endpunktes auf Basis von OData-Services. Dazu wird zunächst eine Architektur vorgestellt, die als Grundlage für die Implementierung eines entsprechenden Systems dienen kann. Ausgehend von dieser Architektur, werden die durch den aktuellen Forschungsstand noch nicht abgedeckten Bereiche ermittelt. Nach bestem Wissen ist diese Arbeit die erste, welche die Abfrage von OData-Schnittstellen mittels SPARQL untersucht. Dabei wird als Teil dieser Arbeit ein neuartiges Konzept zur semantischen Beschreibung von OData-Services vorgestellt. Dieses ermöglicht die Definition von Abbildungen der von den Services bereitgestellten Daten auf RDF-Graphen. Aufbauend auf den Konzepten zur semantischen Beschreibung wird eine Evaluierungssemantik erarbeitet, welche die Auflösung von Ausdrücken der SPARQL-Algebra gegen semantisch annotierte OData-Services definiert. Dabei werden die Daten aller OData-Services ermittelt, die zur vollständigen Abarbeitung einer Anfrage benötigt werden. Zur Abfrage der relevanten Daten wurden Konzepte zur Erzeugung der entsprechenden OData-URIs entwickelt. Das vorgestellte Verfahren wurde prototypisch implementiert und anhand zweier Anwendungsfälle für die im betrachteten Szenario maßgeblichen Servicemengen evaluiert. Mit den vorgestellten Konzepten besteht nicht nur die Möglichkeit, einen SPARQL-Endpunkt für ein ERP-System zu realisieren, vielmehr kann jede Datenquelle, die eine OData-Schnittstelle anbietet, mittels SPARQL angefragt werden. Dadurch werden große Datenmengen, die bisher für die Verarbeitung mittels semantischer Technologien nicht zugänglich waren, für die Integration mit dem Semantic Web verfügbar gemacht. Insbesondere können auch Datenquellen, deren Integration miteinander bisher nicht oder nur schwierig möglich war, über Systeme zur föderierten Abfrage miteinander integriert werden.

An integrated assessment of resource use strategies in the Borana pastoral system of southern Ethiopia

In the pastoral production systems, mobility remains the main technique used to meet livestock’s fodder requirements. Currently, with growing challenges on the pastoral production systems, there is urgent need for an in-depth understanding of how pastoralists continue to manage their grazing resources and how they determine their mobility strategies. This study examined the Borana pastoralists’ regulation of access to grazing resources, mobility practices and cattle reproductive performances in three pastoral zones of Borana region of southern Ethiopia. The central objective of the study was to contribute to the understanding of pastoral land use strategies at a scale relevant to their management. The study applied a multi-scalar methodological approach that allowed zooming in from communal to individual herd level. Through participatory mapping that applied Google Earth image print out as visual aid, the study revealed that the Borana pastoralists conceptualized their grazing areas as distinctive grazing units with names, borders, and specific characteristics. This knowledge enables the herders to communicate the condition of grazing resources among themselves in a precise way which is important in management of livestock mobility. Analysis of grazing area use from the participatory maps showed that the Borana pastoralists apportion their grazing areas into categories that are accessed at different times of the year (temporal use areas). This re-organization is an attempt by the community to cope with the prevailing constraints which results in fodder shortages especially during the dry periods. The re-organization represents a shift in resource use system, as the previous mobility practice across the ecologically varied zones of the rangelands became severely restricted. Grazing itineraries of 91 cattle herds for over 16 months obtained using the seasonal calendar interviews indicated that in the areas with the severest mobility constraints, the herders spent most of their time in the year round use areas that are within close proximity to the settlements. A significant change in mobility strategy was the disallowing of foora practice by the communities in Dirre and Malbe zones in order to reduce competition. With the reduction in mobility practices, there is a general decline in cattle reproductive parameters with the areas experiencing the severest constraints showing the least favourable reproductive performances. The study concludes that the multi-scalar methodology was well suited to zoom into pastoral grazing management practices from communal to individual herd levels. Also the loss of mobility in the Borana pastoral system affects fulfilment of livestock feed requirements thus resulting in reduced reproductive performances and herd growth potentials. While reversal of the conditions of the situations in the Borana rangelands is practically unfeasible, the findings from this research underscore the need to protect the remaining pastoral lands since the pastoral production system remains the most important livelihood option for the majority of the Borana people. In this regards the study emphasises the need to adopt and domesticate regional and international policy frameworks such as that proposed by the African Union in 2010.

The competitiveness of domestic rice production in East Africa: A domestic resource cost approach in Uganda

The rapid increase of rice imports in sub-Saharan Africa under the unstable situation in the world rice market during the 2000s has made it an important policy target for the countries in the region to increase self-sufficiency in rice in order to enhance food security. Whether domestic rice production can be competitive with imported rice is a serious question in East African countries that lie close, just across the Arabian Sea, to major rice exporting countries in South Asia. This study investigates the international competitiveness of domestic rice production in Uganda in terms of the domestic resource cost ratio. The results show that rainfed rice cultivation, which accounts for 95% of domestic rice production, does not have a comparative advantage with respect to rice imported from Pakistan, the largest supplier of imported rice to Uganda. However, the degree of non-competitiveness is not serious, and a high possibility exists for Uganda’s rainfed rice cultivation to become internationally competitive by improving yield levels by applying more modern inputs and enhancing labour productivity. Irrigated rice cultivation, though very limited in area, is competitive even under the present input-output structure when the cost of irrigation infrastructure is treated as a sunk cost. If the cost of installing irrigation infrastructure and its operation and maintenance is taken into account, the types of irrigation development that are economically feasible are not large-scale irrigation projects, but are small- and microscale projects for lowland rice cultivation and rain-water harvesting for upland rice cultivation.

Intelligence by Design: Principles of Modularity and Coordination for Engineerin

All intelligence relies on search --- for example, the search for an intelligent agent's next action. Search is only likely to succeed in resource-bounded agents if they have already been biased towards finding the right answer. In artificial agents, the primary source of bias is engineering. This dissertation describes an approach, Behavior-Oriented Design (BOD) for engineering complex agents. A complex agent is one that must arbitrate between potentially conflicting goals or behaviors. Behavior-oriented design builds on work in behavior-based and hybrid architectures for agents, and the object oriented approach to software engineering. The primary contributions of this dissertation are: 1.The BOD architecture: a modular architecture with each module providing specialized representations to facilitate learning. This includes one pre-specified module and representation for action selection or behavior arbitration. The specialized representation underlying BOD action selection is Parallel-rooted, Ordered, Slip-stack Hierarchical (POSH) reactive plans. 2.The BOD development process: an iterative process that alternately scales the agent's capabilities then optimizes the agent for simplicity, exploiting tradeoffs between the component representations. This ongoing process for controlling complexity not only provides bias for the behaving agent, but also facilitates its maintenance and extendibility. The secondary contributions of this dissertation include two implementations of POSH action selection, a procedure for identifying useful idioms in agent architectures and using them to distribute knowledge across agent paradigms, several examples of applying BOD idioms to established architectures, an analysis and comparison of the attributes and design trends of a large number of agent architectures, a comparison of biological (particularly mammalian) intelligence to artificial agent architectures, a novel model of primate transitive inference, and many other examples of BOD agents and BOD development.

A Hierarchical Cache Coherent Protocol

As the number of processors in distributed-memory multiprocessors grows, efficiently supporting a shared-memory programming model becomes difficult. We have designed the Protocol for Hierarchical Directories (PHD) to allow shared-memory support for systems containing massive numbers of processors. PHD eliminates bandwidth problems by using a scalable network, decreases hot-spots by not relying on a single point to distribute blocks, and uses a scalable amount of space for its directories. PHD provides a shared-memory model by synthesizing a global shared memory from the local memories of processors. PHD supports sequentially consistent read, write, and test- and-set operations. This thesis also introduces a method of describing locality for hierarchical protocols and employs this method in the derivation of an abstract model of the protocol behavior. An embedded model, based on the work of Johnson[ISCA19], describes the protocol behavior when mapped to a k-ary n-cube. The thesis uses these two models to study the average height in the hierarchy that operations reach, the longest path messages travel, the number of messages that operations generate, the inter-transaction issue time, and the protocol overhead for different locality parameters, degrees of multithreading, and machine sizes. We determine that multithreading is only useful for approximately two to four threads; any additional interleaving does not decrease the overall latency. For small machines and high locality applications, this limitation is due mainly to the length of the running threads. For large machines with medium to low locality, this limitation is due mainly to the protocol overhead being too large. Our study using the embedded model shows that in situations where the run length between references to shared memory is at least an order of magnitude longer than the time to process a single state transition in the protocol, applications exhibit good performance. If separate controllers for processing protocol requests are included, the protocol scales to 32k processor machines as long as the application exhibits hierarchical locality: at least 22% of the global references must be able to be satisfied locally; at most 35% of the global references are allowed to reach the top level of the hierarchy.

Disseny de les pautes per la redacció del protocol de gestió per les aus del PNAE

Aquest projecte té com a objectius: determinar les Directrius a seguir per la futura redacció d’un protocol de gestió de les zones inundables del PNAE, amb la finalitat de potenciar la presència d’aus; determinar les millors condicions d’hàbitat per les poblacions d’aus del PNAE i redactar unes línies de seguiment que permetin d'una banda avaluar si les pautes proposades tindran l’efecte desitjat i d'altra banda que permetin la redacció del protocol de gestió

A DHT-Based Grid Resource Indexing and Discovery Scheme

This paper presents a DHT-based grid resource indexing and discovery (DGRID) approach. With DGRID, resource-information data is stored on its own administrative domain and each domain, represented by an index server, is virtualized to several nodes (virtual servers) subjected to the number of resource types it has. Then, all nodes are arranged as a structured overlay network or distributed hash table (DHT). Comparing to existing grid resource indexing and discovery schemes, the benefits of DGRID include improving the security of domains, increasing the availability of data, and eliminating stale data.

Pla d’actuació contra l’absentisme escolar a Palafrugell: Diagnosi de la realitat socioeducativa i protocol d’actuació contra l’absentisme escolar i la desescolarització

El treball té l’objectiu de dissenyar un protocol d’actuació que contempli aspectes sobre prevenció, detecció i intervenció contra l’absentisme escolar i la desescolarització al municipi. Per a això s’ha desenvolupat una diagnosi municipal d’anàlisi de la realitat sobre el tema, fent èmfasi en la intervenció socioeducativa que s’ha de realitzar per a tractar el fenomen des d’una perspectiva holística i global

Resource dimensioning aspect of heterogeneous traffic with different service requirements: Integration versus segregation

In this paper, we consider the ATM networks in which the virtual path concept is implemented. The question of how to multiplex two or more diverse traffic classes while providing different quality of service requirements is a very complicated open problem. Two distinct options are available: integration and segregation. In an integration approach all the traffic from different connections are multiplexed onto one VP. This implies that the most restrictive QOS requirements must be applied to all services. Therefore, link utilization will be decreased because unnecessarily stringent QOS is provided to all connections. With the segregation approach the problem can be much simplified if different types of traffic are separated by assigning a VP with dedicated resources (buffers and links). Therefore, resources may not be efficiently utilized because no sharing of bandwidth can take place across the VP. The probability that the bandwidth required by the accepted connections exceeds the capacity of the link is evaluated with the probability of congestion (PC). Since the PC can be expressed as the CLP, we shall simply carry out bandwidth allocation using the PC. We first focus on the influence of some parameters (CLP, bit rate and burstiness) on the capacity required by a VP supporting a single traffic class using the new convolution approach. Numerical results are presented both to compare the required capacity and to observe which conditions under each approach are preferred

Asymmetric tunnels in P2MP LSPs as a label space reduction method

The objective of traffic engineering is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization, few works have focused on LSR (label switched router) label space. This paper proposes an algorithm that takes advantage of the MPLS label stack features in order to reduce the number of labels used in LSPs. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The described algorithm sets up NHLFE (next hop label forwarding entry) tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the described algorithm achieves a great reduction factor in the label space. The presented works apply for both types of connections: P2MP (point-to-multipoint) and P2P (point-to-point)

A Label space reduction algorithm for P2MP LSPs using asymmetric tunnels

The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P

COMP3016 Web Technology - Strand 3 "History" Lecture 2

Lecture 1: Contributions of Pre WWW Research: Open Hypermedia Systems Contains Powerpoint Lecture slides and Hypertext Research Papers: Industrial Strength Hypermedia: Requirements for a Large Engineering Enterprise (Malcolm et al. 1991); Towards An Integrated Information Environment With Open Hypermedia Systems (Davis et al. 1992); Unifying Strategies for Web Augmentation (Bouvin 1999); Hyper-G (Adapted from Lowe and Hall); OHP:A Draft Proposal for a Standard Open Hypermedia Protocol (Davis et al. 1996); XML Linking (DeRose 99)

Renssellaer Institute. Jim Hendler. CSCI 4964/COMM 49652 – Web Science. URIs and HTTP.

Slides on URIs and the HTTP protocol

INFO2009 CW2 - Resource and Poster Assignment

specification of resource, poster and individual commentary which make up the poster group assignment