ORCID Profile
0000-0002-4408-1952
Current Organisation
Macquarie University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Information Systems | Database Management | Interorganisational Information Systems and Web Services | Pattern Recognition and Data Mining | Conceptual Modelling | Artificial Intelligence and Image Processing | Global Information Systems | Information Systems Development Methodologies | Distributed Computing | Data mining and knowledge discovery | Conceptual Modelling | Graph social and multimedia data | Web Technologies (excl. Web Search) | Database systems | Business Information Management (incl. Records, Knowledge and Information Management, and Intelligence) | Data management and data science | Database Management
Information Processing Services (incl. Data Entry and Capture) | Application Tools and System Utilities | Information processing services | Application tools and system utilities | Computer software and services not elsewhere classified | Application Software Packages (excl. Computer Games) | Expanding Knowledge in the Information and Computing Sciences | Computer Software and Services not elsewhere classified | Information Services not elsewhere classified | Expanding Knowledge in Technology | Electronic Information Storage and Retrieval Services |
Publisher: IEEE
Date: 10-2006
DOI: 10.1109/EDOC.2006.19
Publisher: Springer Science and Business Media LLC
Date: 06-10-2017
Publisher: ACM
Date: 11-02-2022
Publisher: IEEE
Date: 10-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: IEEE
Date: 07-2010
Publisher: Informa UK Limited
Date: 11-2008
Publisher: IEEE
Date: 07-2007
Publisher: Springer International Publishing
Date: 2018
Publisher: IEEE
Date: 07-2012
Publisher: IEEE
Date: 07-2019
Publisher: IEEE
Date: 07-2007
Publisher: IEEE Comput. Soc
Date: 2000
Publisher: IEEE
Date: 12-2015
Publisher: Springer Singapore
Date: 2020
Publisher: Springer Science and Business Media LLC
Date: 23-10-2019
Publisher: IEEE Comput. Soc
Date: 2002
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11596141_6
Publisher: IEEE
Date: 04-2023
Publisher: Springer International Publishing
Date: 2014
Publisher: Elsevier BV
Date: 03-2001
Publisher: Springer Science and Business Media LLC
Date: 09-01-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Association for Computing Machinery (ACM)
Date: 30-09-2019
DOI: 10.1145/3340268
Abstract: Unlabeled, multi-view data presents a considerable challenge in many real-world data analysis tasks. These data are worth exploring because they often contain complementary information that improves the quality of the analysis results. Clustering with multi-view data is a particularly challenging problem as revealing the complex data structures between many feature spaces demands discriminative features that are specific to the task and, when too few of these features are present, performance suffers. Extreme learning machines (ELMs) are an emerging form of learning model that have shown an outstanding representation ability and superior performance in a range of different learning tasks. Motivated by the promise of this advancement, we have developed a novel multi-view fusion clustering framework based on an ELM, called MVEC. MVEC learns the embeddings from each view of the data via the ELM network, then constructs a single unified embedding according to the correlations and dependencies between each embedding and automatically weighting the contribution of each. This process exposes the underlying clustering structures embedded within multi-view data with a high degree of accuracy. A simple yet efficient solution is also provided to solve the optimization problem within MVEC. Experiments and comparisons on eight different benchmarks from different domains confirm MVEC’s clustering accuracy.
Publisher: IEEE
Date: 07-2008
DOI: 10.1109/SCC.2008.75
Publisher: IEEE
Date: 10-2017
DOI: 10.1109/EDOC.2017.11
Publisher: Springer International Publishing
Date: 2022
Publisher: Association for Computing Machinery (ACM)
Date: 21-06-2021
DOI: 10.1145/3427912
Abstract: The merging boundaries between edge computing and deep learning are forging a new blueprint for the Internet of Things (IoT). However, the low-quality of data in many IoT platforms, especially those composed of heterogeneous devices, is hindering the development of high-quality applications for those platforms. The solution presented in this article is intelligent data collaboration, i.e., the concept of deep learning providing IoT with the ability to adaptively collaborate to accomplish a task. Here, we outline the concept of intelligent data collaboration in detail and present a mathematical model in general form. To demonstrate one possible case where intelligent data collaboration would be useful, we prepared an implementation called adaptive data cleaning (ADC), designed to filter noisy data out of temperature readings in an IoT base station network. ADC primarily consists of a denoising autoencoder LSTM for predictions and a four-level data processing mechanism to perform the filtering. Comparisons between ADC and a maximum slop method show ADC with the lowest false error and the best filtering rates.
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer International Publishing
Date: 2019
Publisher: IEEE
Date: 02-05-2022
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 07-2023
Publisher: Elsevier BV
Date: 06-2006
Publisher: Elsevier BV
Date: 10-2023
Publisher: Springer International Publishing
Date: 2015
Publisher: IEEE Comput. Soc
Date: 2002
Publisher: IEEE
Date: 2005
DOI: 10.1109/SCC.2005.37
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2020
Publisher: IEEE
Date: 07-2009
Publisher: IEEE
Date: 09-2008
Publisher: IEEE
Date: 10-2015
DOI: 10.1109/CBD.2015.14
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2021
Publisher: Elsevier BV
Date: 04-2004
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Springer Nature Singapore
Date: 2023
Publisher: IEEE
Date: 06-2015
DOI: 10.1109/SCC.2015.97
Publisher: IGI Global
Date: 2010
DOI: 10.4018/978-1-60566-669-3.CH011
Abstract: The IT infrastructure of organizations must be agile and dynamic in order to respond quickly to the new business models and requirements. This has led to an increasing demand from in idual organizations for corporate business services that can easily adapt to changes through business collaboration. Popular solutions for business collaboration development and management do not properly cater for the specification of new collaborations nor do they facilitate the management of existing ones. In this book chapter we present a rule based approach for collaboration development and management. The proposed approach allows organizations to capture the requirements for their business collaborations in an explicit, manageable and uniform manner in the form of rules. These rules can then be used to drive and constrain the development and management of needed business collaboration models. Practical feasibility of the approach is demonstrated in the context of a complex insurance claim scenario using prototype tooling.
Publisher: ACM
Date: 10-07-2023
Publisher: Elsevier BV
Date: 05-2011
Publisher: ACM
Date: 20-01-2020
Publisher: ACM
Date: 27-02-2023
Publisher: Association for Computing Machinery (ACM)
Date: 07-03-2022
DOI: 10.1145/3474379
Abstract: With the development of e-commerce, fraud behaviors have been becoming one of the biggest threats to the e-commerce business. Fraud behaviors seriously damage the ranking system of e-commerce platforms and adversely influence the shopping experience of users. It is of great practical value to detect fraud behaviors on e-commerce platforms. However, the task is non-trivial, since the adversarial action taken by fraudsters. Existing fraud detection systems used in the e-commerce industry easily suffer from performance decay and can not adapt to the upgrade of fraud patterns, as they take already known fraud behaviors as supervision information to detect other suspicious behaviors. In this article, we propose a competitive graph neural networks (CGNN)-based fraud detection system (eFraudCom) to detect fraud behaviors at one of the largest e-commerce platforms, “Taobao” 1 . In the eFraudCom system, (1) the competitive graph neural networks (CGNN) as the core part of eFraudCom can classify behaviors of users directly by modeling the distributions of normal and fraud behaviors separately (2) some normal behaviors will be utilized as weak supervision information to guide the CGNN to build the profile for normal behaviors that are more stable than fraud behaviors. The algorithm dependency on fraud behaviors will be eliminated, which enables eFraudCom to detect fraud behaviors in presence of the new fraud patterns (3) the mutual information regularization term can maximize the separability between normal and fraud behaviors to further improve CGNN. eFraudCom is implemented into a prototype system and the performance of the system is evaluated by extensive experiments. The experiments on two Taobao and two public datasets demonstrate that the proposed deep framework CGNN is superior to other baselines in detecting fraud behaviors. A case study on Taobao datasets verifies that CGNN is still robust when the fraud patterns have been upgraded.
Publisher: ACM
Date: 31-01-2017
Publisher: IEEE Comput. Soc
Date: 2001
Publisher: Springer Singapore
Date: 2016
Publisher: Springer Singapore
Date: 2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 07-2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2023
Publisher: IEEE
Date: 09-2012
DOI: 10.1109/CEC.2012.16
Publisher: Association for Computing Machinery (ACM)
Date: 20-05-2016
DOI: 10.1145/2876513
Abstract: In this article, we propose a comprehensive approach for Quality of Service (QoS) calculation in service composition. Differing from the existing work on QoS aggregations that represent QoS as single values, discrete values with frequencies, or standard statistical distributions, the proposed approach has the capability to handle any type of QoS probability distribution. A set of formulae and algorithms are developed to calculate the QoS of a composite service according to four identified basic patterns as sequential, parallel, conditional, and loop. We demonstrate that the proposed QoS calculation method is much more efficient than existing simulation methods. It has a high scalability and builds a solid foundation for real-time QoS analysis and prediction in service composition. Experiment results are provided to show the effectiveness and efficiency of the proposed method.
Publisher: Association for Computing Machinery (ACM)
Date: 11-09-2020
DOI: 10.1145/3411749
Abstract: Truth discovery has been widely studied in recent years as a fundamental means for resolving the conflicts in multi-source data. Although many truth discovery methods have been proposed based on different considerations and intuitions, investigations show that no single method consistently outperforms the others. To select the right truth discovery method for a specific application scenario, it becomes essential to evaluate and compare the performance of different methods. A drawback of current research efforts is that they commonly assume the availability of certain ground truth for the evaluation of methods. However, the ground truth may be very limited or even impossible to obtain, rendering the evaluation biased. In this article, we present CompTruthHyp , a generic approach for comparing the performance of truth discovery methods without using ground truth. In particular, our approach calculates the probability of observations in a dataset based on the output of different methods. The probability is then ranked to reflect the performance of these methods. We review and compare 12 representative truth discovery methods and consider both single-valued and multi-valued objects. The empirical studies on both real-world and synthetic datasets demonstrate the effectiveness of our approach for comparing truth discovery methods.
Publisher: Springer Science and Business Media LLC
Date: 23-05-2008
Publisher: ACM Press
Date: 2005
Publisher: IEEE
Date: 12-2021
Publisher: IGI Global
Date: 04-2010
Abstract: Existing identity metasystems provide enabling tools to manage, select, and control of digital identities but they have not provided the support of trust management that should cover how trust requirements associated with digital identities are modeled, how runtime conditions for trust are evaluated, and how the results of trust evaluation are consumed by systems/applications. In this paper, the authors propose an approach toward a trust management enabled identity metasystem that covers the analysis of trust requirements and the development of trust management system in a consistent manner. The proposed trust management architecture extends the existing identity metasystems by introducing computing components for carrying out typical trust management tasks associated with digital identities. The computing components in proposed architecture provide intelligent services for these tasks. The proposed high level architecture targets the automation of the development of the trust management layer for digital identities.
Publisher: IEEE
Date: 09-2006
DOI: 10.1109/SCC.2006.14
Publisher: IEEE
Date: 06-2015
Publisher: IEEE
Date: 2007
Publisher: IEEE
Date: 06-2015
Publisher: Oxford University Press (OUP)
Date: 04-2012
Abstract: Trastuzumab (TZM), a monoclonal antibody against the ERBB2 protein, increases survival in ERBB2-positive breast cancer patients. Its clinical use, however, is limited by cardiotoxicity. We sought to evaluate whether TZM cardiotoxicity involves inhibition of human adult cardiac-derived stem cells, in addition to previously reported direct adverse effects on cardiomyocytes. To test this idea, we exposed human cardiosphere-derived cells (hCDCs), a natural mixture of cardiac stem cells and supporting cells that has been shown to exert potent regenerative effects, to TZM and tested the effects in vitro and in vivo. We found that ERBB2 mRNA and protein are expressed in hCDCs at levels comparable to those in human myocardium. Although clinically relevant concentrations of TZM had no effect on proliferation, apoptosis, or size of the c-kit-positive hCDC subpopulation, in vitro assays demonstrated diminished potential for cardiogenic differentiation and impaired ability to form microvascular networks in TZM-treated cells. The functional benefit of hCDCs injected into the border zone of acutely infarcted mouse hearts was abrogated by TZM: infarcted animals treated with TZM + hCDCs had a lower ejection fraction, thinner infarct scar, and reduced capillary density in the infarct border zone compared with animals that received hCDCs alone (n = 12 per group). Collectively, these results indicate that TZM inhibits the cardiomyogenic and angiogenic capacities of hCDCs in vitro and abrogates the morphological and functional benefits of hCDC transplantation in vivo. Thus, TZM impairs the function of human resident cardiac stem cells, potentially contributing to TZM cardiotoxicity.
Publisher: IEEE
Date: 09-2015
Publisher: IEEE
Date: 06-2012
DOI: 10.1109/SCC.2012.37
Publisher: IEEE
Date: 2009
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 07-2022
Abstract: Point-of-interest (POI) recommendations can help users explore attractive locations, which is playing an important role in location-based social networks (LBSNs). In POI recommendations, the results are largely impacted by users' preferences. However, the existing POI methods model user and location almost separately, which cannot capture users' personal and dynamic preferences to location. In addition, they also ignore users' acceptance to distance/time of location. To overcome the limitations of the existing methods, we first introduce Knowledge Graph with temporal information (known as TKG) into POI recommendation, including both user and location with timest s. Then, based on TKG, we propose a Spatial-Temporal Graph Convolutional Attention Network (STGCAN), a novel network that learns users' preferences on TKG by dynamically capturing the spatial-temporal neighbourhoods. Specifically, in STGCAN, we construct receptive fields on TKG to aggregate neighbourhoods of user and location respectively at each timest . And we measure the spatial-temporal interval as users' acceptance to distance/time with self-attention. Experiments on three real-world datasets demonstrate that the proposed model outperforms the state-of-the-art POI recommendation approaches.
Publisher: IEEE
Date: 12-2010
Publisher: IEEE
Date: 07-2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2022
Publisher: IEEE
Date: 09-2006
DOI: 10.1109/SCC.2006.43
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2020
Publisher: Association for Computing Machinery (ACM)
Date: 10-2003
Abstract: Developing a framework for analyzing service composition reuse and specialization.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2001
DOI: 10.1109/5326.971656
Publisher: IEEE
Date: 07-2009
DOI: 10.1109/ICWS.2009.91
Publisher: IEEE
Date: 12-2010
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer Berlin Heidelberg
Date: 2002
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer Singapore
Date: 2020
Publisher: Springer International Publishing
Date: 2020
Publisher: Association for Computing Machinery (ACM)
Date: 08-06-2021
DOI: 10.1145/3451984
Abstract: Vehicular ad hoc networks ( VANETs ) and the services they support are an essential part of intelligent transportation. Through physical technologies, applications, protocols, and standards, they help to ensure traffic moves efficiently and vehicles operate safely. This article surveys the current state of play in VANETs development. The summarized and classified include the key technologies critical to the field, the resource-management and safety applications needed for smooth operations, the communications and data transmission protocols that support networking, and the theoretical and environmental constructs underpinning research and development, such as graph neural networks and the Internet of Things. Additionally, we identify and discuss several challenges facing VANETs, including poor safety, poor reliability, non-uniform standards, and low intelligence levels. Finally, we touch on hot technologies and techniques, such as reinforcement learning and 5G communications, to provide an outlook for the future of intelligent transportation systems.
Publisher: IEEE
Date: 2005
DOI: 10.1109/ICWS.2005.34
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: ACM
Date: 27-02-2023
Publisher: IEEE
Date: 03-2015
Publisher: IEEE
Date: 11-2020
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 06-2015
Publisher: IEEE Comput. Soc
Date: 2003
Publisher: Association for Computing Machinery (ACM)
Date: 15-09-2023
DOI: 10.1145/3612918
Abstract: The scope of the Industrial Internet of Things (IIoT) has stretched beyond manufacturing to include energy, healthcare, transportation and all that tomorrow’s smart cities will entail. The realm of IIoT includes smart sensors, actuators, programmable logic controllers, distributed control systems (DCS), embedded devices, supervisory control and data acquisition systems - all produced by manufacturers for different purposes and with different data structures and formats designed according to different standards, and made to follow different protocols. In this sea of incompatibility, how can we flexibly acquire these heterogeneous data, and how can we uniformly structure them to suit thousand of different applications? In this article, we survey the four pillars of information science that enable collaborative data access in an IIoT - standardization, data acquisition, data fusion, and scalable architecture - to provide an up-to-date audit of current research in the field. Here, standardization in IIoT relies on standards and technologies to make things communicative data acquisition attempts to transparently collect data through plug-and-play architectures, reconfigurable schemes, or hardware expansion data fusion refers to the techniques and strategies for overcoming heterogeneity in data formats and sources and scalable architecture provides basic techniques to support heterogeneous requirements. The paper also concludes with an overview of the frontier researches and emerging technologies for supporting or challenging data access from the aspects of 5G, machine learning, blockchain, and semantic web.
Publisher: IEEE
Date: 10-2011
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: ACM
Date: 07-12-2021
Publisher: IEEE
Date: 09-2008
DOI: 10.1109/EDOC.2008.38
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Springer New York
Date: 04-09-2013
Publisher: IEEE
Date: 2007
DOI: 10.1109/SCC.2007.33
Publisher: IEEE
Date: 2008
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: IEEE
Date: 07-2010
Publisher: Springer International Publishing
Date: 2017
Publisher: Springer International Publishing
Date: 2017
Publisher: IEEE
Date: 07-2023
Publisher: Association for Computing Machinery (ACM)
Date: 22-05-2023
DOI: 10.1145/3579360
Publisher: IEEE
Date: 2005
DOI: 10.1109/SCC.2005.115
Publisher: ACM
Date: 04-08-2023
Publisher: IEEE
Date: 11-2020
Publisher: IEEE
Date: 18-06-2023
Publisher: Springer Science and Business Media LLC
Date: 17-01-2022
Publisher: Springer Berlin Heidelberg
Date: 1999
Publisher: IEEE
Date: 11-2020
Publisher: Springer International Publishing
Date: 2021
Publisher: Springer International Publishing
Date: 2017
Publisher: IEEE
Date: 12-2010
Publisher: IEEE
Date: 07-2019
Publisher: ACM
Date: 26-10-2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2020
Publisher: IEEE
Date: 07-2010
DOI: 10.1109/ICWS.2010.36
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 07-2020
Abstract: As communities represent similar opinions, similar functions, similar purposes, etc., community detection is an important and extremely useful tool in both scientific inquiry and data analytics. However, the classic methods of community detection, such as spectral clustering and statistical inference, are falling by the wayside as deep learning techniques demonstrate an increasing capacity to handle high-dimensional graph data with impressive performance. Thus, a survey of current progress in community detection through deep learning is timely. Structured into three broad research streams in this domain – deep neural networks, deep graph embedding, and graph neural networks, this article summarizes the contributions of the various frameworks, models, and algorithms in each stream along with the current challenges that remain unsolved and the future research opportunities yet to be explored.
Publisher: IEEE
Date: 1999
Publisher: IEEE
Date: 12-2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2013
DOI: 10.1109/TSC.2012.7
Publisher: IEEE
Date: 11-2019
Publisher: ACM
Date: 13-05-2019
Publisher: IEEE
Date: 11-2019
Publisher: World Scientific Pub Co Pte Lt
Date: 12-2004
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Inderscience Publishers
Date: 2007
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: ACM
Date: 18-06-2023
Publisher: Springer Science and Business Media LLC
Date: 18-11-2022
DOI: 10.1038/S41598-022-22086-3
Abstract: Graph level anomaly detection (GLAD) aims to spot anomalous graphs that structure pattern and feature information are different from most normal graphs in a graph set, which is rarely studied by other researchers but has significant application value. For instance, GLAD can be used to distinguish some different characteristic molecules in drug discovery and chemical analysis. However, GLAD mainly faces the following three challenges: (1) learning more comprehensive graph level representations to differ normal graphs and abnormal graphs, (2) designing an effective graph anomaly evaluation paradigm to capture graph anomalies from the local and global graph perspectives, (3) overcoming the number imbalance problem of normal and abnormal graphs. In this paper, we combine graph neural networks and contrastive learning to build an end-to-end GLAD framework for solving the three challenges above. We aim to design a new graph level anomaly evaluation way, which first utilizes the contrastive learning strategy to enhance different level representations of normal graphs from node and graph levels by a graph convolution autoencoder with perturbed graph encoder. Then, we evaluate the error of them with corresponding representations of the generated reconstruction graph to detect anomalous graphs. Extensive experiments on ten real-world datasets from three areas, such as molecular, protein and social network anomaly graphs, show that our model can effectively detect graph level anomaly from the majority and outperform existing advanced methods.
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: IEEE
Date: 07-2009
DOI: 10.1109/CEC.2009.19
Publisher: IEEE
Date: 06-2017
Publisher: Springer Science and Business Media LLC
Date: 26-07-2011
Publisher: Springer Science and Business Media LLC
Date: 14-04-2018
Publisher: IEEE
Date: 07-2018
Publisher: IEEE
Date: 05-2017
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: IEEE
Date: 03-2014
Publisher: Springer International Publishing
Date: 2015
Publisher: Springer Science and Business Media LLC
Date: 22-09-2021
Publisher: Cambridge University Press (CUP)
Date: 2021
DOI: 10.1017/DCE.2021.6
Abstract: Monte Carlo algorithms simulates some prescribed number of s les, taking some random real time to complete the computations necessary. This work considers the converse: to impose a real-time budget on the computation, which results in the number of s les simulated being random. To complicate matters, the real time taken for each simulation may depend on the s le produced, so that the s les themselves are not independent of their number, and a length bias with respect to compute time is apparent. This is especially problematic when a Markov chain Monte Carlo (MCMC) algorithm is used and the final state of the Markov chain—rather than an average over all states—is required, which is the case in parallel tempering implementations of MCMC. The length bias does not diminish with the compute budget in this case. It also occurs in sequential Monte Carlo (SMC) algorithms, which is the focus of this paper. We propose an anytime framework to address the concern, using a continuous-time Markov jump process to study the progress of the computation in real time. We first show that for any MCMC algorithm, the length bias of the final state’s distribution due to the imposed real-time computing budget can be eliminated by using a multiple chain construction. The utility of this construction is then demonstrated on a large-scale SMC $ {}^2 $ implementation, using four billion particles distributed across a cluster of 128 graphics processing units on the Amazon EC2 service. The anytime framework imposes a real-time budget on the MCMC move steps within the SMC $ {}^2 $ algorithm, ensuring that all processors are simultaneously ready for the res ling step, demonstrably reducing idleness to due waiting times and providing substantial control over the total compute budget.
Publisher: Springer Science and Business Media LLC
Date: 02-11-2011
Publisher: IEEE
Date: 06-2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2012
DOI: 10.1109/TSC.2011.5
Publisher: Springer International Publishing
Date: 2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2023
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Association for Computing Machinery (ACM)
Date: 29-03-2016
DOI: 10.1145/2886104
Abstract: In most BPM systems (a.k.a. workflow systems), the data for process execution is scattered across databases for enterprise, auxiliary local data stores within the BPM systems, and even file systems (e.g., specification of process models). The interleaving nature of data management and BP execution and the lack of a coherent conceptual data model for all data needed for execution make it hard for (1) providing Business-Process-as-a-Service (BPaaS) and (2) effective support for collaboration between business processes. The primary reason is that an enormous effort is required for maintaining both the engines and the data for the client applications. In particular, different modeling languages and different BPM systems make process interoperation one of the toughest challenges. In this article, we formulate a concept of a “universal artifact,” which extends artifact-centric models by capturing all needed data for a process instance throughout its execution. A framework called SeGA based on universal artifacts is developed to support separation of data and BP execution, a key principle for BPM systems. We demonstrate in this article that SeGA is versatile enough to fully facilitate not only executions of in idual processes (to support BPaaS) but also various collaboration models. Moreover, SeGA reduces the complexity in runtime management including runtime querying, constraints enforcement, and dynamic modification upon collaboration across possibly different BPM systems.
Publisher: IEEE Comput. Soc
Date: 2003
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: SPIE
Date: 13-12-2020
DOI: 10.1117/12.2560895
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Nature Switzerland
Date: 2023
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: IEEE
Date: 07-2010
DOI: 10.1109/SCC.2010.16
Publisher: IEEE
Date: 11-2022
Publisher: International Joint Conferences on Artificial Intelligence Organization
Date: 08-2019
Abstract: Trust evaluation of people and information on Twitter is critical for maintaining a healthy online social environment. How to evaluate the trustworthiness of users and tweets becomes a challenging question. In this demo, we show how our proposed CoTrRank approach deal with this problem. This approach models users and tweets in two coupled networks and calculate their trust values in different trust spaces. In particular, our solution provides a configurable way when mapping the calculated raw evidences to the trust values. The CoTrRank demo system has an interactive interface to show how our proposed approach produces more effective and adaptive trust evaluation results comparing with baseline methods.
Publisher: IEEE
Date: 07-2010
DOI: 10.1109/SCC.2010.13
Publisher: Springer Science and Business Media LLC
Date: 14-07-2020
Publisher: IEEE
Date: 07-2008
DOI: 10.1109/SCC.2008.62
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: IEEE
Date: 2007
DOI: 10.1109/SCC.2007.96
Publisher: IEEE Comput. Soc
Date: 2001
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: Wiley
Date: 06-04-2010
DOI: 10.1002/SMR.464
Publisher: IEEE
Date: 09-2021
Publisher: Springer International Publishing
Date: 2019
Publisher: World Scientific Pub Co Pte Lt
Date: 03-2012
Publisher: IEEE
Date: 06-2017
DOI: 10.1109/ICWS.2017.90
Publisher: IEEE
Date: 06-2017
DOI: 10.1109/ICWS.2017.91
Publisher: IEEE
Date: 09-2021
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: IEEE
Date: 2009
DOI: 10.1109/SCC.2009.28
Publisher: Springer International Publishing
Date: 2019
Location: Netherlands
Start Date: 06-2014
End Date: 03-2018
Amount: $411,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 05-2018
End Date: 01-2022
Amount: $348,026.00
Funder: Australian Research Council
View Funded ActivityStart Date: 05-2020
End Date: 04-2023
Amount: $390,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 05-2023
End Date: 05-2026
Amount: $351,667.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2005
End Date: 12-2008
Amount: $218,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2007
End Date: 12-2010
Amount: $210,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2015
End Date: 04-2018
Amount: $369,900.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2023
End Date: 12-2025
Amount: $380,610.00
Funder: Australian Research Council
View Funded ActivityStart Date: 04-2013
End Date: 12-2017
Amount: $210,000.00
Funder: Australian Research Council
View Funded Activity