BibTex:

    @Article{OJDB-2015v2i1n01_Buchmann,
        title     = {Deriving Bounds on the Size of Spatial Areas},
        author    = {Erik Buchmann and
                     Patrick Erik Bradley and
                     Klemens B\~{A}�hm},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {1--16},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194566},
        urn       = {urn:nbn:de:101:1-201705194566},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Many application domains such as surveillance, environmental monitoring or sensor-data processing need upper and lower bounds on areas that are covered by a certain feature. For example, a smart-city infrastructure might need bounds on the size of an area polluted with fine-dust, to re-route combustion-engine traffic. Obtaining such bounds is challenging, because in almost any real-world application, information about the region of interest is incomplete, e.g., the database of sensor data contains only a limited number of samples. Existing approaches cannot provide upper and lower bounds or depend on restrictive assumptions, e.g., the area must be convex. Our approach in turn is based on the natural assumption that it is possible to specify a minimal diameter for the feature in question. Given this assumption, we formally derive bounds on the area size, and we provide algorithms that compute these bounds from a database of sensor data, based on geometrical considerations. We evaluate our algorithms both with a real-world case study and with synthetic data.}
    }

BibTex:

    @Article{OJDB_2015v2i1n02_Elbushra,
        title     = {Causal Consistent Databases},
        author    = {Mawahib Musa Elbushra and
                     Jan Lindstr\~{A}�m},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {17--35},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194619},
        urn       = {urn:nbn:de:101:1-201705194619},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Many consistency criteria have been considered in databases and the causal consistency is one of them. The causal consistency model has gained much attention in recent years because it provides ordering of relative operations. The causal consistency requires that all writes, which are potentially causally related, must be seen in the same order by all processes. The causal consistency is a weaker criteria than the sequential consistency, because there exists an execution, which is causally consistent but not sequentially consistent, however all executions satisfying the sequential consistency are also causally consistent. Furthermore, the causal consistency supports non-blocking operations; i.e. processes may complete read or write operations without waiting for global computation. Therefore, the causal consistency overcomes the primary limit of stronger criteria: communication latency. Additionally, several application semantics are precisely captured by the causal consistency, e.g. collaborative tools. In this paper, we review the state-of-the-art of causal consistent databases, discuss the features, functionalities and applications of the causal consistency model, and systematically compare it with other consistency models. We also discuss the implementation of causal consistency databases and identify limitations of the causal consistency model.}
    }

BibTex:

    @Article{OJCC_2015v2i1n02_Hamid,
        title     = {An Analytical Model of Multi-Core Multi-Cluster Architecture (MCMCA)},
        author    = {Norhazlina Hamid and
                     Robert John Walters and
                     Gary B. Wills},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {4--15},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194487},
        urn       = {urn:nbn:de:101:1-201705194487},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Multi-core clusters have emerged as an important contribution in computing technology for provisioning additional processing power in high performance computing and communications. Multi-core architectures are proposed for their capability to provide higher performance without increasing heat and power usage, which is the main concern in a single-core processor. This paper introduces analytical models of a new architecture for large-scale multi-core clusters to improve the communication performance within the interconnection network. The new architecture will be based on a multi - cluster architecture containing clusters of multi-core processors.}
    }

BibTex:

    @Article{OJIS_2015v2i1n01_Malaga,
        title     = {Using Nuisance Telephone Denial of Service to Combat Online Sex Trafficking},
        author    = {Ross A. Malaga},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {1--8},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194736},
        urn       = {urn:nbn:de:101:1-201705194736},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Over the past few years, sex trafficking has been linked to online classified ads sites such as Craigslist.com and Backpage.com. However, to date technology-based solutions have not been used to attack classified ad sites or the advertisers. This paper proposes and tests a new approach to combating online sex trafficking promulgated via online classified ad sites - nuisance telephone denial of service (TDoS) attacks on the advertisers. The method of attack is described and implications are discussed.}
    }

BibTex:

    @Article{OJIOT_2015v1i1n02_Syarifah,
        title     = {Modelling the Integrated QoS for Wireless Sensor Networks with Heterogeneous Data Traffic},
        author    = {Syarifah Ezdiani and
                     Adnan Al-Anbuky},
        journal   = {Open Journal of Internet Of Things (OJIOT)},
        issn      = {2364-7108},
        year      = {2015},
        volume    = {1},
        number    = {1},
        pages     = {1--15},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201704244946},
        urn       = {urn:nbn:de:101:1-201704244946},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The future of Internet of Things (IoT) is envisaged to consist of a high amount of wireless resource-constrained devices connected to the Internet. Moreover, a lot of novel real-world services offered by IoT devices are realized by wireless sensor networks (WSNs). Integrating WSN to the Internet has therefore brought forward the requirements of an end-to-end quality of service (QoS) guarantee. In this paper, the QoS requirements for the WSN-Internet integration are investigated by first distinguishing the Internet QoS from the WSN QoS. Next, this study emphasizes on WSN applications that involve traffic with different levels of importance, thus the way realtime traffic and delay-tolerant traffic are handled to guarantee QoS in the network is studied. Additionally, an overview of the integration strategies is given, and the delay-tolerant network (DTN) gateway, being one of the desirable approaches for integrating WSNs to the Internet, is discussed. Next, the implementation of the service model is presented, by considering both traffic prioritization and service differentiation. Based on the simulation results in OPNET Modeler, it is observed that real-time traffic achieve low bound delay while delay-tolerant traffic experience a lower packet dropped, hence indicating that the needs of real-time and delay-tolerant traffic can be better met by treating both packet types differently. Furthermore, a vehicular network is used as an example case to describe the applicability of the framework in a real IoT application environment, followed by a discussion on the future work of this research.}
    }

BibTex:

    @Article{OJIOT_2015v1i1n03_Rosa,
        title     = {The Potential of Printed Electronics and Personal Fabrication in Driving the Internet of Things},
        author    = {Paulo Rosa and
                     Ant\~{A}�nio C\~{A}�mara and
                     Cristina Gouveia},
        journal   = {Open Journal of Internet Of Things (OJIOT)},
        issn      = {2364-7108},
        year      = {2015},
        volume    = {1},
        number    = {1},
        pages     = {16--36},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201704244933},
        urn       = {urn:nbn:de:101:1-201704244933},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {In the early nineties, Mark Weiser, a chief scientist at the Xerox Palo Alto Research Center (PARC), wrote a series of seminal papers that introduced the concept of Ubiquitous Computing. Within this vision, computers and others digital technologies are integrated seamlessly into everyday objects and activities, hidden from our senses whenever not used or needed. An important facet of this vision is the interconnectivity of the various physical devices, which creates an Internet of Things. With the advent of Printed Electronics, new ways to link the physical and digital worlds became available. Common printing technologies, such as screen, flexography, and inkjet printing, are now starting to be used not only to mass-produce extremely thin, flexible and cost effective electronic circuits, but also to introduce electronic functionality into objects where it was previously unavailable. In turn, the growing accessibility to Personal Fabrication tools is leading to the democratization of the creation of technology by enabling end-users to design and produce their own material goods according to their needs. This paper presents a survey of commonly used technologies and foreseen applications in the field of Printed Electronics and Personal Fabrication, with emphasis on the potential to drive the Internet of Things.}
    }

BibTex:

    @Article{OJIS_2015v2i1n02_Cunha,
        title     = {IT Governance Practices for Electric Utilities: Insights from Brazil and Europe},
        author    = {Paulo Rupino da Cunha and
                     Luiz Mauricio Martins and
                     Ant\~{A}�o Moura and
                     Ant\~{A}�nio Dias de Figueiredo},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {9--28},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194743},
        urn       = {urn:nbn:de:101:1-201705194743},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {We propose a framework of 14 IT governance practices tailored for the electric utilities sector. They were selected and ranked as "essential", "important", or "good" by top executives and IT staff from two multi-billion dollar companies - one in Brazil and another in Europe - from a generic set of 83 collected in the literature and in the field. Our framework addresses a need of electric utilities for which specific guidance was lacking. We have also uncovered a significant impact of social issues in IT governance, whose depth seems to be missing in the current research. As a byproduct of our work, the larger generic framework from which we have departed and the tailoring method that we have proposed can be used to customize the generic framework to different industries.}
    }

BibTex:

    @Article{OJIS_2015v2i1n03_Hayashi,
        title     = {Relationship between Externalized Knowledge and Evaluation in the Process of Creating Strategic Scenarios},
        author    = {Teruaki Hayashi and
                     Yukio Ohsawa},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {29--40},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194751},
        urn       = {urn:nbn:de:101:1-201705194751},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Social systems are changing so rapidly that it is important for humans to make decisions considering uncertainty. A scenario is information about the series of events/actions, which supports decision makers to take actions and reduce risks. We propose Action Planning for refining simple ideas into practical scenarios (strategic scenarios). Frameworks and items on Action Planning Sheets provide participants with organized constraints, to lead to creative and logical thinking for solving real issues in businesses or daily life. Communication among participants who have preset roles leads the externalization of knowledge. In this study, we set three criteria for evaluating strategic scenarios; novelty, utility, and feasibility, and examine the relationship between externalized knowledge and the evaluation values, in order to consider factors which affect the evaluations. Regarding a word contained in roles and scenarios as the smallest unit of knowledge, we calculate Relativeness between roles and scenarios. The results of our experiment suggest that the lower the relativeness of a strategic scenario, the higher the strategic scenario is evaluated in novelty. In addition, in the evaluation of utility, a scenario satisfying a covert requirement tends to be estimated higher. Moreover, we found the externalization of stakeholders may affect the realization of strategic scenarios.}
    }

BibTex:

    @Article{OJIS_2015v2i2n02_Majchrzak,
        title     = {Achieving Business Practicability of Model-Driven Cross-Platform Apps},
        author    = {Tim A. Majchrzak and
                     Jan Ernsting and
                     Herbert Kuchen},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2015},
        volume    = {2},
        number    = {2},
        pages     = {4--15},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194768},
        urn       = {urn:nbn:de:101:1-201705194768},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Due to the incompatibility of mobile device platforms such as Android and iOS, apps have to be developed separately for each target platform. Cross-platform development approaches based on Web technology have significantly improved over the last years. However, since they do not lead to native apps, these frameworks are not feasible for all kinds of business apps. Moreover, the way apps are developed is cumbersome. Advanced cross-platform approaches such as MD2, which is based on model-driven development (MDSD) techniques, are a much more powerful yet less mature choice. We discuss business implications of MDSD for apps and introduce MD2 as our proposed solution to fulfill typical requirements. Moreover, we highlight a business-oriented enhancement that further increases MD2's business practicability. We generalize our findings and sketch the path towards more versatile MDSD of apps.}
    }

BibTex:

    @Article{OJIS_2015v2i2n03_Nakamura,
        title     = {Concept Design for Creating Essential Hypothesis, Rules, and Goals: Toward a Data Marketplace},
        author    = {Jun Nakamura and
                     Masahiko Teramoto},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2015},
        volume    = {2},
        number    = {2},
        pages     = {16--26},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194774},
        urn       = {urn:nbn:de:101:1-201705194774},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The abductive reasoning model has been discussed in the context of business strategy. However, this model seems unrealistic for applications in the real business world considering the unpredictable, competitive business environment. This study improves the model by formulating an experimental case study through a web-based workplace for generating product ideas. We discuss the possible embodiment of product ideas as the basis for configuring features through the use of dynamic quality function deployment. The entire concept design process is proposed as a blueprint for building a data marketplace.}
    }

BibTex:

    @Article{OJBD_2015v1i1n02_Teli,
        title     = {An Efficient Approach for Cost Optimization of the Movement of Big Data},
        author    = {Prasad Teli and
                     Manoj V. Thomas and
                     K. Chandrasekaran},
        journal   = {Open Journal of Big Data (OJBD)},
        issn      = {2365-029X},
        year      = {2015},
        volume    = {1},
        number    = {1},
        pages     = {4--15},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194335},
        urn       = {urn:nbn:de:101:1-201705194335},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {With the emergence of cloud computing, Big Data has caught the attention of many researchers in the area of cloud computing. As the Volume, Velocity and Variety (3 Vs) of big data are growing exponentially, dealing with them is a big challenge, especially in the cloud environment. Looking at the current trend of the IT sector, cloud computing is mainly used by the service providers to host their applications. A lot of research has been done to improve the network utilization of WAN (Wide Area Network) and it has achieved considerable success over the traditional LAN (Local Area Network) techniques. While dealing with this issue, the major questions of data movement such as from where to where this big data will be moved and also how the data will be moved, have been overlooked. As various applications generating the big data are hosted in geographically distributed data centers, they individually collect large volume of data in the form of application data as well as the logs. This paper mainly focuses on the challenge of moving big data from one data center to other. We provide an efficient algorithm for the optimization of cost in the movement of the big data from one data center to another for offline environment. This approach uses the graph model for data centers in the cloud and results show that the adopted mechanism provides a better solution to minimize the cost for data movement.}
    }

BibTex:

    @Article{OJBD_2015v1i1n03_YR,
        title     = {Cognitive Spam Recognition Using Hadoop and Multicast-Update},
        author    = {Mukund YR and
                     Sunil Sandeep Nayak and
                     K. Chandrasekaran},
        journal   = {Open Journal of Big Data (OJBD)},
        issn      = {2365-029X},
        year      = {2015},
        volume    = {1},
        number    = {1},
        pages     = {16--28},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194340},
        urn       = {urn:nbn:de:101:1-201705194340},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {In today's world of exponentially growing technology, spam is a very common issue faced by users on the internet. Spam not only hinders the performance of a network, but it also wastes space and time, and causes general irritation and presents a multitude of dangers - of viruses, malware, spyware and consequent system failure, identity theft, and other cyber criminal activity. In this context, cognition provides us with a method to help improve the performance of the distributed system. It enables the system to learn what it is supposed to do for different input types as different classifications are made over time and this learning helps it increase its accuracy as time passes. Each system on its own can only do so much learning, because of the limited sample set of inputs that it gets to process. However, in a network, we can make sure that every system knows the different kinds of inputs available and learns what it is supposed to do with a better success rate. Thus, distribution and combination of this cognition across different components of the network leads to an overall improvement in the performance of the system. In this paper, we describe a method to make machines cognitively label spam using Machine Learning and the Naive Bayesian approach. We also present two possible methods of implementation - using a MapReduce Framework (hadoop), and also using messages coupled with a multicast-send based network - with their own subtypes, and the pros and cons of each. We finally present a comparative analysis of the two main methods and provide a basic idea about the usefulness of the two in various different scenarios.}
    }

BibTex:

    @Article{OJIOT_2015v1i2n02_Gaur,
        title     = {Evidential Sensor Data Fusion in a Smart City Environment},
        author    = {Aditya Gaur and
                     Bryan W. Scotney and
                     Gerard P. Parr and
                     Sally I. McClean},
        journal   = {Open Journal of Internet Of Things (OJIOT)},
        issn      = {2364-7108},
        year      = {2015},
        volume    = {1},
        number    = {2},
        pages     = {1--18},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201704244969},
        urn       = {urn:nbn:de:101:1-201704244969},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Wireless sensor networks have increasingly become contributors of very large amounts of data. The recent deployment of wireless sensor networks in Smart City infrastructures have led to very large amounts of data being generated each day across a variety of domains, with applications including environmental monitoring, healthcare monitoring and transport monitoring. The information generated through the wireless sensor nodes has made possible the visualization of a Smart City environment for better living. The Smart City offers intelligent infrastructure and cogitative environment for the elderly and other people living in the Smart society. Different types of sensors are present that help in monitoring inhabitants' behaviour and their interaction with real world objects. To take advantage of the increasing amounts of data, there is a need for new methods and techniques for effective data management and analysis, to generate information that can assist in managing the resources intelligently and dynamically. Through this research a Smart City ontology model is proposed, which addresses the fusion process related to uncertain sensor data using semantic web technologies and Dempster-Shafer uncertainty theory. Based on the information handling methods, such as Dempster-Shafer theory (DST), an equally weighted sum operator and maximization operation, a higher level of contextual information is inferred from the low-level sensor data fusion process. In addition, the proposed ontology model helps in learning new rules that can be used in defining new knowledge in the Smart City system.}
    }

BibTex:

    @Article{OJIS_2015v2i2n04_Ikegami,
        title     = {Model of Creative Thinking Process on Analysis of Handwriting by Digital Pen},
        author    = {Kenshin Ikegami and
                     Yukio Ohsawa},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2015},
        volume    = {2},
        number    = {2},
        pages     = {27--39},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194781},
        urn       = {urn:nbn:de:101:1-201705194781},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {In order to perceive infrequent events as hints for new ideas, it is desired to know and model the process of creating and refining ideas. In this paper, we address this modeling problem experimentally. Firstly, we focus on the relation between thinking time and writing time in handwriting. We observe two types of patterns; one group takes longer time in thinking and shorter in writing, the other takes longer in writing and shorter in thinking. The group having spends longer in writing has shorter time span from one sentence to another than the other group. Backtracking, i.e., the event that  participants return back to their former sheet and modify opinions, is observed more often in the group of longer writing than the other group. In addition, participants in this backtracking group gets higher scores for their ideas on sheets than those in the no-backtracking group. We propose a model of creative thinking by applying Operations of Structure of Intellect. It is inferred that the group of longer writing conducts a series of thinking flow, including divergent thinking, convergent thinking and evaluation. In contrast, the group of longer thinking tends to conduct the two different thinking flow: divergent thinking and evaluation; convergent thinking and evaluation. For making creative ideas, we conduct divergent thinking without evaluation and created a large number of ideas. We conclude that the rotations of divergent thinking, convergent thinking and evaluation increase the frequency of "backtracking" and make the ideas more logical ones.}
    }

BibTex:

    @Article{OJIOT_2015v1i2n03_Cho,
        title     = {Accurate Distance Estimation between Things: A Self-correcting Approach},
        author    = {Ho-sik Cho and
                     Jianxun Ji and
                     Zili Chen and
                     Hyuncheol Park and
                     Wonsuk Lee},
        journal   = {Open Journal of Internet Of Things (OJIOT)},
        issn      = {2364-7108},
        year      = {2015},
        volume    = {1},
        number    = {2},
        pages     = {19--27},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201704244959},
        urn       = {urn:nbn:de:101:1-201704244959},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This paper suggests a method to measure the physical distance between an IoT device (a Thing) and a mobile device (also a Thing) using BLE (Bluetooth Low-Energy profile) interfaces with smaller distance errors. BLE is a well-known technology for the low-power connectivity and suitable for IoT devices as well as for the proximity with the range of several meters. Apple has already adopted the technique and enhanced it to provide subdivided proximity range levels. However, as it is also a variation of RSS-based distance estimation, Apple's iBeacon could only provide immediate, near or far status but not a real and accurate distance. To provide more accurate distance using BLE, this paper introduces additional self-correcting beacon to calibrate the reference distance and mitigate errors from environmental factors. By adopting self-correcting beacon for measuring the distance, the average distance error shows less than 10\% within the range of 1.5 meters. Some considerations are presented to extend the range to be able to get more accurate distances.}
    }

BibTex:

    @Article{OJCC_2015v2i1n01e_Chang,
        title     = {Emerging Software as a Service and Analytics},
        author    = {Victor Chang and
                     Robert John Walters and
                     Gary B. Wills},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {1--3},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194461},
        urn       = {urn:nbn:de:101:1-201705194461},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This special issue of Open Journal of Cloud Computing (OJCC) (www.ronpub.com/journals/ojcc) reports work in the field of emerging software as a service and analytics, and presents innovative approaches to delivering software services in research and enterprise communities. It contains extended versions of papers selected from the international workshop on Emerging Software as a Service and Analytices (ESaaSA) in association with the international conference on cloud computing and serviced science taken place in Barcelona, Spain during April 2014. OJCC is published by RonPub (www.ronpub.com), which is an academic publisher of online, open access, peer-reviewed journals.}
    }

BibTex:

    @Article{OJSW_2015v2i1n02_Kachfah,
        title     = {BEAUFORD: A Benchmark for Evaluation of Formalisation of Definitions in OWL},
        author    = {Cheikh Kacfah Emani and
                     Catarina Ferreira Da Silva and
                     Bruno Fi\~{A}�s and
                     Parisa Ghodous},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {4--15},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194879},
        urn       = {urn:nbn:de:101:1-201705194879},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {In this paper we present BEAUFORD, a benchmark for methods which aim to provide formal expressions of concepts using the natural language (NL) definition of these concepts. Adding formal expressions of concepts to a given ontology allows reasoners to infer more useful pieces of information or to detect inconsistencies in this given ontology. To the best of our knowledge, BEAUFORD is the first benchmark to tackle this ontology enrichment problem. BEAUFORD allows the breaking down of a given formalisation approach by identifying its key features. In addition, BEAUFORD provides strong mechanisms to evaluate efficiently an approach even in case of ambiguity which is a major challenge in formalisation of NL resources. Indeed, BEAUFORD takes into account the fact that a given NL phrase can be formalised in many ways. Hence, it proposes a suitable specification to represent these multiple formalisations. Taking advantage of this specification, BEAUFORD redefines classical precision and recall and introduces other metrics to take into account the fact that there is not only one unique way to formalise a definition. Finally, BEAUFORD comprises a well-suited dataset to concretely judge of the efficiency of methods of formalisation. Using BEAUFORD, current approaches of formalisation of definitions can be compared accurately using a suitable gold standard.}
    }

BibTex:

    @Article{OJBD_2015v1i2n02_Neves,
        title     = {Big Data in the Cloud: A Survey},
        author    = {Pedro Caldeira Neves and
                     Jorge Bernardino},
        journal   = {Open Journal of Big Data (OJBD)},
        issn      = {2365-029X},
        year      = {2015},
        volume    = {1},
        number    = {2},
        pages     = {1--18},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194365},
        urn       = {urn:nbn:de:101:1-201705194365},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Big Data has become a hot topic across several business areas requiring the storage and processing of huge volumes of data. Cloud computing leverages Big Data by providing high storage and processing capabilities and enables corporations to consume resources in a pay-as-you-go model making clouds the optimal environment for storing and processing huge quantities of data. By using virtualized resources, Cloud can scale very easily, be highly available and provide massive storage capacity and processing power. This paper surveys existing databases models to store and process Big Data within a Cloud environment. Particularly, we detail the following traditional NoSQL databases: BigTable, Cassandra, DynamoDB, HBase, Hypertable, and MongoDB. The MapReduce framework and its developments Apache Spark, HaLoop, Twister, and other alternatives such as Apache Giraph, GraphLab, Pregel and MapD - a novel platform that uses GPU processing to accelerate Big Data processing - are also analyzed. Finally, we present two case studies that demonstrate the successful use of Big Data within Cloud environments and the challenges that must be addressed in the future.}
    }

BibTex:

    @Article{OJSW_2015v2i1n03_Blasko,
        title     = {Ontology Evolution Using Ontology Templates},
        author    = {Miroslav Blasko and
                     Petr Kremen and
                     Zdenek Kouba},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {16--29},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194898},
        urn       = {urn:nbn:de:101:1-201705194898},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Evolving ontologies by domain experts is difficult and typically cannot be performed without the assistance of an ontology engineer. This process takes long time and often recurrent modeling errors have to be resolved. This paper proposes a technique for creating controlled ontology evolution scenarios that ensure consistency of the possible ontology evolution and give guarrantees to the domain expert that his/her updates do not cause inconsistency. We introduce ontology templates that formalize the notion of controlled evolution and define ontology template consistency checking service together with a consistency checking algorithm. We prove correctness and demonstate the practical use of the techniques in two scenarios.}
    }

BibTex:

    @Article{OJIS_2015v1i2n01p_Ohsawa,
        title     = {Designing the Market of Data - For Practical Data Sharing via Educational and Innovative Communications},
        author    = {Yukio Ohsawa and
                     Akinori Abe},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2015},
        volume    = {2},
        number    = {2},
        pages     = {1--3},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194720},
        urn       = {urn:nbn:de:101:1-201705194720},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This special issue of Open Journal of Information Systems (OJIS) reports work on designing the market of data for practical data sharing via educational and innovative communications (MoDAT). In the market of data, data are reasonably dealt with sold, opened, or shared based on negotiation. Since last years, we have been aiming at realizing a social environment, where each person feels free to share one's own and others' data for learning the latent value of data without fearing the loss of business opportunities. In the market, data and analysts' knowledge are shared by selling and buying, with reasonably determining the conditions for sharing. People in the market may communicate with each other in order to decide to expose the data as open-source, if the trust of the data provider is expected to be elevated highly due to the contribution to people in the public. Thus the Market of Data means a place where the value of data and knowledge can be externalized. OJIS is published by RonPub (www.ronpub.com), which is an academic publisher of online, open access, peer-reviewed journals.}
    }

BibTex:

    @Article{OJIS_2015v2i2n05_Kushiro,
        title     = {A Toulmin's Framework-Based Method for Design Argumentation of Cyber-Physical Systems},
        author    = {Noriyuki Kushiro and
                     Ryoichi Torikai and
                     Shodai Matsuda and
                     Kunio Takahara},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2015},
        volume    = {2},
        number    = {2},
        pages     = {40--55},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194809},
        urn       = {urn:nbn:de:101:1-201705194809},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The design of cyber-physical systems (CPS) is a promising domain, where the data market is expected to soon penetrate. When engineers focus on only a particular part of data (whether intentionally or not) for establishing a design hypothesis, the design hypothesis may also be supported by data sets in the market. Therefore, the validity of such a design hypothesis cannot be evaluated by the data itself, and can only be accepted by the robustness of the logic behind the design argumentation. Although the validation of the design logic is significant, cognitive aspects (which people have spontaneously) disturb the design argumentation reasoning. Therefore, a design method that overcomes the cognitive aspects is indispensable for the CPS designers. This work proposes a CPS design method using the interaction between logic and data sets with a logic visualization tool, and applies the proposed method to the design of a diagnosis system for semiconductor manufacture. The capability of the proposed method is also discussed and analyzed in this paper.}
    }

BibTex:

    @Article{OJDB_2015v2i1n03_Groppe,
        title     = {PatTrieSort - External String Sorting based on Patricia Tries},
        author    = {Sven Groppe and
                     Dennis Heinrich and
                     Stefan Werner and
                     Christopher Blochwitz and
                     Thilo Pionteck},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {36--50},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194627},
        urn       = {urn:nbn:de:101:1-201705194627},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {External merge sort belongs to the most efficient and widely used algorithms to sort big data: As much data as fits inside is sorted in main memory and afterwards swapped to external storage as so called initial run. After sorting all the data in this way block-wise, the initial runs are merged in a merging phase in order to retrieve the final sorted run containing the completely sorted original data. Patricia tries are one of the most space-efficient ways to store strings especially those with common prefixes. Hence, we propose to use patricia tries for initial run generation in an external merge sort variant, such that initial runs can become large compared to traditional external merge sort using the same main memory size. Furthermore, we store the initial runs as patricia tries instead of lists of sorted strings. As we will show in this paper, patricia tries can be efficiently merged having a superior performance in comparison to merging runs of sorted strings. We complete our discussion with a complexity analysis as well as a comprehensive performance evaluation, where our new approach outperforms traditional external merge sort by a factor of 4 for sorting over 4 billion strings of real world data.}
    }

BibTex:

    @Article{OJWT_2015v2i1n02_Nwohir,
        title     = {Why Is This Link Here? Identifying Academic Web Interlinking Motivations in Nigerian Universities},
        author    = {Anthony Nwohiri},
        journal   = {Open Journal of Web Technologies (OJWT)},
        issn      = {2199-188X},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {4--15},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705291363},
        urn       = {urn:nbn:de:101:1-201705291363},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This paper investigates the university websites of Nigeria, Africa's most populous nation. Its aim is to identify motivations why authors embed outbound hyperlinks on these websites. A classification scheme for academic web interlinking motivations was applied to over 5,000 hyperlinks pointing from the websites of 107 Nigerian universities. Classifying the motivations based on studying the source and target pages is a big challenge, especially due to the following three reasons: there could be many possible reasons available; guessing the true intentions of link creators could be a difficult task; multiple link creation motivations could exist. The pioneer application of Pearson's chi-square test of independence offers a better picture of motivations. The chi-square test identifies the significant differences in interlinking motivations, which are peculiar to Nigerian universities of a particular category (federal, state and private universities). The study is a stepping stone toward further research on feasibility of findings in other developing countries. Results obtained from this research will be of great use for academic webpage developers and web authors, and will modify their work towards improving the use of hyperlinks as one of the major communication tools on the Web.}
    }

BibTex:

    @Article{OJCC_2015v2i2n02_Haselmann,
        title     = {Cooperative Hybrid Cloud Intermediaries - Making Cloud Sourcing Feasible for Small and Medium-sized Enterprises},
        author    = {Till Haselmann and
                     Gottfried Vossen and
                     Stuart Dillon},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2015},
        volume    = {2},
        number    = {2},
        pages     = {4--20},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194494},
        urn       = {urn:nbn:de:101:1-201705194494},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {"The cloud" is widely advertised as a silver bullet for many IT-related challenges of small and medium-sized enterprises (SMEs). While it can potentially have a number of attractive benefits, many SMEs refrain from using cloud sourcing and cloud services because of high upfront costs for building the appropriate knowledge in the enterprise, for searching and screening of possible cloud service providers, and for mastering the intricate legal issues related to outsourcing sensitive data. This paper presents the concept of hybrid cloud intermediaries, an approach that can address many of the prevailing issues. With the aid of empirical findings from a cross-nation study of cloud adoption in SMEs for context, we describe the concept in detail and show conceivable variants, including a comprehensive cross-perspective consolidated model of cloud intermediary value-creation. Subsequently, we analyze the benefits of such a hybrid cloud intermediary for addressing cloud adoption issues in SMEs, and suggest suitable governance structures based on the cooperative paradigm. The resulting entity - a cooperative hybrid cloud intermediary or, more concisely, co-op cloud - is discussed in detail showing both feasible scenarios and limitations for SMEs that would like to engage in a cloud-sourcing.}
    }

BibTex:

    @Article{OJCC_2015v2i2n03_Thomas,
        title     = {A Trust-Based Approach for Management of Dynamic QoS Violations in Cloud Federation Environments},
        author    = {Manoj V. Thomas and
                     K. Chandrasekaran},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2015},
        volume    = {2},
        number    = {2},
        pages     = {21--43},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194523},
        urn       = {urn:nbn:de:101:1-201705194523},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Cloud Federation is an emerging technology where Cloud Service Providers (CSPs) offering specialized services to customers collaborate in order to reap the real benefits of Cloud Computing. When a CSP in the Cloud Federation runs out of resources, it can get the required resources from other partners in the federation. Normally, there will be QoS agreements between the partners in the federation for the resource sharing. In this paper, we propose a trust based mechanism for the management of dynamic QoS violations, when one CSP requests resources from another CSP in the federation. In this work, we have implemented the partner selection process, when one CSP does not have enough resources, using the Analytic Hierarchy Process (AHP) and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) methods, and also considering the trust values of various CSPs in the federation. We have also implemented the Single Sign-On (SSO) authentication in the cloud federation using the Fully Hashed Menezes-Qu-Vanstone (FHMQV) protocol and AES-256 algorithm. The proposed trust-based approach is used to dynamically manage the QoS violations among the partners in the federation. We have implemented the proposed approach using the CloudSim toolkit, and the analysis of the results are also given.}
    }

BibTex:

    @Article{OJCC_2015v2i2n01e_Groppe,
        title     = {Advances in Cloud and Ubiquitous Computing},
        author    = {Sven Groppe and
                     K. Chandrasekaran},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2015},
        volume    = {2},
        number    = {2},
        pages     = {1--3},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201704229173},
        urn       = {urn:nbn:de:101:1-201704229173},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Cloud computing provides on-demand access to a shared pool of configurable and dynamically reallocated computing resources typically located in third-party data centers. Ubiquitous computing aims at providing computing resources anytime and everywhere by using any device, in any location, and in any format. This special issue, Advances in Cloud and Ubiquitous Computing (ACUC), aims at addressing the challenges and reporting the latest research findings in the fields of Cloud computing and Ubiquitous Computing respectively, and how new technologies of Cloud Computing and Ubiquitous Computing complete each other.}
    }

BibTex:

    @Article{OJWT_2015v2i1n03_Kawahara,
        title     = {Detecting Vital Documents in Massive Data Streams},
        author    = {Shun Kawahara and
                     Kazuhiro Seki and
                     Kuniaki Uehara},
        journal   = {Open Journal of Web Technologies (OJWT)},
        issn      = {2199-188X},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {16--26},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705291373},
        urn       = {urn:nbn:de:101:1-201705291373},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Existing knowledge bases, includingWikipedia, are typically written and maintained by a group of voluntary editors. Meanwhile, numerous web documents are being published partly due to the popularization of online news and social media. Some of the web documents, called "vital documents", contain novel information that should be taken into account in updating articles of the knowledge bases. However, it is practically impossible for the editors to manually monitor all the relevant web documents. Consequently, there is a considerable time lag between an edit to knowledge base and the publication dates of such vital documents. This paper proposes a realtime detection framework of web documents containing novel information flowing in massive document streams. The framework consists of twostep filter using statistical language models. Further, the framework is implemented on the distributed and faulttolerant realtime computation system, Apache Storm, in order to process the large number of web documents. On a publicly available web document data set, the TREC KBA Stream Corpus, the validity of the proposed framework is demonstrated in terms of the detection performance and processing time.}
    }

BibTex:

    @Article{OJSW_2015v2i1n04_Groppe,
        title     = {Distributed Join Approaches for W3C-Conform SPARQL Endpoints},
        author    = {Sven Groppe and
                     Dennis Heinrich and
                     Stefan Werner},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {30--52},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194910},
        urn       = {urn:nbn:de:101:1-201705194910},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Currently many SPARQL endpoints are freely available and accessible without any costs to users: Everyone can submit SPARQL queries to SPARQL endpoints via a standardized protocol, where the queries are processed on the datasets of the SPARQL endpoints and the query results are sent back to the user in a standardized format. As these distributed execution environments for semantic big data (as intersection of semantic data and big data) are freely accessible, the Semantic Web is an ideal playground for big data research. However, when utilizing these distributed execution environments, questions about the performance arise. Especially when several datasets (locally and those residing in SPARQL endpoints) need to be combined, distributed joins need to be computed. In this work we give an overview of the various possibilities of distributed join processing in SPARQL endpoints, which follow the SPARQL specification and hence are "W3C conform". We also introduce new distributed join approaches as variants of the Bitvector-Join and combination of the Semi- and Bitvector-Join. Finally we compare all the existing and newly proposed distributed join approaches for W3C conform SPARQL endpoints in an extensive experimental evaluation.}
    }

BibTex:

    @Article{OJWT_2015v2i1n04_Majchrzak,
        title     = {Context-Dependent Testing of Applications for Mobile Devices},
        author    = {Tim A. Majchrzak and
                     Matthias Schulte},
        journal   = {Open Journal of Web Technologies (OJWT)},
        issn      = {2199-188X},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {27--39},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705291390},
        urn       = {urn:nbn:de:101:1-201705291390},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Applications propel the versatility of mobile devices. Apps enable the realization of new ideas and greatly contribute to the proliferation of mobile computing. Unfortunately, software quality of apps often is low. This at least partly can be attributed to problems with testing them. However, it is not a lack of techniques or tools that make app testing cumbersome. Rather, frequent context changes have to be dealt with. Mobile devices most notably move: network parameters such as latency and usable bandwidth change, along with data read from sensors such as GPS coordinates. Additionally, usage patterns vary. To address context changes in testing, we propose a novel concept. It is based on identifying blocks of code between which context changes are possible. It helps to greatly reduce complexity. Besides introducing our concept, we present a use case, show its application and benefits, and discuss challenges.}
    }

BibTex:

    @Article{OJBD_2015v1i2n03_YuehzeLi,
        title     = {Statistical Machine Learning in Brain State Classification using EEG Data},
        author    = {Yuezhe Li and
                     Yuchou Chang and
                     Hong Lin},
        journal   = {Open Journal of Big Data (OJBD)},
        issn      = {2365-029X},
        year      = {2015},
        volume    = {1},
        number    = {2},
        pages     = {19--33},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194354},
        urn       = {urn:nbn:de:101:1-201705194354},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {In this article, we discuss how to use a variety of machine learning methods, e.g. tree bagging, random forest, boost, support vector machine, and Gaussian mixture model, for building classifiers for electroencephalogram (EEG) data, which is collected from different brain states on different subjects. Also, we discuss how training data size influences misclassification rate. Moreover, the number of subjects that contributes to the training data affects misclassification rate. Furthermore, we discuss how sample entropy contributes to building a classifier. Our results show that classification based on sample entropy give the smallest misclassification rate. Moreover, two data sets were collected from one channel and seven channels respectively. The classification results of each data set show that the more channels we use, the less misclassification we have. Our results show that it is promising to build a self-adaptive classification system by using EEG data to distinguish idle from active state.}
    }

BibTex:

    @Article{OJBD_2015v1i2n04_UjjalMarjit,
        title     = {Data Transfers in Hadoop: A Comparative Study},
        author    = {Ujjal Marjit and
                     Kumar Sharma and
                     Puspendu Mandal},
        journal   = {Open Journal of Big Data (OJBD)},
        issn      = {2365-029X},
        year      = {2015},
        volume    = {1},
        number    = {2},
        pages     = {34--46},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194373},
        urn       = {urn:nbn:de:101:1-201705194373},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Hadoop is an open source framework for processing large amounts of data in distributed computing environment. It plays an important role in processing and analyzing the Big Data. This framework is used for storing data on large clusters of commodity hardware. Data input and output to and from Hadoop is an indispensable action for any data processing job. At present, many tools have been evolved for importing and exporting Data in Hadoop. In this article, some commonly used tools for importing and exporting data have been emphasized. Moreover, a state-of-the-art comparative study among the various tools has been made. With this study, it has been decided that where to use one tool over the other with emphasis on the data transfer to and from Hadoop system. This article also discusses about how Hadoop handles backup and disaster recovery along with some open research questions in terms of Big Data transfer when dealing with cloud-based services.}
    }

BibTex:

    @Article{OJCC_2015v2i1n03_Skala,
        title     = {Scalable Distributed Computing Hierarchy: Cloud, Fog and Dew Computing},
        author    = {Karolj Skala and
                     Davor Davidovic and
                     Enis Afgan and
                     Ivan Sovic and
                     Zorislav Sojat},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2015},
        volume    = {2},
        number    = {1},
        pages     = {16--24},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194519},
        urn       = {urn:nbn:de:101:1-201705194519},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The paper considers the conceptual approach for organization of the vertical hierarchical links between the scalable distributed computing paradigms: Cloud Computing, Fog Computing and Dew Computing. In this paper, the Dew Computing is described and recognized as a new structural layer in the existing distributed computing hierarchy. In the existing computing hierarchy, the Dew computing is positioned as the ground level for the Cloud and Fog computing paradigms. Vertical, complementary, hierarchical division from Cloud to Dew Computing satisfies the needs of high- and low-end computing demands in everyday life and work. These new computing paradigms lower the cost and improve the performance, particularly for concepts and applications such as the Internet of Things (IoT) and the Internet of Everything (IoE). In addition, the Dew computing paradigm will require new programming models that will efficiently reduce the complexity and improve the productivity and usability of scalable distributed computing, following the principles of High-Productivity computing.}
    }

BibTex:

    @Article{OJIS_2016v3i1n02_Marinette,
        title     = {A NoSQL-Based Framework for Managing Home Services},
        author    = {Marinette Bouet and
                     Michel Schneider},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {1--28},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194810},
        urn       = {urn:nbn:de:101:1-201705194810},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Individuals and companies have an increasing need for services by specialized suppliers in their homes or premises. These services can be quite different and can require different amounts of resources. Service suppliers have to specify the activities to be performed, plan those activities, allocate resources, follow up after their completion and must be able to react to any unexpected situation. Various proposals were formulated to model and implement these functions; however, there is no unified approach that can improve the efficiency of software solutions to enable economy of scale. In this paper, we propose a framework that a service supplier can use to manage geo-localized activities. The proposed framework is based on a NoSQL data model and implemented using the MongoDB system. We also discuss the advantages and drawbacks of a NoSQL approach.}
    }

BibTex:

    @Article{OJDB_2016v3i1n01_Menninghaus,
        title     = {High-Dimensional Spatio-Temporal Indexing},
        author    = {Mathias Menninghaus and
                     Martin Breunig and
                     Elke Pulverm\~{A}�ller},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {1--20},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194635},
        urn       = {urn:nbn:de:101:1-201705194635},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {There exist numerous indexing methods which handle either spatio-temporal or high-dimensional data well. However, those indexing methods which handle spatio-temporal data well have certain drawbacks when confronted with high-dimensional data. As the most efficient spatio-temporal indexing methods are based on the R-tree and its variants, they face the well known problems in high-dimensional space. Furthermore, most high-dimensional indexing methods try to reduce the number of dimensions in the data being indexed and compress the information given by all dimensions into few dimensions but are not able to store now - relative data. One of the most efficient high-dimensional indexing methods, the Pyramid Technique, is able to handle high-dimensional point-data only. Nonetheless, we take this technique and extend it such that it is able to handle spatio-temporal data as well. We introduce a technique for querying in this structure with spatio-temporal queries. We compare our technique, the Spatio-Temporal Pyramid Adapter (STPA), to the RST-tree for in-memory and on-disk applications. We show that for high dimensions, the extra query-cost for reducing the dimensionality in the Pyramid Technique is clearly exceeded by the rising query-cost in the RST-tree. Concluding, we address the main drawbacks and advantages of our technique.}
    }

BibTex:

    @Article{OJIS_2016v3i1n02_Harwardt,
        title     = {Criteria of Successful IT Projects from Management's Perspective},
        author    = {Mark Harwardt},
        journal   = {Open Journal of Information Systems (OJIS)},
        issn      = {2198-9281},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {29--54},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194797},
        urn       = {urn:nbn:de:101:1-201705194797},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The aim of this paper is to compile a model of IT project success from management's perspective. Therefore, a qualitative research approach is proposed by interviewing IT managers on how their companies evaluate the success of IT projects. The evaluation of the survey provides fourteen success criteria and four success dimensions. This paper also thoroughly analyzes which of these criteria the management considers especially important and which ones are being missed in daily practice. Additionally, it attempts to identify the relevance of the discovered criteria and dimensions with regard to the determination of IT project success. It becomes evident here that the old-fashioned Iron Triangle still plays a leading role, but some long-term strategical criteria, such as value of the project, customer perspective or impact on the organization, have meanwhile caught up or pulled even.}
    }

BibTex:

    @Article{OJCC_2016v3i1n02_YingweiWang,
        title     = {Definition and Categorization of Dew Computing},
        author    = {Yingwei Wang},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {1--7},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194546},
        urn       = {urn:nbn:de:101:1-201705194546},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Dew computing is an emerging new research area and has great potentials in applications. In this paper, we propose a revised definition of dew computing. The new definition is: Dew computing is an on-premises computer software-hardware organization paradigm in the cloud computing environment where the on-premises computer provides functionality that is independent of cloud services and is also collaborative with cloud services. The goal of dew computing is to fully realize the potentials of on-premises computers and cloud services. This definition emphasizes two key features of dew computing: independence and collaboration. Furthermore, we propose a group of dew computing categories. These categories may inspire new applications.}
    }

BibTex:

    @Article{OJDB_2016v3i1n02_Werner,
        title     = {Runtime Adaptive Hybrid Query Engine based on FPGAs},
        author    = {Stefan Werner and
                     Dennis Heinrich and
                     Sven Groppe and
                     Christopher Blochwitz and
                     Thilo Pionteck},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {21--41},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194645},
        urn       = {urn:nbn:de:101:1-201705194645},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This paper presents the fully integrated hardware-accelerated query engine for large-scale datasets in the context of Semantic Web databases. As queries are typically unknown at design time, a static approach is not feasible and not flexible to cover a wide range of queries at system runtime. Therefore, we introduce a runtime reconfigurable accelerator based on a Field Programmable Gate Array (FPGA), which transparently incorporates with the freely available Semantic Web database LUPOSDATE. At system runtime, the proposed approach dynamically generates an optimized hardware accelerator in terms of an FPGA configuration for each individual query and transparently retrieves the query result to be displayed to the user. During hardware-accelerated execution the host supplies triple data to the FPGA and retrieves the results from the FPGA via PCIe interface. The benefits and limitations are evaluated on large-scale synthetic datasets with up to 260 million triples as well as the widely known Billion Triples Challenge.	}
    }

BibTex:

    @Article{OJWT_2016v3i1n02_Meghini,
        title     = {Query Processing in a P2P Network of Taxonomy-based Information Sources},
        author    = {Carlo Meghini and
                     Anastasia Analyti},
        journal   = {Open Journal of Web Technologies (OJWT)},
        issn      = {2199-188X},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {1--25},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705291402},
        urn       = {urn:nbn:de:101:1-201705291402},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {In this study we address the problem of answering queries over a peer-to-peer system of taxonomy-based sources. A taxonomy states subsumption relationships between negation-free DNF formulas on terms and negation-free conjunctions of terms. To the end of laying the foundations of our study, we first consider the centralized case, deriving the complexity of the decision problem and of query evaluation. We conclude by presenting an algorithm that is efficient in data complexity and is based on hypergraphs. We then move to the distributed case, and introduce a logical model of a network of taxonomy-based sources. On such network, a distributed version of the centralized algorithm is then presented, based on a message passing paradigm, and its correctness is proved. We finally discuss optimization issues, and relate our work to the literature.}
    }

BibTex:

    @Article{OJIOT_2016v2i1n02_Yamaguchi,
        title     = {A 24 GHz FM-CW Radar System for Detecting Closed Multiple Targets and Its Applications in Actual Scenes},
        author    = {Kazuhiro Yamaguchi and
                     Mitumasa Saito and
                     Takuya Akiyama and
                     Tomohiro Kobayashi and
                     Naoki Ginoza and
                     Hideaki Matsue},
        journal   = {Open Journal of Internet Of Things (OJIOT)},
        issn      = {2364-7108},
        year      = {2016},
        volume    = {2},
        number    = {1},
        pages     = {1--15},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201704245003},
        urn       = {urn:nbn:de:101:1-201704245003},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {This paper develops a 24 GHz band FM-CW radar system to detect closed multiple targets in a small displacement environment, and its performance is analyzed by computer simulation. The FM-CW radar system uses a differential detection method for removing any signals from background objects and uses a tunable FIR filtering in signal processing for detecting multiple targets. The differential detection method enables the correct detection of both the distance and small displacement at the same time for each target at the FM-CW radar according to the received signals. The basic performance of the FM-CW radar system is analyzed by computer simulation, and the distance and small displacement of a single target are measured in field experiments. The computer simulations are carried out for evaluating the proposed detection method with tunable FIR filtering for the FM-CW radar and for analyzing the performance according to the parameters in a closed multiple targets environment. The results of simulation show that our 24 GHz band FM-CW radar with the proposed detection method can effectively detect both the distance and the small displacement for each target in multiple moving targets environments. Moreover, we develop an IoT-based application for monitoring several targets at the same time in actual scenes.}
    }

BibTex:

    @Article{OJSW_2016v3i1n01_Peixoto,
        title     = {Hierarchical Multi-Label Classification Using Web Reasoning for Large Datasets},
        author    = {Rafael Peixoto and
                     Thomas Hassan and
                     Christophe Cruz and
                     Aur\~{A}�lie Bertaux and
                     Nuno Silva},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {1--15},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194907},
        urn       = {urn:nbn:de:101:1-201705194907},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Extracting valuable data among large volumes of data is one of the main challenges in Big Data. In this paper, a Hierarchical Multi-Label Classification process called Semantic HMC is presented. This process aims to extract valuable data from very large data sources, by automatically learning a label hierarchy and classifying data items.The Semantic HMC process is composed of five scalable steps, namely Indexation, Vectorization, Hierarchization, Resolution and Realization. The first three steps construct automatically a label hierarchy from statistical analysis of data. This paper focuses on the last two steps which perform item classification according to the label hierarchy. The process is implemented as a scalable and distributed application, and deployed on a Big Data platform. A quality evaluation is described, which compares the approach with multi-label classification algorithms from the state of the art dedicated to the same goal. The Semantic HMC approach outperforms state of the art approaches in some areas.}
    }

BibTex:

    @Article{OJSW_2016v3i1n02_Tatu,
        title     = {A Semantic Question Answering Framework for Large Data Sets},
        author    = {Marta Tatu and
                     Mithun Balakrishna and
                     Steven Werner and
                     Tatiana Erekhinskaya and
                     Dan Moldovan},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {16--31},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194921},
        urn       = {urn:nbn:de:101:1-201705194921},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Traditionally, the task of answering natural language questions has involved a keyword-based document retrieval step, followed by in-depth processing of candidate answer documents and paragraphs. This post-processing uses semantics to various degrees. In this article, we describe a purely semantic question answering (QA) framework for large document collections. Our high-precision approach transforms the semantic knowledge extracted from natural language texts into a language-agnostic RDF representation and indexes it into a scalable triplestore. In order to facilitate easy access to the information stored in the RDF semantic index, a user's natural language questions are translated into SPARQL queries that return precise answers back to the user. The robustness of this framework is ensured by the natural language reasoning performed on the RDF store, by the query relaxation procedures, and the answer ranking techniques. The improvements in performance over a regular free text search index-based question answering engine prove that QA systems can benefit greatly from the addition and consumption of deep semantic information.}
    }

BibTex:

    @Article{OJSW_2016v3i1n03_Smid,
        title     = {OnGIS: Semantic Query Broker for Heterogeneous Geospatial Data Sources},
        author    = {Marek Smid and
                     Petr Kremen},
        journal   = {Open Journal of Semantic Web (OJSW)},
        issn      = {2199-336X},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {32--50},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194936},
        urn       = {urn:nbn:de:101:1-201705194936},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Querying geospatial data from multiple heterogeneous sources backed by different management technologies poses an interesting problem in the data integration and in the subsequent result interpretation. This paper proposes broker techniques for answering a user's complex spatial query: finding relevant data sources (from a catalogue of data sources) capable of answering the query, eventually splitting the query and finding relevant data sources for the query parts, when no single source suffices. For the purpose, we describe each source with a set of prototypical queries that are algorithmically arranged into a lattice, which makes searching efficient. The proposed algorithms leverage GeoSPARQL query containment enhanced with OWL 2 QL semantics. A prototype is implemented in a system called OnGIS.}
    }

BibTex:

    @Article{OJBD_2016v2i101_Moon,
        title     = {Conformance of Social Media as Barometer of Public Engagement},
        author    = {Songchun Moon},
        journal   = {Open Journal of Big Data (OJBD)},
        issn      = {2365-029X},
        year      = {2016},
        volume    = {2},
        number    = {1},
        pages     = {1--10},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194393},
        urn       = {urn:nbn:de:101:1-201705194393},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {There have been continuously a number of expectations: Social media may play a role of indicator that shows the degree of engagement and preference of choices of users toward music or movies. However, finding appropriate software tools in the market to verify this sort of expectation is too costly and complicated in their natures, and this causes a number of difficulties to attempt technical experimentation. A convenient and easy tool to facilitate such experimentation was developed in this study and was used successfully for performing various measurements with regard to user engagement in music and movies.}
    }

BibTex:

    @Article{OJDB_2016v3i1n03_Koch,
        title     = {XML-based Execution Plan Format (XEP)},
        author    = {Christoph Koch},
        journal   = {Open Journal of Databases (OJDB)},
        issn      = {2199-3459},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {42--52},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194654},
        urn       = {urn:nbn:de:101:1-201705194654},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Execution plan analysis is one of the most common SQL tuning tasks performed by relational database administrators and developers. Currently each database management system (DBMS) provides its own execution plan format, which supports system-specific details for execution plans and contains inherent plan operators. This makes SQL tuning a challenging issue. Firstly, administrators and developers often work with more than one DBMS and thus have to rethink among different plan formats. In addition, the analysis tools of execution plans only support single DBMSs, or they have to implement separate logic to handle each specific plan format of different DBMSs. To address these problems, this paper proposes an XML-based Execution Plan format (XEP), aiming to standardize the representation of execution plans of relational DBMSs. Two approaches are developed for transforming DBMS-specific execution plans into XEP format. They have been successfully evaluated for IBM DB2, Oracle Database and Microsoft SQL.}
    }

BibTex:

    @Article{OJCC_2016v3i1n02_Fisher,
        title     = {Doing More with the Dew: A New Approach to Cloud-Dew Architecture},
        author    = {David Edward Fisher and
                     Shuhui Yang},
        journal   = {Open Journal of Cloud Computing (OJCC)},
        issn      = {2199-1987},
        year      = {2016},
        volume    = {3},
        number    = {1},
        pages     = {8--19},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194535},
        urn       = {urn:nbn:de:101:1-201705194535},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {While the popularity of cloud computing is exploding, a new network computing paradigm is just beginning. In this paper, we examine this exciting area of research known as dew computing and propose a new design of cloud-dew architecture. Instead of hosting only one dew server on a user's PC - as adopted in the current dewsite application - our design promotes the hosting of multiple dew servers instead, one for each installed domain. Our design intends to improve upon existing cloud-dew architecture by providing significantly increased freedom in dewsite development, while also automating the chore of managing dewsite content based on the user's interests and browsing habits. Other noteworthy benefits, all at no added cost to dewsite users, are briefly explored as well.}
    }

BibTex:

    @Article{OJIOT-2016v2i1n02_Aubonnet,
        title     = {Controlled Components for Internet of Things As-A-Service},
        author    = {Tatiana Aubonnet and
                     Amina Boubendir and
                     Fr\~{A}�d\~{A}�ric Lemoine and
                     N\~{A}�emie Simoni},
        journal   = {Open Journal of Internet Of Things (OJIOT)},
        issn      = {2364-7108},
        year      = {2016},
        volume    = {2},
        number    = {1},
        pages     = {16--33},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201704244995},
        urn       = {urn:nbn:de:101:1-201704244995},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {In order to facilitate developers willing to create future Internet of Things (IoT) services incorporating the nonfunctional aspects, we introduce an approach and an environment based on controlled components. Our approach allows developers to design an IoT "as-a-service", to build the service composition and to manage it. This is important, because the IoT allows us to observe and understand the real world in order to have decision-making information to act on reality. It is important to make sure that all these components work according to their mission, i.e. their Quality of Service (QoS) contract. Our environment provides the modeling, generates Architecture Description Language (ADL) formats, and uses them in the implementation phase on an open-source platform.}
    }

BibTex:

    @Article{OJBD_2016v2i1n02_Groppe,
        title     = {Constructing Large-Scale Semantic Web Indices for the Six RDF Collation Orders},
        author    = {Sven Groppe and
                     Dennis Heinrich and
                     Christopher Blochwitz and
                     Thilo Pionteck},
        journal   = {Open Journal of Big Data (OJBD)},
        issn      = {2365-029X},
        year      = {2016},
        volume    = {2},
        number    = {1},
        pages     = {11--25},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194418},
        urn       = {urn:nbn:de:101:1-201705194418},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {The Semantic Web community collects masses of valuable and publicly available RDF data in order to drive the success story of the Semantic Web. Efficient processing of these datasets requires their indexing. Semantic Web indices make use of the simple data model of RDF: The basic concept of RDF is the triple, which hence has only 6 different collation orders. On the one hand having 6 collation orders indexed fast merge joins (consuming the sorted input of the indices) can be applied as much as possible during query processing. On the other hand constructing the indices for 6 different collation orders is very time-consuming for large-scale datasets. Hence the focus of this paper is the efficient Semantic Web index construction for large-scale datasets on today's multi-core computers. We complete our discussion with a comprehensive performance evaluation, where our approach efficiently constructs the indices of over 1 billion triples of real world data.}
    }

BibTex:

    @Article{OJBD_2016v2i1n03e_Chang,
        title     = {New Areas of Contributions and New Addition of Security},
        author    = {Victor Chang},
        journal   = {Open Journal of Big Data (OJBD)},
        issn      = {2365-029X},
        year      = {2016},
        volume    = {2},
        number    = {1},
        pages     = {26--28},
        url       = {http://nbn-resolving.de/urn:nbn:de:101:1-201705194405},
        urn       = {urn:nbn:de:101:1-201705194405},
        publisher = {RonPub},
        bibsource = {RonPub},
        abstract = {Open Journal of Big Data (OJBD) (www.ronpub.com/ojbd) is an open access journal, which addresses the aspects of Big Data, including new methodologies, processes, case studies, poofs-of-concept, scientific demonstrations, industrial applications and adoption. This editorial presents two articles published in the first issue of the second volume of OJBD. The first article is about the investigation of social media for the public engagement. The second article looks into large-scale semantic web indices for six RDF collation orders. OJBD has an increasingly improved reputation thanks to the support of research communities. We will set up the Second International Conference on Internet of Things, Big Data and Security (IoTBDS 2017), in Porto, Portugal, between 24 and 26 April 2017. OJBD is published by RonPub (www.ronpub.com), which is an academic publisher of online, open access, peer-reviewed journals.}
    }