BibTex:

    @Article{OJCC-v1i1n01_Chang,
        title     = {An Introductory Approach to Risk Visualization as a Service},
        author    = {Victor Chang},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {1--9},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194429},
        urn       = {urn:nbn:de:101:1-201705194429},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This paper introduces the Risk Visualization as a Service (RVaaS) and presents the motivation, rationale, methodology, Cloud APIs used, operations and examples of using RVaaS. Risks can be calculated within seconds and presented in the form of Visualization to ensure that unexploited areas are ex-posed. RVaaS operates in two phases. The first phase includes the risk modeling in Black Scholes Model (BSM), creating 3D Visualization and Analysis. The second phase consists of calculating key derivatives such as Delta and Theta for financial modeling. Risks presented in visualization allow the potential investors and stakeholders to keep track of the status of risk with regard to time, prices and volatility. Our approach can improve accuracy and performance. Results in experiments show that RVaaS can perform up to 500,000 simulations and complete all simulations within 24 seconds for time steps of up to 50. We also introduce financial stock market analysis (FSMA) that can fully blend with RVaaS and demonstrate two examples that can help investors make better decision based on the pricing and market volatility information. RVaaS provides a structured way to deploy low cost, high quality risk assessment and support real-time calculations.}
    }

BibTex:

    @Article{OJCC-v1i1n02_Puzio,
        title     = {Block-level De-duplication with Encrypted Data},
        author    = {Pasquale Puzio and
                     Refik Molva and
                     Melek \~{A}�nen and
                     Sergio Loureiro},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {10--18},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194448},
        urn       = {urn:nbn:de:101:1-201705194448},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Deduplication is a storage saving technique which has been adopted by many cloud storage providers such as Dropbox. The simple principle of deduplication is that duplicate data uploaded by different users are stored only once. Unfortunately, deduplication is not compatible with encryption. As a scheme that allows deduplication of encrypted data segments, we propose ClouDedup, a secure and efficient storage service which guarantees blocklevel deduplication and data confidentiality at the same time. ClouDedup strengthens convergent encryption by employing a component that implements an additional encryption operation and an access control mechanism. We also propose to introduce an additional component which is in charge of providing a key management system for data blocks together with the actual deduplication operation. We show that the overhead introduced by these new components is minimal and does not impact the overall storage and computational costs.}
    }

BibTex:

    @Article{OJCC-v1i1n03_Chang,
        title     = {Measuring and analyzing German and Spanish customer satisfaction of using the iPhone 4S Mobile Cloud service},
        author    = {Victor Chang},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {19--26},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194450},
        urn       = {urn:nbn:de:101:1-201705194450},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This paper presents the customer satisfaction analysis for measuring popularity in the Mobile Cloud, which is an emerging area in the Cloud and Big Data Computing. Organizational Sustainability Modeling (OSM) is the proposed method used in this research. The twelve-month of German and Spanish consumer data are used for the analysis to investigate the return and risk status associated with the ratings of customer satisfaction in the iPhone 4S Mobile Cloud services. Results show that there is a decline in the satisfaction ratings in Germany and Spain due to economic downturn and competitions in the market, which support our hypothesis. Key outputs have been explained and they confirm that all analysis and interpretations fulfill the criteria for OSM. The use of statistical and visualization method proposed by OSM can expose unexploited data and allows the stakeholders to understand the status of return and risk of their Cloud strategies easier than the use of other data analysis.}
    }

BibTex:

    @Article{OJDB-v1i1n02_Duchateau,
        title     = {Designing a Benchmark for the Assessment of Schema Matching Tools},
        author    = {Fabien Duchateau and
                     Zohra Bellahsene},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {3--25},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194573},
        urn       = {urn:nbn:de:101:1-201705194573},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Over the years, many schema matching approaches have been developed to discover correspondences between schemas. Although this task is crucial in data integration, its evaluation, both in terms of matching quality and time performance, is still manually performed. Indeed, there is no common platform which gathers a collection of schema matching datasets to fulfil this goal. Another problem deals with the measuring of the post-match effort, a human cost that schema matching approaches aim at reducing. Consequently, we propose XBenchMatch, a schema matching benchmark with available datasets and new measures to evaluate this manual post-match effort and the quality of integrated schemas. We finally report the results obtained by different approaches, namely COMA++, Similarity Flooding and YAM. We show that such a benchmark is required to understand the advantages and failures of schema matching approaches. Therefore, it could help an end-user to select a schema matching tool which covers his/her needs.}
    }

BibTex:

    @Article{OJDB-v1i1n03_Elbushra,
        title     = {Eventual Consistent Databases: State of the Art},
        author    = {Mawahib Musa Elbushra and
                     Jan Lindstr\~{A}�m},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {26--41},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194582},
        urn       = {urn:nbn:de:101:1-201705194582},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {One of the challenges of cloud programming is to achieve the right balance between the availability and consistency in a distributed database. Cloud computing environments, particularly cloud databases, are rapidly increasing in importance, acceptance and usage in major applications, which need the partition-tolerance and availability for scalability purposes, but sacrifice the consistency side (CAP theorem). In these environments, the data accessed by users is stored in a highly available storage system, thus the use of paradigms such as eventual consistency became more widespread. In this paper, we review the state-of-the-art database systems using eventual consistency from both industry and research. Based on this review, we discuss the advantages and disadvantages of eventual consistency, and identify the future research challenges on the databases using eventual consistency.}
    }

BibTex:

    @Article{OJIS-v1i1n02_Kessler,
        title     = {Pattern-sensitive Time-series Anonymization and its Application to Energy-Consumption Data},
        author    = {Stephan Kessler and
                     Erik Buchmann and
                     Thorben Burghardt and
                     Klemens B\~{A}�hm},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {3--22},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194696},
        urn       = {urn:nbn:de:101:1-201705194696},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Time series anonymization is an important problem. One prominent example of time series are energy consumption records, which might reveal details of the daily routine of a household. Existing privacy approaches for time series, e.g., from the field of trajectory anonymization, assume that every single value of a time series contains sensitive information and reduce the data quality very much. In contrast, we consider time series where it is combinations of tuples that represent personal information. We propose (n; l; k)-anonymity, geared to anonymization of time-series data with minimal information loss, assuming that an adversary may learn a few data points. We propose several heuristics to obtain (n; l; k)-anonymity, and we evaluate our approach both with synthetic and real data. Our experiments confirm that it is sufficient to modify time series only moderately in order to fulfill meaningful privacy requirements.}
    }

BibTex:

    @Article{OJIS-v1i1n03_Iivari,
        title     = {Perceived Sociability of Use and Individual Use of Social Networking Sites - A Field Study of Facebook Use in the Arctic},
        author    = {Juhani Iivari},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {23--53},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194708},
        urn       = {urn:nbn:de:101:1-201705194708},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This paper investigates determinants of individual use of social network sites (SNSs). It introduces a new construct, Perceived Sociability of Use (PSOU), to explain the use of such computer mediated communication applications. Based on a field study of 113 Facebook users it shows that PSOU in the sense of maintaining social contacts is a significant predictor of Perceived Benefits (PB), Perceived Enjoyment (PE), attitude toward use and intention to use. Inspired by Benbasat and Barki, this paper also attempts to answer questions "what makes the system useful", "what makes the system enjoyable to use" and "what makes the system sociable to use". As a consequence it pays special focus on systems characteristics of IT applications as potential predictors of PSOU, PB and PE, introducing seven such designable qualities (user-to-user interactivity, user identifiability, system quality, information quality, usability, user-to-system interactivity, and aesthetics). The results indicate that especially satisfaction with user-to-user interactivity is a significant determinant of PSOU, and that satisfactions with six of these seven designable qualities have significant paths in the proposed nomological network.}
    }

BibTex:

    @Article{OJSW-v1i1n02_Garcia,
        title     = {MapReduce-based Solutions for Scalable SPARQL Querying},
        author    = {Jos\~{A}� M. Gim\~{A}�nez-Garcia and
                     Javier D. Fern\~{A}�ndez and
                     Miguel A. Mart\~{A}�nez-Prieto},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {1--18},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194824},
        urn       = {urn:nbn:de:101:1-201705194824},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The use of RDF to expose semantic data on the Web has seen a dramatic increase over the last few years. Nowadays, RDF datasets are so big and rconnected that, in fact, classical mono-node solutions present significant scalability problems when trying to manage big semantic data. MapReduce, a standard framework for distributed processing of great quantities of data, is earning a place among the distributed solutions facing RDF scalability issues. In this article, we survey the most important works addressing RDF management and querying through diverse MapReduce approaches, with a focus on their main strategies, optimizations and results.}
    }

BibTex:

    @Article{OJSW-v1i1n03_Delgado,
        title     = {BioSStore: A Client Interface for a Repository of Semantically Annotated Bioinformatics Web Services},
        author    = {Ismael Navas-Delgado and
                     Jos\~{A}� F. Aldana-Montes},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {19--29},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194836},
        urn       = {urn:nbn:de:101:1-201705194836},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Bioinformatics has shown itself to be a domain in which Web services are being used extensively. In this domain, simple but real services are being developed. Thus, there are huge repositories of real services available (for example BioMOBY main repository includes more than 1500 services). Besides, bioinformatics repositories usually have active communities using and working on improvements. However, these kinds of repositories do not exploit the full potential of Web services (and SOA, Service Oriented Applications, in general). On the other hand, sophisticated technologies have been proposed to improve SOA, including the annotation on Web services to explicitly describe them. However, these approaches are lacking in repositories with real services. In the work presented here, we address the drawbacks present in bioinformatics services and try to improve the current semantic model by introducing the use of the W3C standard Semantic Annotations for WSDL and XML Schema (SAWSDL) and related proposals (WSMO Lite). This paper focuses on a user interface that takes advantage of a repository of semantically annotated bioinformatics Web services. In this way, we exploit semantics for the discovery of Web services, showing how the use of semantics will improve the user searches. The BioSStore is available at http://biosstore.khaos.uma.es. This portal will contain also future developments of this proposal.}
    }

BibTex:

    @Article{OJSW-v1i2n01_Li,
        title     = {Developing Knowledge Models of Social Media: A Case Study on LinkedIn},
        author    = {Jinwu Li and
                     Vincent Wade and
                     Melike Sah},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {1--24},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194841},
        urn       = {urn:nbn:de:101:1-201705194841},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {User Generated Content (UGC) exchanged via large Social Network is considered a very important knowledge source about all aspects of the social engagements (e.g. interests, events, personal information, personal preferences, social experience, skills etc.). However this data is inherently unstructured or semi-structured. In this paper, we describe the results of a case study on LinkedIn Ireland public profiles. The study investigated how the available knowledge could be harvested from LinkedIn in a novel way by developing and applying a reusable knowledge model using linked open data vocabularies and semantic web. In addition, the paper discusses the crawling and data normalisation strategies that we developed, so that high quality metadata could be extracted from the LinkedIn public profiles. Apart from the search engine in LinkedIn.com itself, there are no well known publicly available endpoints that allow users to query knowledge concerning the interests of individuals on LinkedIn. In particular, we present a system that extracts and converts information from raw web pages of LinkedIn public profiles into a machine-readable, interoperable format using data mining and Semantic Web technologies. The outcomes of our research can be summarized as follows: (1) A reusable knowledge model which can represent LinkedIn public users and company profiles using linked data vocabularies and structured data, (2) a public SPARQL endpoint to access structured data about Irish industry and public profiles, (3) a scalable data crawling strategy and mashup based data normalisation approach. The proposed data mining and knowledge representation proposed in this paper are evaluated in four ways: (1) We evaluate metadata quality using automated techniques, such as data completeness and data linkage. (2) Data accuracy is evaluated via user studies. In particular, accuracy is evaluated by comparison of manually entered metadata fields and the metadata which was automatically extracted. (3) User perceived metadata quality is measured by asking users to rate the automatically extracted metadata in user studies. (4) Finally, the paper discusses how the extracted metadata suits for a user interface design. Overall, the evaluations show that the extracted metadata is of high quality and meets the requirements of a data visualisation user interface.}
    }

BibTex:

    @Article{OJWT-v1i1n01_Furini,
        title     = {SIWeb: understanding the Interests of the Society through Web data Analysis},
        author    = {Marco Furini and
                     Simone Montangero},
        journal   = {Open Journal of Web Technologies (OJWT)},
        issn      = {2199-188X},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {1--14},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705291334},
        urn       = {urn:nbn:de:101:1-201705291334},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The high availability of user-generated contents in the Web scenario represents a tremendous asset for understanding various social phenomena. Methods and commercial products that exploit the widespread use of the Web as a way of conveying personal opinions have been proposed, but a critical thinking is that these approaches may produce a partial, or distorted, understanding of the society, because most of them focus on definite scenarios, use specific platforms, base their analysis on the sole magnitude of data, or treat the different Web resources with the same importance. In this paper, we present SIWeb (Social Interests through Web Analysis), a novel mechanism designed to measure the interest the society has on a topic (e.g., a real world phenomenon, an event, a person, a thing). SIWeb is general purpose (it can be applied to any decision making process), cross platforms (it uses the entire Webspace, from social media to websites, from tags to reviews), and time effective (it measures the time correlatio between the Web resources). It uses fractal analysis to detect the temporal relations behind all the Web resources (e.g., Web pages, RSS, newsgroups, etc.) that talk about a topic and combines this number with the temporal relations to give an insight of the the interest the society has about a topic. The evaluation of the proposal shows that SIWeb might be helpful in decision making processes as it reflects the interests the society has on a specific topic.}
    }

BibTex:

    @Article{OJWT-v1i1n02_Belk,
        title     = {Integrating Human Factors and Semantic Mark-ups in Adaptive Interactive Systems},
        author    = {Marios Belk and
                     Panagiotis Germanakos and
                     Efi Papatheocharous and
                     Panayiotis Andreou and
                     George Samaras},
        journal   = {Open Journal of Web Technologies (OJWT)},
        issn      = {2199-188X},
        year      = {2014},
        volume    = {1},
        number    = {1},
        pages     = {15--26},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-2017052611313},
        urn       = {urn:nbn:de:101:1-2017052611313},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This paper focuses on incorporating individual differences in cognitive processing and semantic mark-ups in the context of adaptive interactive systems. In particular, a semantic Web-based adaptation framework is proposed that enables Web content providers to enrich content and functionality of Web environments with semantic mark-ups. The Web content is created using a Web authoring tool and is further processed and reconstructed by an adaptation mechanism based on cognitive factors of users. Main aim of this work is to investigate the added value of personalising content and functionality of Web environments based on the unique cognitive characteristics of users. Accordingly, a user study has been conducted that entailed a psychometric-based survey for extracting the users' cognitive characteristics, combined with a real usage scenario of an existing commercial Web environment that was enriched with semantic mark-ups and personalised based on different adaptation effects. The paper provides interesting insights in the design and development of adaptive interactive systems based on cognitive factors and semantic mark-ups.}
    }

BibTex:

    @Article{OJDB-v1i2n01_Mortensen,
        title     = {Using Business Intelligence to Improve DBA Productivity},
        author    = {Eric A. Mortensen and
                     En Cheng},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {1--16},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194595},
        urn       = {urn:nbn:de:101:1-201705194595},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The amount of data collected and used by companies has grown rapidly in size over the last decade.  Business leaders are now using Business Intelligence (BI) systems to make effective business decisions against large amounts of data. The growth in the size of data has been a major challenge for Database Administrators (DBAs). The increase in the number and size of databases at the speed they have grown has made it difficult for DBA teams to provide the same level of service that the business requires they provide. The methods that DBAs have used in the last several decades can no longer be performed with the efficiency needed over all of the databases they administer. This paper presents the first BI system to improve DBA productivity and providing important data metrics for Information Technology (IT) managers. The BI system has been well received by Sherwin Williams Database Administrators.  It has i) enabled the DBA team to quickly determine which databases needed work by a DBA without manually logging into the system; ii) helped the DBA team and its management to easily answer other business users' questions without using DBAs' time to research the issue; and iii) helped the DBA team to provide the business data for unanticipated audit request.}
    }

BibTex:

    @Article{OJDB-v1i2n02_Abramova,
        title     = {Which NoSQL Database? A Performance Overview},
        author    = {Veronika Abramova and
                     Jorge Bernardino and
                     Pedro Furtado},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {17--24},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194607},
        urn       = {urn:nbn:de:101:1-201705194607},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {NoSQL data stores are widely used to store and retrieve possibly large amounts of data, typically in a key-value format. There are many NoSQL types with different performances, and thus it is important to compare them in terms of performance and verify how the performance is related to the database type. In this paper, we evaluate five most popular NoSQL databases: Cassandra, HBase, MongoDB, OrientDB and Redis. We compare those databases in terms of query performance, based on reads and updates, taking into consideration the typical workloads, as represented by the Yahoo! Cloud Serving Benchmark. This comparison allows users to choose the most appropriate database according to the specific mechanisms and application needs.}
    }

BibTex:

    @Article{OJSW-v1i2n02_Groppe,
        title     = {P-LUPOSDATE: Using Precomputed Bloom Filters to Speed Up SPARQL Processing in the Cloud},
        author    = {Sven Groppe and
                     Thomas Kiencke and
                     Stefan Werner and
                     Dennis Heinrich and
                     Marc Stelzner and
                     Le Gruenwald},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {25--55},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194858},
        urn       = {urn:nbn:de:101:1-201705194858},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Increasingly data on the Web is stored in the form of Semantic Web data. Because of today's information overload, it becomes very important to store and query these big datasets in a scalable way and hence in a distributed fashion. Cloud Computing offers such a distributed environment with dynamic reallocation of computing and storing resources based on needs. In this work we introduce a scalable distributed Semantic Web database in the Cloud. In order to reduce the number of (unnecessary) intermediate results early, we apply bloom filters. Instead of computing bloom filters, a time-consuming task during query processing as it has been done traditionally, we precompute the bloom filters as much as possible and store them in the indices besides the data. The experimental results with data sets up to 1 billion triples show that our approach speeds up query processing significantly and sometimes even reduces the processing time to less than half.}
    }

BibTex:

    @Article{OJWT-v1i2n01_Hoernig,
        title     = {A Comparative Evaluation of Current HTML5 Web Video Implementations},
        author    = {Martin Hoernig and
                     Andreas Bigontina and
                     Bernd Radig},
        journal   = {Open Journal of Web Technologies (OJWT)},
        issn      = {2199-188X},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {1--9},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705291328},
        urn       = {urn:nbn:de:101:1-201705291328},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {HTML5 video is the upcoming standard for playing videos on the World Wide Web. Although its specification has not been fully adopted yet, all major browsers provide the HTML5 video element and web developers already rely on its functionality. But there are differences between implementations and inaccuracies that trouble the web developer community. To help to improve the current situation we draw a comparison between the most important web browsers. We focus on the event mechanism, since it is essential for interacting with the video element. Furthermore, we compare the seeking accuracy, which is relevant for more specialized applications. Our tests reveal varieties of differences between browser interfaces and show that even simple software solutions may still need third-party plugins in today's browsers.}
    }

BibTex:

    @Article{OJCC-v1i2n01_Groppe,
        title     = {A Self-Optimizing Cloud Computing System for Distributed Storage and Processing of Semantic Web Data},
        author    = {Sven Groppe and
                     Johannes Blume and
                     Dennis Heinrich and
                     Stefan Werner},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {1--14},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194478},
        urn       = {urn:nbn:de:101:1-201705194478},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Clouds are dynamic networks of common, off-the-shell computers to build computation farms. The rapid growth of databases in the context of the semantic web requires efficient ways to store and process this data. Using cloud technology for storing and processing Semantic Web data is an obvious way to overcome difficulties in storing and processing the enormously large present and future datasets of the Semantic Web. This paper presents a new approach for storing Semantic Web data, such that operations for the evaluation of Semantic Web queries are more likely to be processed only on local data, instead of using costly distributed operations. An experimental evaluation demonstrates the performance improvements in comparison to a naive distribution of Semantic Web data.}
    }

BibTex:

    @Article{OJCC-2014v1i2n02_Alwabel,
        title     = {Evaluation of Node Failures in Cloud Computing Using Empirical Data},
        author    = {Abdulelah Alwabel and
                     Robert John Walters and
                     Gary B. Wills},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {15--24},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194435},
        urn       = {urn:nbn:de:101:1-201705194435},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Cloud has emerged as a new computing paradigm that promises to move into computing-as-utility era. Desktop Cloud is a new type of Cloud computing introduced to further achieve this ambition with an aim to reduce costs. It merges two computing models: Cloud computing and volunteer computing. The aim of Desktop Cloud is to provide Cloud services out of infrastructure that is not made for this purpose, like PCs and laptops. Such computing resources lead to a high level of volatility as a result of the fact that they can leave without prior knowledge. This paper studies the impact of node failures using evaluation metrics based on real data collected from public archive to simulate failure events in the infrastructure of a Desktop Cloud. The contribution of this paper is: (i) analysing the failure events, (ii) proposing metrics to evaluate Desktop Clouds, and (iii) evaluating several VM allocation mechanisms in the presence of node failures.}
    }

BibTex:

    @Article{OJIS-2014v1i2n01_Stackelberg,
        title     = {Detecting Data-Flow Errors in BPMN 2.0},
        author    = {Silvia von Stackelberg and
                     Susanne Putze and
                     Jutta M\~{A}�lle and
                     Klemens B\~{A}�hm},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {1--19},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-2017052611934},
        urn       = {urn:nbn:de:101:1-2017052611934},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Data-flow errors in BPMN 2.0 process models, such as missing or unused data, lead to undesired process executions. In particular, since BPMN 2.0 with a standardized execution semantics allows specifying alternatives for data as well as optional data, identifying missing or unused data systematically is difficult. In this paper, we propose an approach for detecting data-flow errors in BPMN 2.0 process models. We formalize BPMN process models by mapping them to Petri Nets and unfolding the execution semantics regarding data. We define a set of anti-patterns representing data-flow errors of BPMN 2.0 process models. By employing the anti-patterns, our tool performs model checking for the unfolded Petri Nets. The evaluation shows that it detects all data-flow errors identified by hand, and so improves process quality.}
    }

BibTex:

    @Article{OJIS_2014v1i2n02_Shamoi,
        title     = {Fuzzy Color Space for Apparel Coordination},
        author    = {Pakizar Shamoi and
                     Atsushi Inoue and
                     Hiroharu Kawanaka},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {20--28},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194710},
        urn       = {urn:nbn:de:101:1-201705194710},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Human perception of colors constitutes an important part in color theory. The applications of color science are truly omnipresent, and what impression colors make on human plays a vital role in them. In this paper, we offer the novel approach for color information representation and processing using fuzzy sets and logic theory, which is extremely useful in modeling human impressions. Specifically, we use fuzzy mathematics to partition the gamut of feasible colors in HSI color space based on standard linguistic tags. The proposed method can be useful in various image processing applications involving query processing. We demonstrate its effectivity in the implementation of a framework for the apparel online shopping coordination based on a color scheme. It deserves attention, since there is always some uncertainty inherent in the description of apparels.}
    }

BibTex:

    @Article{OJWT_2014v1i2n02_Kusserow,
        title     = {Getting Indexed by Bibliographic Databases in the Area of Computer Science},
        author    = {Arne Kusserow and
                     Sven Groppe},
        journal   = {Open Journal of Web Technologies (OJWT)},
        issn      = {2199-188X},
        year      = {2014},
        volume    = {1},
        number    = {2},
        pages     = {10--27},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705291343},
        urn       = {urn:nbn:de:101:1-201705291343},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Every author and publisher is interested in adding their publications to the widely used bibliographic databases freely accessible in the world wide web: This ensures the visibility of their publications and hence of the published research. However, the inclusion requirements of publications in the bibliographic databases are heterogeneous even on the technical side. This survey paper aims in shedding light on the various data formats, protocols and technical requirements of getting indexed by widely used bibliographic databases in the area of computer science and provides hints for maximal database inclusion. Furthermore, we point out the possibilities to utilize the data of bibliographic databases, and describes some personal and institutional research repository systems with special regard to the support of inclusion in bibliographic databases.}
    }