Wenny Rahayu

A Novel Structure and Access Mechanism for Mobile Data Broadcast in Digital Ecosystems

Digital ecosystems offer cost-effective digital services that attract and benefit the species within them (i.e., humans, organizations, and computers). As a cornerstone technology for digital information delivery, data broadcast provides a strong backbone for the digital ecosystem infrastructure. Its scalability feature is highly significant for various digital ecosystem applications, including mobile broadcast services. This paper proposes a novel structure and access for mobile data broadcast. The proposed scheme addresses the tradeoff for minimizing query-access and tuning times by specifying a new message structure. Correspondingly, a new access and processing mode for mobile clients is required. We study the effectiveness of the proposed approach in minimizing query-access time while maintaining low tuning time. The results of our experiments are used to make comparisons with existing approaches. The results affirm the effectiveness of our proposed scheme.

Archetype-based electronic health records: a literature review and evaluation of their applicability to health data interoperability and access.

Health Information Managers (HIMs) are responsible for overseeing health information. The change management necessary during the transition to electronic health records (EHR) is substantial, and ongoing. Archetype-based EHRs are a core health information system component which solve many of the problems that arise during this period of change. Archetypes are models of clinical content, and they have many beneficial properties. They are interoperable, both between settings and through time. They are more amenable to change than conventional paradigms, and their design is congruent with clinical practice. This paper is an overview of the current archetype literature relevant to Health Information Managers. The literature was sourced in the English language sections of ScienceDirect, IEEE Explore, Pubmed, Google Scholar, ACM Digital library and other databases on the usage of archetypes for electronic health record storage, looking at the current areas of archetype research, appropriate usage, and future research. We also used reference lists from the cited papers, papers ref website, and the recommendations from experts in the area. Criteria for inclusion were (a) if studies covered archetype research and (b) were either studies of archetype use, archetype system design, or archetype effectiveness. The 47 papers included show a wide and increasing worldwide archetype usage, in a variety of medical domains. Most of the papers noted that archetypes are an appropriate solution for future-proof and interoperable medical data storage. We conclude that archetypes are a suitable solution for the complex problem of electronic health record storage and interoperability.

A high performance integrated web data warehousing

Abstract Over the years, we have seen a significant number of integration techniques for data warehouses to support web integrated data. However, the existing works focus extensively on the design concept. In this paper, we focus on the performance of a web database application such as an integrated web data warehousing using a well-defined and uniform structure to deal with web information sources including semi-structured data such as XML data, and documents such as HTML in a web data warehouse system. By using a case study, our implementation of the prototype is a web manipulation concept for both incoming sources and result outputs. Thus, the system not only can be operated through the web, it can also handle the integration of web data sources and structured data sources. Our main contribution is the performance evaluation of an integrated web data warehouse application which includes two tasks. Task one is to perform a verification of the correctness of integrated data based on the result set that is retrieved from the web integrated data warehouse system using complex and OLAP queries. The result set is checked against the result set that is retrieved from the existing independent data source systems. Task two is to measure the performance of OLAP or complex query by investigating source operation functions used by these queries to retrieve the data. The information of source operation functions used by each query is obtained using the TKPROF utility.

Data Management in Cloud, Grid and P2P Systems

In this paper, we study and optimize the aggregate query processing in a highly distributed Cloud Data Warehouse, where each database stores a subset of relational data in a star-schema. Existing aggregate query processing algorithms focus on optimizing various query operations but give less importance to communication cost overhead (Two-phase algorithm). However, in cloud architectures, the communication cost overhead is an important factor in query processing. Thus, we consider communication overhead to improve the distributed query processing in such cloud data warehouses. We then design query-processing algorithms by analyzing aggregate operation and eliminating most of the sort and group-by operations with the help of integrity constraints and our proposed storage structures, PK-map and Tuple-index-map. Extensive experiments on PlanetLab cloud machines validate the effectiveness of our proposed framework in improving the response time, reducing node-to-node interdependency, minimizing communication overhead, and reducing database table access required for aggregate query.

Intelligent transport navigation system using LookAhead Continuous KNN

One of the most popular queries in vehicle navigation, continuous k nearest neighbor, has been widely addressed. However, none of them focuses on continuous LookAhead k nearest neighbor. Hence, in this paper, we propose a new approach, called Continuous LookAhead K Nearest Neighbor (CLKNN). CLKNN query is different from the traditional continuous k nearest neighbor, whereby in our CLKNN, mobile users concerns with only the interest points in the forward space of query point according to a predefined moving direction. Interest points, which are behind the moving query point, are not of interest anymore. We propose algorithms for LookAhead KNN as well as Continuous LookAhead KNN. The former is used for static query point, whereas the latter is used for moving query point. Our experiments verify the applicability of the proposed approach to solve queries which involve LookAhead k nearest neighbors continuously.

Validating the distributed ontology framework for deployment onto the semantic grid environment

As the vision of the semantic grid slowly becomes a reality, more and more people start migrating their applications onto the semantic grid environment as grid resources. Their applications have the ability to use a wide range of grid resources as well as have exposure to a larger population of potential users. This paper explores some of the main obstacles that obstruct the deployment of the distributed ontology framework onto the semantic grid environment. The results are a set of validation criteria that can be used to determine if particular systems are ready to be deployed on the semantic grid.

Moving towards a collaborative decision support system for aeronautical data

The recent effort in global information standardization within the aviation industry has triggered an increased need for aviation data to be readily available, accurate and easy for stakeholders to use. Aviation management systems are generally based on old proprietary disparate systems, so there is a growing need for a system which could act as a collaborative decision support system, where the same right data can be provided at the right time to the right users. This system would not only eliminate the need to manually retrieve required information from multiple systems and reduce the possibility of human error, it would also allow the discovery of any hidden knowledge, a task otherwise not possible from separate systems. This paper presents our proposed approach to build an integrated system for data-intensive collaborative decision support. Each stage in the proposed framework is explained, including a section on the performance evaluation of the proposed system.

XML schema design approach

This paper presents a systematic XML Schema design approach which conceptually captures semantics of the problem domain at conceptual level and represents such semantics in XML Schema at schema level. At the conceptual level, objects, their inter‐relationships and constraints are semantically powered by object‐oriented models. At the schema level, these conceptual semantics are comprehensively represented in textbased representation of XML Schema using various schema components and design styles, each of which offers different quality characteristics. Two primary design styles in use are nesting and linking. The nesting design styles are developed based on the choice of schema components and their definition/declaration scopes (global vs. local), whereas the linking design styles use referencing facilities provided by XML Schema and other XML technologies such as XLink and XPointer. With an in‐depth analysis of outstanding problems of existing approaches, the proposed design approach is motivated to help improve the quality and robustness of the XML documents in large‐scale XML‐based applications.

Issues and solutions for running a full year software engineering project for computing majors

This paper identifies the issues in running a full year software engineering project (SE project) for the total cohort of students in the third year and proposes solutions for the problems raised. Mounting such a course requires careful preparation of the project handbook, lecture materials, supporting tutorials, practical lab classes, consultations, and weekly supervision, as well as clearly defined continuous assessment. The response from employers and graduates to the software engineering project has been very positive.

Mediation-Based XML Query Answerability

This paper presents a novel mediation-based query answering approach which allows users (1) to reuse their own predefined queries to retrieve information properly from their local data source, and (2) to reformulate those queries in terms of remote data sources in order to obtain additional relevant information. The problem of structural diversity in XML design (e.g. nesting discrepancy and backward paths) makes it difficult to reformulate the queries. Therefore, we highlight the importance of precise query rewriting using composite concepts and relations of the mediated schema. Our experimental evaluations on real application datasets show that our approach effectively obtains correct answers over a broad diversity of schemas.