Spatio-Temporal Data Handling for Generic Mobile Geoinformation Systems

Spatiotemporal data mining is the core research topic of geographic information science. In the era of big data, the explosive growth of geographic spatiotemporal data puts forward an urgent demand for spatiotemporal knowledge discovery, which promotes the continuous development of spatiotemporal data mining technology. However, the universal heterogeneity and sparse distribution characteristics of spatiotemporal big data restrict the realization of spatiotemporal data mining algorithms, and significantly affect the description and analysis capabilities of natural and social complex systems. Thus, this paper focuses on the series of bottlenecks faced in the expression and application of heterogeneous and sparsely distributed spatiotemporal data. We systematically summarized the research status and existing problems of several key spatiotemporal mining tasks including missing spatiotemporal data interpolation, sparse spatiotemporal data reconstruction, and spatiotemporal state prediction, condensed four key scientific problems, and gave four corresponding solutions. The proposed methods are expected to enrich the method system in the field of spatiotemporal data mining and improve the quality and application value of spatiotemporal data modeling.

Ab stract—The dynamic management of the sea area use spatiotemporal data is going to be highlighted. Through the analysis of the characteristics of the sea area use data, based on the research of TGIS and the advantages of existing spatio-temporal database model, this paper puts forward a design proposal of the sea area use spatio-temporal database .Focusing on the data organization and data storage management mechanism, the spatio-temporal database is divided into present database, historical database and alternative database. To fulfill the expression requirements for spatial, temporal, attribute information about sea area use data, the multi-table connected patterns is adapted to store the spatiotemporal data. The database also combined the sea lot connection index table to increase the query efficiency of sea area use spatiotemporal data. According to the design proposal of this paper, the storage space and redundancy has been reduced effectively in sea area use spatio-temporal database.

The problem of software aging widely exists in long-running software system, and the solution is software rejuvenation. Traditional software rejuvenation strategy has some deficiencies in solving the software aging problems of web services, for example, the higher failure rate and the poorer stability. Therefore, considering web services may have the correlation, at first we classified web service relationship and analyzed the relationship of web services by using the association mining algorithm; secondly we established and continuously fixed the aging model of web services by using the error back-propagation network to calculate the aging weights of web services. On this basis, based on the analysis of web services’ priority, call frequency and aging states, we calculated the rejuvenation cost, constructed the rejuvenation queue, and proposed an adaptive rejuvenation strategy of related web services. The experiment result showed that, compared with traditional regeneration strategy, this strategy improved the stability and dependability of web services.

When multiple participants work on a workflow that represents a large, collaborative activity, it is important to have a well defined process to determine the portions of the workflow that each participant is responsible for executing. In this paper, we describe a process and related algorithms required to assign tasks in a workflow, to hosts that are willing to carry out the execution of these tasks, and thereby contributing to the completion of the activity. This problem is a stylized form of the multi-processor scheduling algorithm which has been shown to be NP-Hard. Further complicating the issue is that we are targeting our approach to mobile ad hoc networks, where hosts are physically mobile, communication links are frequently interrupted, and spatiotemporal considerations become increasingly important. We describe a distributed approach to task allocation in mobile ad hoc networks that employs heuristics to assign tasks in a workflow to mobile hosts based on their capabilities and their mobility patterns. We have implemented our algorithms in the context of CiAN, a workflow management system (WfMS) supporting collaborations in a mobile environment. In addition, we also present performance data of our algorithm and compare it to naive and brute force approaches.

Workflow technology has been adopted in scientific domains to orchestrate and automate scientific processes in order to facilitate experimentation. Such scientific workflows often involve large data sets and intensive computation that necessitate the use of the Grid, which offers supercomputing power through shared distributed resources. To execute a scientific workflow in the Grid, tasks within the workflow that represent steps in the scientific process are assigned to Grid resources for execution. To ensure efficient execution of the workflow, Grid workflow scheduling is required to manage the allocation of Grid resources. Although many Grid workflow scheduling techniques exist, they are mainly designed for the execution of a single workflow. This is not the case with parameter sweep workflows which focus on parametric study and parameter optimisation. A parameter sweep workflow is executed numerous times with different input parameters in order to determine the effect of each parameter combination on the experiment. While executing multiple instances of a parameter sweep workflow in parallel can reduce the time required for the overall execution, this execution introduces new challenges to Grid workflow scheduling. Not only is a scheduling algorithm that is able to manage multiple workflow instances required, but this algorithm also needs the ability to schedule tasks across multiple workflow instances judiciously, as tasks may require the same set of Grid resources. Without appropriate resource allocation, resource competition problem could arise. In the thesis, we propose a new Grid workflow scheduling technique for parameter sweep workflow called the Besom scheduling algorithm. The scheduling decision of our algorithm is based on the resource dependencies of tasks in the workflow, as well as conventional Grid resource-performance metrics. In addition, the proposed technique is extended to handle loop structures in scientific workflows without using existing loop-unrolling techniques. We evaluate the Besom algorithm under a variety of conditions. A comparison between the simulation results of the Besom algorithm and of the three existing Grid workflow scheduling algorithms shows that the Besom algorithm is able to perform better than the existing algorithms for workflows that have complex structures and that involve overlapping resource dependencies of tasks. The Besom scheduling algorithm advances the ability to schedule parallel execution of parameter sweep workflows in the Grid. The outcomes of this thesis justify continuing research in this area to increase our understanding of scheduling multiple Grid workflow instances and to provide support to those involved in parametric study and scientific workflow management.

At the present, coding sequence (CDS) has been discovered and larger CDS is being revealed frequently. Approaches and related tools have also been developed and upgraded concurrently, especially for phylogenetic tree analysis. This paper proposes an integrated automatic Taverna workflow for the phylogenetic tree inferring analysis using public access web services at European Bioinformatics Institute (EMBL-EBI) and Swiss Institute of Bioinformatics (SIB), and our own deployed local web services. The workflow input is a set of CDS in the Fasta format. The workflow supports 1,000 to 20,000 numbers in bootstrapping replication. The workflow performs the tree inferring such as Parsimony (PARS), Distance Matrix - Neighbor Joining (DIST-NJ), and Maximum Likelihood (ML) algorithms of EMBOSS PHYLIPNEW package based on our proposed Multiple Sequence Alignment (MSA) similarity score. The local web services are implemented and deployed into two types using the Soaplab2 and Apache Axis2 deployment. There are SOAP and Java Web Service (JWS) providing WSDL endpoints to Taverna Workbench, a workflow manager. The workflow has been validated, the performance has been measured, and its results have been verified. Our workflow's execution time is less than ten minutes for inferring a tree with 10,000 replicates of the bootstrapping numbers. This paper proposes a new integrated automatic workflow which will be beneficial to the bioinformaticians with an intermediate level of knowledge and experiences. All local services have been deployed at our portal http://bioservices.sci.psu.ac.th.

© The Author(s), 2019. This article is distributed under the terms of the Creative Commons Attribution License. The definitive version was published in Tanhua, T., Pouliquen, S., Hausman, J., O'Brien, K., Bricher, P., de Bruin, T., Buck, J. J. H., Burger, E. F., Carval, T., Casey, K. S., Diggs, S., Giorgetti, A., Glaves, H., Harscoat, V., Kinkade, D., Muelbert, J. H., Novellino, A., Pfeil, B., Pulsifer, P. L., Van de Putte, A., Robinson, E., Schaap, D., Smirnov, A., Smith, N., Snowden, D., Spears, T., Stall, S., Tacoma, M., Thijsse, P., Tronstad, S., Vandenberghe, T., Wengren, M., Wyborn, L., & Zhao, Z. Ocean FAIR data services. Frontiers in Marine Science, 6, (2019): 440, doi:10.3389/fmars.2019.00440.

The existing Workflow Management Systems, WfMS (ACTIONTm, Xsoft InConcert, Team Ware) show some insufficient due essentially to two factors. First, the enterprises express a real need of WfMS that deal with flexible business processes. These later must adapt to the optimization of enterprises work methods and the evolution of their needs. Second, the enterprises also need of control mechanisms and modeling tools for their WfMS in order to design robust workflow models assuring an efficient and flexible processing of errors and exceptions of execution. In others words, the WfMS must deal with Workflow mining to support Business Processes Re-engineering (BPR). A BPR is a method to improve the effectiveness and efficiency of business processes. Existing propositions in the literature are rather dedicated to the process perspective mining and they neglect the discovering of organizational perspective although it is decisive for the enhancement of existing workflow or the proposing of a new Workflow. The paper addresses the workflow mining by considering the organizational perspective. By organizational perspective, we mean the organizational structures (Federation, Hierarchical, Market and so on) and interaction protocols (Contract net, Auction...) describing respectively the forms of work and the activities allocation process between actors. This paper defends the idea that organizational dimension in multi-agent system is an appropriate approach to discover this organizational perspective since it (i) provides inter-agents communication languages based on performatives which allow capturing the semantic of exchanges between actors, (ii) it introduces organizational structures to highlight the forms of work and (iii) it offers powerful interactions protocols which permit to identify the dynamic organizational structures. First, this paper proposes a Workflow log meta-model which extends the classical one. Then, it provides some algorithms to permit the discovering of the main organizational structures and interaction protocols. Third, it presents the Management process of Water distribution crisis case study to illustrate our approach. Finally, the paper describes the developed prototype, called DiscopFlow, in order to validate the proposed solution.

A concept is introduced in this article which has strong practical impact for computer aided system configuration. System configuration is a cumbersome and fault sensitive task while setting up systems in a broad range of business applications like ERP (enterprise resource planning) and other workflow-systems. Given a generic process or workflow model in YAWL-notation (yet another workflow language) or any other process modeling language like business process model and notation or WFMC (workflow management coalition), it could be stated that, by using a set of reduction rules as introduced, it is possible to generate a hierarchically structured tree of sub graphs of the workflow graph-representation. According to the notation used, authors call these sub graphs facts. The tree structure of the graph-representation on one hand and the logical relation between the branches and leafs of the tree on the other can be utilized to create a set of constraints and dependencies among the single facts. Some researchers showed that the nested branches can be associated to (predefined) questions with respect to the configuration of a workflow management system, for instance an ERP-application. They presented an algorithm which dynamically sorts the questions and answers in a maximum efficient configuration path, while working through the corresponding questionnaire. By combining the different elements as facts, constraints on questions, and configuration space, it is thus possible to algorithmically generate the efficient structured and interactive questionnaire for the configuration of workflow systems and algorithmically check the consistency (dead lock free, free of synchronization structural conflict) of the underlying workflow model. The concept was tested in the prototype of the interactive questionnaire for configuration of the web-service based ERP-Application

The National Nuclear Data Center (NNDC) collects, evaluates, and disseminates nuclear physics data for basic research and applied nuclear technologies. In 2004, the NNDC migrated all databases into modern relational database software, installed new generation of Linux servers and developed new Java‐based Web service. This nuclear database development means much faster, more flexible and more convenient service to all users in the United States. These nuclear reaction and structure database developments as well as related Web services are briefly described.

Grid applications are increasingly being developed as workflows built of well-structured, reusable components. We develop a user-transparent scheduling approach for Higher-Order Components (HOCs) . parallel implementations of typical programming patterns, accessible and customizable via Web services. We introduce a set of cost functions for a reusable scheduling: when the workflow recurs, it is mapped to the same execution nodes, avoiding the need for a repeated scheduling phase. We prove the efficiency of our scheduling by implementing it within the KOALA scheduler and comparing it with KOALA's standard Closeto- File policy. Experiments on scheduling HOC-based applications achieve a 40% speedup in communication and a 100% throughput increase.

Composite Web service design using model-driven approaches has been in use for several years now, but the modelling of transactional properties is still uncommon and has not yet been subject to much research. For a distributed system of autonomous components like Web services, especially when they are used for implementing business processes, transactional guarantees can be of vital importance. In this paper, we propose a model-driven approach which introduces a separate design layer dedicated to transactions. We show that our systematic modelling approach is able to introduce transactions in the design without increasing the complexity of the basic UML diagram. Our approach can also be reused to specify other properties of Web services such as security requirements or workflows in additional layers.

Data Warehouse (DW) is topic-oriented, integrated, static datasets which are used to support decision-making. Driven by the constraint of mass spatio-temporal data management and application, Spatio-Temporal Data Warehouse (STDW) was put forward, and many researchers scattered all over the world focused their energy on it.Although the research on STDW is going in depth , there are still many key difficulties to be solved, such as the design principle, system framework, spatio-temporal data model (STDM), spatio-temporal data process (STDP), spatial data mining (SDM) and etc. In this paper, the concept of STDW is discussed, and analyzes the organization model of spatio-temporal data. Based on the above, a framework of STDW is composed of data layer, management layer and application layer. The functions of STDW should include data analysis besides data process and data storage. When users apply certain kind of data services, STDW identifies the right data by metadata management system, then start data processing tool to form a data product which serves the data mining and OLAP. All varieties of distributed databases (DDBs) make up data sources of STDW, including Digital Elevation Model (DEM), Diagnosis-Related Group (DRG), Data Locator Group (DLG), Data Objects Management (DOM), Place Name and other databases in existence. The management layer implements heterogeneous data processing, metadata management and spatio-temporal data storage. The application layer provides data products service, multidimensional data cube, data mining tools and on-line analytical process.

A considerable amount of data emerging in spatiotemporal applications requires much attention on managing spatiotemporal data both from academia and industry. On the other hand, XML has several excellent characteristics due to its simplicity, readability, and portability. However, although XML has been employed to model and handle spatiotemporal data, the study of spatiotemporal XML data has only recently started and still merits further attention. In this paper, we study spatiotemporal data model for sea surface meteorological data in XML, and then propose marking dictionaries for sea surface meteorological data in XML. The feature of our approach is that our spatiotemporal data model is application-oriented. Moreover, such approach could provide consolidations of application-oriented spatiotemporal models.

Spatio-temporal data is one of the most important assets in the context of smart cities. Spatio-temporal big data comes from a variety of sensor devices, implies the state of urban operation, insight into the development trend. Due to the multidimensional characteristics and diverse analysis needs of spatial-temporal data, data analysis based on spatial-temporal data must take into account the large capacity, diversity and frequent changes of data. This makes spatial and temporal data analysis more difficult. In order to simplify the analysis of spatio-temporal data, a service-oriented intelligent framework is proposed. Firstly, the concept of spatio-temporal data service is introduced into the framework, and several common spatio-temporal data service models are defined. Then, a configurable scripting language was proposed to define the analytic application. We also developed a prototype tool to implement spatio-temporal data services on Hadoop. In order to prove the applicability of our method, we demonstrate the effectiveness of our work through a practical application-based study.