GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Wiley  (6)
  • 2015-2019  (6)
  • Mathematics  (6)
Material
Publisher
  • Wiley  (6)
Language
Years
  • 2015-2019  (6)
Year
Subjects(RVK)
  • Mathematics  (6)
RVK
  • 1
    Online Resource
    Online Resource
    Wiley ; 2018
    In:  Software: Practice and Experience Vol. 48, No. 4 ( 2018-04), p. 775-795
    In: Software: Practice and Experience, Wiley, Vol. 48, No. 4 ( 2018-04), p. 775-795
    Abstract: Workflow temporal violations, namely, intermediate workflow runtime delays, often occur and have a serious impact on the on‐time completion of massive concurrent requests. Therefore, accurate prediction of cloud workflow temporal violations is critical as its result can serve as an essential reference for temporal violation prevention and handling strategies. Conventional studies mainly focus on the time delays of a single workflow activity or a single workflow instance but overlook the propagation of time delays among them. This is a serious problem as time delays can propagate in cloud workflow system due to resource sharing and the dependencies among workflow activities. This paper first proposes a novel temporal violation transmission model inspired by an epidemic model to model the dynamics of time delay propagation. Afterward, a novel temporal violation prediction strategy is presented to estimate the number of temporal violations that may occur and determine the number of violations that must be handled to achieve the target service‐level agreement, namely, the on‐time completion rate. To the best of our knowledge, this is the first attempt to predict cloud workflow temporal violations at the workflow build‐time stage by analyzing the propagation of temporal violations. Experimental results demonstrate that our strategy can make highly accurate predictions and is scalable for a large batch of parallel workflows running in the cloud.
    Type of Medium: Online Resource
    ISSN: 0038-0644 , 1097-024X
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2018
    detail.hit.zdb_id: 120252-2
    detail.hit.zdb_id: 1500326-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Wiley ; 2018
    In:  Concurrency and Computation: Practice and Experience Vol. 30, No. 20 ( 2018-10-25)
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 30, No. 20 ( 2018-10-25)
    Abstract: Bus and subway service is an important public transportation. Besides the major goal of carrying passengers around, providing accurate and reliable travel information for passengers is also an important business consideration. The route and its traveling time can directly affect the number of people choosing the line. Traditional approaches to obtain route and its traveling time rely on historical experience, which are both non‐scalable and incomplete. The wide adoptions of On Board Units (OBUs) in public transportation provide new opportunities. In this paper, we associate bus GPS data with station locations to derive the traveling time between two stations and make a short forecast. To our best knowledge, this is the first paper that utilizes real‐time bus GPS data and subway arrival station data to design route and give its traveling time for a passenger.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2018
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Wiley ; 2017
    In:  Software: Practice and Experience Vol. 47, No. 8 ( 2017-08), p. 1081-1094
    In: Software: Practice and Experience, Wiley, Vol. 47, No. 8 ( 2017-08), p. 1081-1094
    Abstract: As a well‐known field of big data applications, smart city takes advantage of massive data analysis to achieve efficient management and sustainable development in the current worldwide urbanization process. An important problem in smart city is how to discover frequent trajectory sequence pattern and cluster trajectory. To solve this problem, this paper proposes a cloud‐based taxi trajectory pattern mining and trajectory clustering framework for smart city. Our work mainly includes (1) preprocessing raw Global Positioning System trace by calling the Baidu API Geocoding; (2) proposing a distributed trajectory pattern mining (DTPM) algorithm based on Spark ; and (3) proposing a distributed trajectory clustering (DTC) algorithm based on Spark . The proposed DTPM algorithm and DTC algorithm can overcome the high input/output overhead and communication overhead by adopting in‐memory computation. In addition, the proposed DTPM algorithm can avoid generating redundant local trajectory patterns to significantly improve the overall performance. The proposed DTC algorithm can enhance the performance of trajectory similarity computation by transforming the trajectory similarity calculation into AND and OR operators. Experimental results indicate that DTPM algorithm and DTC algorithm can significantly improve the overall performance and scalability of trajectory pattern mining and trajectory clustering on massive taxi trace data. Copyright © 2016 John Wiley & Sons, Ltd.
    Type of Medium: Online Resource
    ISSN: 0038-0644 , 1097-024X
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2017
    detail.hit.zdb_id: 120252-2
    detail.hit.zdb_id: 1500326-7
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Wiley ; 2019
    In:  Concurrency and Computation: Practice and Experience Vol. 31, No. 23 ( 2019-12-10)
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 31, No. 23 ( 2019-12-10)
    Abstract: Graph is one of the most important data structures to model social networks and becomes popular to find interesting relationships between individuals. Since graphs may contain sensitive information, data curators usually need to anonymize the graph before publication to prevent individual re‐identification, which thus leads to plenty of anonymized graphs for data sharing and exploration. However, the new structures and properties of anonymized graphs make the traditional graph indexing method inefficient or even invalid for query processing. To address the subgraph query problem over anonymized graph database, in this paper, we first introduce basic concepts about anonymized graphs and subgraph queries, then propose an index structure named Closure + ‐tree to process the subgraph query efficiently. In particular, graphs were organized hierarchically that each node is an union of its child nodes under some specified mapping functions. During the processing of subgraph queries, the whole graph descendants will be pruned if their union does not contain the query graph. To evaluate the performance of our proposed Closure + ‐tree, extensive experiments are performed on both real and synthetic graph data sets. The experimental results revealed that our index structure can prune up to 80% unqualified graphs with variable size of queries. Furthermore, the size of our index structure is only around a quarter of the entire anonymized graph data set, which indicates good scalability over large data sets.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2019
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Wiley ; 2015
    In:  Concurrency and Computation: Practice and Experience Vol. 27, No. 15 ( 2015-10), p. 3961-3981
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 27, No. 15 ( 2015-10), p. 3961-3981
    Abstract: The precise prediction of bus routes or the arrival time of buses for a traveler can enhance the quality of bus service. However, many social factors influence people's preferences for taking buses. These social factors may include heavy traffic cost, traffic congestion, poor air quality and so forth. Existing prediction techniques rarely consider social sensing when predicting the bus arrival time. Accordingly, this paper proposes a social sensing enhanced service for predicting bus routes, which integrates sensing ability and social networks to understand and measure the influence between social events and vehicle velocity. We focus on the analysis of two different attributions: PT service quality attributions PEA s and road condition attributions PRCA s. Both of them synthesize the social sensing in their evaluation of bus routes. PEA represents individual preferences and PRCA represents physical factors that significantly influence vehicle velocity. Bus relevant social events were further categorized into PEA events or PRCA events. PEA s of buses were scored according to the tendency of bus conditions reflected in social events. Furthermore, an artificial neural network prediction model is established to estimate the bus travel time. Copyright © 2015 John Wiley & Sons, Ltd.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2015
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Wiley ; 2016
    In:  Concurrency and Computation: Practice and Experience Vol. 28, No. 14 ( 2016-09-25), p. 3830-3843
    In: Concurrency and Computation: Practice and Experience, Wiley, Vol. 28, No. 14 ( 2016-09-25), p. 3830-3843
    Abstract: Long‐running stream applications usually share the same fundamental computational infrastructure. To improve the efficiency of data processing in stream processing systems, a data analysis operator could be partitioned into n parallel tasks. The partitioned tasks are usually deployed on m nodes coexisting with other application operators. Because the node performance can vary in unpredictable ways (i.e., (1) stream input rates may fluctuate and (2) computational resource availability varies as other applications are affected), the nodes have different processing steps, and the slow node determines the operator performance. Hence, the tasks should be redistributed at runtime for stream applications to meet their strict latency requirements. Our key idea is to redistribute the tasks to the best node dynamically adaptive to resource or load fluctuations. In this paper, we present a runtime‐aware adaptive schedule mechanism that aims at minimizing the operator processing latency and minimizing the latency difference between different nodes' tasks. We propose a new abstraction called performance cost ratio (PCR) that evaluates the node performance. The higher the node's PCR is, the less cost the node will pay for processing one tuple, and the more tasks should be deployed on it. In a scheduling, we first sort tasks descendingly by their loads and sort nodes by their PCR. Then we reassign the amount of computation according to the node's PCR to keep the node's PCR and its input rate the same or in similar proportion in all PCRs. The PCR‐based quantitative algorithm applies itself to make tasks loads quantized to the processing capacity of nodes, move the minimum amount of operator's tasks, and keep the tasks local at the same time. We have implemented a runtime‐aware adaptive scheduler as an extension to Storm and evaluated this strategy. We achieve the optimization goal using less computational resources. Copyright © 2015 John Wiley & Sons, Ltd.
    Type of Medium: Online Resource
    ISSN: 1532-0626 , 1532-0634
    URL: Issue
    RVK:
    Language: English
    Publisher: Wiley
    Publication Date: 2016
    detail.hit.zdb_id: 2052606-4
    SSG: 11
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...