Building Hadith ontology to support the authenticity of Isnad

The two fundamental sources of Islamic legislation are Qur’an and Hadith. Hadiths, or prophetic traditions, are narrations originating from the sayings and actions of Prophet Muhammad (peace be upon him). Isnad or Sanad is the chain of narrators attesting to the historical authenticity of a particular Hadith. It helps differentiate between the accepted and rejected Hadiths. In this paper we build a domain specific ontology (Hadith Isnad Ontology) to support the process of authenticating/judging Isnad. We evaluate the ontology through Hadith example and DL-Queries. The developed ontology will be used (in a future work) to automatically generate a suggested judgment of Hadith Isnad

A soa-based e-government data integration

Data Integration presents a core issue in the Palestinian e-Government Technical Framework. The currently used data integration model relies on the Integrated Central Database which lacks quality attributes such as: interoperability and flexibility. We purpose a SOA-based approach for data integration that achieves the above attributes. We present and analyze the current architecture and implementation of the Palestinian e-Government Integrated Central Database model. We transform the current model into a SOA framework that is realized using Enterprise Service Bus (ESB) and Web Services. The proposed framework offers database replication and connectivity functionalities for the Central Database. The proposed framework is evaluated using a scenario-based software architecture evaluation method and proves that it achieves the framework goals of quality attributes: interoperability and flexibility. Moreover, a prototype of the framework is implemented and validates the framework correctness. A specific usage is presented and further proves that the framework accomplishes its functionality and quality attributes

A Report on the “MathBroker” Project for Brokering Mathematical Web Services?

We report on the past achievements and on the current status of a project on the development of a software framework for brokering mathematical services in the Web. The World Wide Web is currently evolving from an infrastructure for delivering static Web pages coded in HTML to an infrastructure for providing dynamic Web services that use XML as the common format for object data and metadata. These services communicate with clients (and other services) using the SOAP protocol [6], their interfaces are described in the Web Service Description Language WSDL [9], their behavior is described by semantic Web technologies like OWL-S [4], interface/behavior descriptions are stored in Web registries such as the one developed by the ebXML initiative [5] that can be queried by clients for lookup of appropriate services. While most Web developers focus on the use of Web service technologies for business applications, projects like our―MathBroker‖ project or the European MONET project [7] aim to support the area of computer mathematics where services provide functionality related to eg computer algebra or automate

Building a SOA-Based Model for Purchase Order Management in E-Commerce Systems

Purchase Order Management (POM) is one of the most popular E-Commerce applications conducted between B2C and B2B systems. In many cases nowadays POM components use integration approaches that lack interoperability and manageability features. The purpose of this paper is to build a SOA based model for POM in E-Commerce system that achieves the goals of interoperability and manageability. In this paper a technical model of POM E-Commerce system is presented and analyzed. A new POM model based on SOA solution is proposed that overcomes the shortcoming of currently used model. The main contribution of this paper is to align a SOA-based model to the B2C and B2B E-Commerce domain

A Framework for Publishing and Discovering Mathematical Web Services

Page 1

Mathematical Services Query Language: Design, Formalization, and Implementation

The Mathematical Services Query Language (MSQL) is a content-based query language developed for querying mathematical descriptions in the form of the Mathematical Services Description Language (MSDL). It provides the user with the ability to query the contents of MSDL documents published in the MathBroker registry. It complements the metadatabased querying facility of the MathBroker registry which facilitates querying of metadata accompanying descriptions published in the registry. In this report, we present the design, the formal definition, and the implementation of MSQL with use-cases and examples demonstrating its usage

Mathematical services query language: Design, formalization

The Mathematical Services Query Language (MSQL) is a content-based query language developed for querying mathematical descriptions in the form of the Mathematical Services Description Language (MSDL). It provides the user with the ability to query the contents of MSDL documents published in the MathBroker registry. It complements the metadata-based querying facility of the MathBroker registry which facilitates querying of metadata accompanying descriptions published in the registry. In this report, we present the design , the formal definition, and the implementation of MSQL with use-cases and examples demonstrating its usage

Reducing communication overhead in a dynamic load sharing algorithm

Little research has been performed to reduce communication overhead, associated with load state information collection, in dynamic load sharing for distributed systems. This is due to the assumption that such overhead can be considered negligible compared to the overhead associated with the transfer of work load [CABR86, MIRC89]. However, this communication overhead is considered to be a major disadvantage of dynamic load sharing [SHIR95]. It may negate the benefits of load sharing and degrade system performance [EAGE86, JUAN86, QIAN94]. Thus, a better dynamic load sharing algorithm must reduce the communication overhead caused by information collection [XU93]. A new load sharing algorithm with reduced communication overhead is presented. It is based on a general approach and a model of distributed control for the coordination among cooperating processes with minimum communication overhead. The approach, as employed by the algorithm, is to replicate (disseminate) the load information of a node to other nodes, to relax the copy consistency constraints resulting from the replication, and to make each node treat the information it has about other nodes, which may be outdated due to unpredictable communication delays, as an estimate of the global state, and hence use it for load sharing decisions. The algorithm incurs less communication overhead than an algorithm based on the bidding approach. The algorithm is distributed, dynamic, nonpreemptive, and cooperative

An Approach for Bandwidth Guarantee in Multi-tenant Cloud Datacenter Network

The rapid development in cloud infrastructure allows cloud providers to offer computing power such as CPU, memory and storage to different customers, and serve multiple tenants at the same time. Unfortunately, due to network nature, cloud provider give no guarantee of network resource allocation to individual VM, relying on the fact that VMs are unlikely to simultaneously maximize their use of their nominally assigned bandwidth. However, many research shows that there is potential for VM to effect each other due to contention on network resource, or as side effect of noisy neighbor, and varying of bandwidth demand across time. Resulting in a severe lack of predictability and fairness of application performances. That cost tenants unpredictable cost and provider loss revenue. Running cloud application without deprecation of performance require cloud provider to offer both computation power and network resource as bundle. The new approach that combine both computing and network resource in one form called virtual data center (VDC), formally known as VDC embedding problem. In this approach, cloud provider should provide tenants with an interface to explicit specifying their bandwidth demand. Cloud provider achieve deterministic bandwidth guarantee by proper placement of tenant VMs and static enforcement of rate limit. However, offering such service to customer is not easy task, and many researchers classify this problem as multiple dimension ben packing problem, which been as NP hard problem