An AI-enabled lightweight data fusion and load optimization approach for internet of things
- Authors: Jan, Mian , Zakarya, Muhammad , Khan, Muhammad , Mastorakis, Spyridon , Balasubramanian, Venki
- Date: 2021
- Type: Text , Journal article
- Relation: Future Generation Computer Systems Vol. 122, no. (2021), p. 40-51
- Full Text: false
- Reviewed:
- Description: In the densely populated Internet of Things (IoT) applications, sensing range of the nodes might overlap frequently. In these applications, the nodes gather highly correlated and redundant data in their vicinity. Processing these data depletes the energy of nodes and their upstream transmission towards remote datacentres, in the fog infrastructure, may result in an unbalanced load at the network gateways and edge servers. Due to heterogeneity of edge servers, few of them might be overwhelmed while others may remain less-utilized. As a result, time-critical and delay-sensitive applications may experience excessive delays, packet loss, and degradation in their Quality of Service (QoS). To ensure QoS of IoT applications, in this paper, we eliminate correlation in the gathered data via a lightweight data fusion approach. The buffer of each node is partitioned into strata that broadcast only non-correlated data to edge servers via the network gateways. Furthermore, we propose a dynamic service migration technique to reconfigure the load across various edge servers. We assume this as an optimization problem and use two meta-heuristic algorithms, along with a migration approach, to maintain an optimal Gateway-Edge configuration in the network. These algorithms monitor the load at each server, and once it surpasses a threshold value (which is dynamically computed with a simple machine learning method), an exhaustive search is performed for an optimal and balanced periodic reconfiguration. The experimental results of our approach justify its efficiency for large-scale and densely populated IoT applications. © 2021 Elsevier B.V. *Please note that there are multiple authors for this article therefore only the name of the first 5 including Federation University Australia affiliate “Venki Balasubramanian” is provided in this record**.
How much I can rely on you : measuring trustworthiness of a twitter user
- Authors: Das, Rajkumar , Karmakar, Gour , Kamruzzaman, Joarder
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Dependable and Secure Computing Vol. 18, no. 2 (2021), p. 949-966
- Full Text:
- Reviewed:
- Description: Trustworthiness in an online environment is essential because individuals and organizations can easily be misled by false and malicious information receiving from untrustworthy users. Though existing methods assess users' trustworthiness by exploiting Twitter account properties, their efficacy is inadequate because of Twitter's restriction on profile and tweet size, the existence of missing or insufficient profiles, and ease to create fake accounts or relationships to pretend as trustworthy. In this paper, we present a holistic approach by exploiting ideas perceived from real-world organizations for trust estimation along with available Twitter information. Users' trustworthiness is determined by considering their credentials, recommendation from referees and the quality of the information in their Twitter accounts and tweets. We establish the feasibility of our approach analytically and further devise a multi-objective cost function for the A
IoT-powered deep learning brain network for assisting quadriplegic people
- Authors: Vinoj, P. , Jacob, Sunil , Menon, Varun , Balasubramanian, Venki , Piran, Md Jalil
- Date: 2021
- Type: Text , Journal article
- Relation: Computers and Electrical Engineering Vol. 92, no. (2021), p.
- Full Text: false
- Reviewed:
- Description: Brain-Computer Interface (BCI) systems have recently emerged as a prominent technology for assisting paralyzed people. Recovery from paralysis in most patients using the existing BCI-based assistive devices is hindered due to the lack of training and proper supervision. The system's continuous usage results in mental fatigue, owing to a higher user concentration required to execute the mental commands. Moreover, the false-positive rate and lack of constant control of the BCI systems result in user frustration. The proposed framework integrates BCI with a deep learning network in an efficient manner to reduce mental fatigue and frustration. The Deep learning Brain Network (DBN) recognizes the patient's intention for upper limb movement by a deep learning model based on the features extracted during training. DBN correlates and maps the different Electroencephalogram (EEG) patterns of healthy subjects with the identified pattern's upper limb movement. The stroke-affected muscles of the paralyzed are then activated using the obtained superior pattern. The implemented DBN consisting of four healthy subjects and a quadriplegic patient achieved 94% accuracy for various patient movement intentions. The results show that DBN is an excellent tool for providing rehabilitation, and it delivers sustained assistance, even in the absence of caregivers. © 2021
UniFlexView : a unified framework for consistent construction of BPMN and BPEL process views
- Authors: Yongchareon, Sira , Liu, Chengfei , Zhao, Xiaohui
- Date: 2020
- Type: Text , Journal article
- Relation: Concurrency Computation Vol. 32, no. 11 (2020), p.
- Full Text:
- Reviewed:
- Description: Process view technologies allow organizations to create different granularity levels of abstraction of their business processes, therefore enabling a more effective business process management, analysis, interoperation, and privacy controls. Existing research proposed view construction and abstraction techniques for block-based (ie, BPEL) and graph-based (ie, BPMN) process models. However, the existing techniques treat each type of the two types of models separately. Especially, this brings in challenges for achieving a consistent process view for a BPEL model that derives from a BPMN model. In this paper, we propose a unified framework, namely UniFlexView, for supporting automatic and consistent process view construction. With our framework, process modelers can use our proposed View Definition Language to specify their view construction requirements disregarding the types of process models. Our UniFlexView's system prototype has been developed as a proof of concept and demonstration of the usability and feasibility of our framework. © 2019 John Wiley & Sons, Ltd.
The photometric stereo approach and the visualization of 3D face reconstruction
- Authors: Khan, Muhammad , Ullah, Zabeeh , Butt, Maria , Arshad, Zohaib , Yousaf, Sobia
- Date: 2019
- Type: Text , Journal article
- Relation: International Journal of Advanced Computer Science and Applications Vol. 10, no. 2 (2019), p. 217-221
- Full Text:
- Reviewed:
- Description: The 3D Morphable models of the human face have prepared myriad of applications in computer vision, human computer interaction and security surveillances. However, due to the variation in size, complexity of training data set, the landmark mapping, the representation in real time and rendering or synthesis of images in three dimensional is limited. In this paper, we extend the approach of the photometric stereo and provide the human face reconstruction in three dimensional. The proposed method consists of two steps. First it automatically detects the face and segment the iris along with statistical features of pupil location in it. Secondly it provides the selection of minimum six features and where iris process to generate the 3D face. In compare with existing methods our approach provides the automation which produces more better and efficient results in contrast to the manual methods.
A detector of structural similarity for multi-modal microscopic image registration
- Authors: Lv, Guohua , Teng, Shyh , Lu, Guojun
- Date: 2018
- Type: Text , Journal article
- Relation: Multimedia Tools and Applications Vol. 77, no. 6 (2018), p. 7675-7701
- Full Text: false
- Reviewed:
- Description: This paper presents a Detector of Structural Similarity (DSS) to minimize the visual differences between brightfield and confocal microscopic images. The context of this work is that it is very challenging to effectively register such images due to a low structural similarity in image contents. To address this issue, DSS aims to maximize the structural similarity by utilizing the intensity relationships among red-green-blue (RGB) channels in images. Technically, DSS can be combined with any multi-modal image registration technique in registering brightfield and confocal microscopic images. Our experimental results show that DSS significantly increases the visual similarity in such images, thereby improving the registration performance of an existing state-of-the-art multi-modal image registration technique by up to approximately 27%. © 2017, Springer Science+Business Media New York.
An efficient data delivery mechanism for AUV-based Ad hoc UASNs
- Authors: Karmakar, Gour , Kamruzzaman, Joarder , Nowsheen, Nusrat
- Date: 2018
- Type: Text , Journal article
- Relation: Future Generation Computer Systems Vol. 86, no. (2018), p. 1193-1208
- Full Text: false
- Reviewed:
- Description: Existing 3D Underwater Acoustic Sensor Networks (UASNs) are either fixed having nodes anchored with the seabed or a combination of Autonomous Underwater Vehicles (AUVs) and a fixed UASN where AUVs are controlled to move along paths for data collection. Existing data delivery protocols for such AUV equipped networks are designed in a way where AUVs act as message ferries. These UASNs are deployed for a specific service such as asset (e.g., oil pipes, shipwreck) monitoring and event detection. For a coordinated data collection, to deploy a network for any service like information discovery in an ad hoc manner, it requires a 3D UASN consisting of only AUVs and the movement of an AUV needs to be controlled by another AUV through commands. To our knowledge, no such data delivery protocol required for a 3D UASN comprising only AUVs exists in the current literature that can efficiently handle data collection and delivery. To address this research gap, in this paper, an AUV-based technique for ad hoc underwater network, namely AUV-based Data Delivery Protocol (ADDP), is introduced which ensures data delivery within a given time-constraint by controlling node (i.e., AUV) movement at each hop through commands of a node. The performance of the proposed protocol has also been evaluated and compared with existing relevant protocols in terms of packet delivery ratio, routing overhead and energy consumption considering various network scenarios and sizes. Results exhibit outstanding performance improvement achieved by the proposed protocol for all metrics. © 2017 Elsevier B.V.
COREG : A corner based registration technique for multimodal images
- Authors: Lv, Guohua , Teng, Shyh , Lu, Guojun
- Date: 2018
- Type: Text , Journal article
- Relation: Multimedia Tools and Applications Vol. 77, no. 10 (2018), p. 12607-12634
- Full Text: false
- Reviewed:
- Description: This paper presents a COrner based REGistration technique for multimodal images (referred to as COREG). The proposed technique focuses on addressing large content and scale differences in multimodal images. Unlike traditional multimodal image registration techniques that rely on intensities or gradients for feature representation, we propose to use contour-based corners. First, curvature similarity between corners are for the first time explored for the purpose of multimodal image registration. Second, a novel local descriptor called Distribution of Edge Pixels Along Contour (DEPAC) is proposed to represent the edges in the neighborhood of corners. Third, a simple yet effective way of estimating scale difference is proposed by making use of geometric relationships between corner triplets from the reference and target images. Using a set of benchmark multimodal images and multimodal microscopic images, we will demonstrate that our proposed technique outperforms a state-of-the-art multimodal image registration technique. © 2017, Springer Science+Business Media, LLC.
Keyword search for building service-based systems
- Authors: He, Qiang , Zhou, Rui , Zhang, Xuyun , Wang, Yanchun , Ye, Dayong , Chen, Feifei , Grundy, John , Yang, Yun
- Date: 2017
- Type: Text , Journal article
- Relation: IEEE Transactions on Software Engineering Vol. 43, no. 7 (2017), p. 658-674
- Full Text: false
- Reviewed:
- Description: With the fast growth of applications of service-oriented architecture (SOA) in software engineering, there has been a rapid increase in demand for building service-based systems (SBSs) by composing existing Web services. Finding appropriate component services to compose is a key step in the SBS engineering process. Existing approaches require that system engineers have detailed knowledge of SOA techniques which is often too demanding. To address this issue, we propose Keyword Search for Service-based Systems (KS3), a novel approach that integrates and automates the system planning, service discovery and service selection operations for building SBSs based on keyword search. KS3 assists system engineers without detailed knowledge of SOA techniques in searching for component services to build SBSs by typing a few keywords that represent the tasks of the SBSs with quality constraints and optimisation goals for system quality, e.g., reliability, throughput and cost. KS3 offers a new paradigm for SBS engineering that can significantly save the time and effort during the system engineering process. We conducted large-scale experiments using two real-world Web service datasets to demonstrate the practicality, effectiveness and efficiency of KS3. © 1976-2012 IEEE.
Ontology-based service discovery framework for dynamic environments
- Authors: Zeshan, Furkh , Mohamad, Radziah , Ahmad, Mohammad , Hussain, Syed , Ahmad, Adnan , Raza, Imran , Mehmood, Abid , Ulhaq, Ikram , Abdulgader, Arafat , Babar, Imran
- Date: 2017
- Type: Text , Journal article
- Relation: IET Software Vol. 11, no. 2 (2017), p. 64-74
- Full Text: false
- Reviewed:
- Description: With all the recent advancements in the electronic world, hardware is becoming smaller, cheaper and more powerful; while the software industry is moving towards service-oriented integration technologies. Hence, service oriented architecture is becoming a popular platform for the development of applications for distributed embedded real-time system (DERTS). With rapidly increasing diversity of services on the internet, new demands have been raised concerning the efficient discovery of heterogeneous device services in the dynamic environment of DERTS. Context-awareness principles have been widely studied for DERTS; hence, it can be used as an additional set of service selection criteria. However, in order to use context information effectively, it should be presented in an unambiguous way and the dynamic nature of the embedded and real-time systems should be considered. To address these challenges, the authors present a service discovery framework for DERTS which uses context-aware ontology of embedded and real-time systems and a semantic matching algorithm to facilitate the discovery of device services in embedded and real-time system environments. The proposed service discovery framework also considers the associated priorities with the requirements posed by the requester during the service discovery process.
Modeling multiuser spectrum allocation for cognitive radio networks
- Authors: Bin Shahid, Mohammad , Kamruzzaman, Joarder , Hassan, Md Rafiul
- Date: 2016
- Type: Text , Journal article
- Relation: Computers & Electrical Engineering Vol. 52, no. (2016), p. 266-283
- Full Text: false
- Reviewed:
- Description: Spectrum allocation scheme in cognitive radio networks (CRNs) becomes complex when multiple CR users concomitantly need to be allocated new and suitable bands once the primary user returns. Most existing schemes focus on the gain of individual users, ignoring the effect of an allocation on other users and rely on the 'periodic sensing and transmission' cycle which reduces spectrum utilization. This paper introduces a scheme that exploits collaboration among users to detect PU's return which relieves active CR users from the sensing task, and thereby improves spectrum utilization. It defines a Capacity of Service (CoS) metric based on the optimal sensing parameters which measures the suitability of a band for each contending user and takes into consideration the impact of allocating a particular band on other band seeking users. The proposed scheme significantly improves capacity of service, reduces interference loss and collision, and hence, enhances dynamic spectrum access capabilities. (C) 2015 Elsevier Ltd. All rights reserved.
Mining associated patterns from wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2015
- Type: Text , Journal article
- Relation: IEEE Transactions on Computers Vol. 64, no. 7 (2015), p. 1998-2011
- Full Text: false
- Reviewed:
- Description: Mining of sensor data for useful knowledge extraction is a very challenging task. Existing works generate sensor association rules using occurrence frequency of patterns to extract the knowledge. These techniques often generate huge number of rules, most of which are non-informative or fail to reflect true correlation among sensor data. In this paper, we propose a new type of behavioral pattern called associated sensor patterns which capture association-like co-occurrences as well as temporal correlations which are linked with such co-occurrences. To capture such patterns a compact tree structure, called associated sensor pattern tree (ASP-tree) and a mining algorithm (ASP) are proposed which use pattern growth-based approach to generate all associated patterns with only one scan over dataset. Moreover, when data stream flows through, old information may lose significance for the current time. To capture significance of recent data, ASP-tree is further enhanced to SWASP-tree by adopting sliding observation window and updating the tree structure accordingly. Finally, window size is made dynamically adaptive to ensure efficient resource usage. Different characteristics of the proposed techniques and their computational complexity are presented. Experimental results show that our approach is very efficient in discovering associated sensor patterns and outperforms existing techniques.
Share-frequent sensor patterns mining from wireless sensor network data
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2015
- Type: Text , Journal article
- Relation: IEEE Transactions on Parallel and Distributed Systems Vol. 26, no. 12 (2015), p. 3471-3484
- Full Text: false
- Reviewed:
- Description: Mining interesting knowledge from the huge amount of data gathered from WSNs is a challenge. Works reported in literature use support metric-based sensor association rules which employ the occurrence frequency of patterns as criteria. However, consideration of the binary frequency of a pattern is not a sufficient indicator for finding meaningful patterns because it only reflects the number of epochs which contain that pattern in the dataset. The share measure of sensorsets could discover useful knowledge about trigger values associated with a sensor. Here, we propose a new type of behavioral pattern called share-frequent sensor patterns (SFSPs) by considering the non-binary frequency values of sensors in epochs. SFSPs can find a correlation among a set of sensors and hence can improve the performance of WSNs in a resource management process. In this paper, a share-frequent sensor pattern tree (ShrFSP-Tree) has been proposed to facilitate a pattern growth mining technique to discover SFSPs from WSN data. We also present a parallel and distributed method where the ShrFSP-Tree is enhanced into PShrFSP-Tree and its performance is investigated for both homogeneous and heterogeneous systems. Results show that our method is time and memory efficient in finding SFSPs than the existing most efficient algorithms.
StressCloud : A tool for analysing performance and energy consumption of cloud applications
- Authors: Chen, Feifei , Grundy, John , Schneider, Jean-Guy , Yang, Yun , He, Qiang
- Date: 2015
- Type: Text , Conference paper
- Relation: 2015 IEEE/ACM 37th IEEE International Conference on Software Engineering (ICSE)
- Full Text: false
- Reviewed:
- Description: Finding the best deployment configuration that maximises energy efficiency while guaranteeing system performance of cloud applications is an extremely challenging task. It requires the evaluation of system performance and energy consumption under a wide variety of realistic workloads and deployment configurations. This paper demonstrates StressCloud, an automatic performance and energy consumption analysis tool for cloud applications in real-world cloud environments. StressCloud supports 1) the modelling of realistic cloud application workloads, 2) the automatic generation and running of load tests, and 3) the profiling of system performance and energy consumption.
Self static interference mitigation scheme for coexisting wireless networks
- Authors: Yaqub, Muhammad , Haider, Ammar , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2014
- Type: Text , Journal article
- Relation: Computers and Electrical Engineering Vol. 40, no. 2 (2014), p. 307-318
- Full Text: false
- Reviewed:
- Description: High density of coexisting networks in the Industrial, Scientific and Medical (ISM) band leads to static and self interferences among different communication entities. The inevitability of these interferences demands for interference avoidance schemes to ensure reliability of network operations. This paper proposes a novel Diversified Adaptive Frequency Rolling (DAFR) technique for frequency hopping in Bluetooth piconets. DAFR employs intelligent hopping procedures in order to mitigate self interferences, weeds out the static interferer efficiently and ensures sufficient frequency diversity. We compare the performance of our proposed technique with the widely used existing frequency hopping techniques, namely, Adaptive Frequency Hopping (AFH) and Adaptive Frequency Rolling (AFR). Simulation studies validate the significant improvement in goodput and hopping diversity of our scheme compared to other schemes and demonstrate its potential benefit in real world deployment.
Visual character N-grams for classification and retrieval of radiological images
- Authors: Kulkarni, Pradnya , Stranieri, Andrew , Kulkarni, Siddhivinayak , Ugon, Julien , Mittal, Manish
- Date: 2014
- Type: Text , Journal article
- Relation: International Journal of Multimedia & Its Applications Vol. 6, no. 2 (April 2014), p. 35-49
- Full Text:
- Reviewed:
- Description: Diagnostic radiology struggles to maintain high interpretation accuracy. Retrieval of past similar cases would help the inexperienced radiologist in the interpretation process. Character n-gram model has been effective in text retrieval context in languages such as Chinese where there are no clear word boundaries. We propose the use of visual character n-gram model for representation of image for classification and retrieval purposes. Regions of interests in mammographic images are represented with the character n-gram features. These features are then used as input to back-propagation neural network for classification of regions into normal and abnormal categories. Experiments on miniMIAS database show that character n-gram features are useful in classifying the regions into normal and abnormal categories. Promising classification accuracies are observed (83.33%) for fatty background tissue warranting further investigation. We argue that Classifying regions of interests would reduce the number of comparisons necessary for finding similar images from the database and hence would reduce the time required for retrieval of past similar cases.
Abrasion modeling of multiple-point defect dynamics for machine condition monitoring
- Authors: Yaqub, Muhammad , Gondal, Iqbal , Kamruzzaman, Joarder , Loparo, Kenneth
- Date: 2013
- Type: Text , Journal article
- Relation: IEEE Transactions on Reliability Vol. 62, no. 1 (2013), p. 171-182
- Full Text: false
- Reviewed:
- Description: Multiple-point defects and abraded surfaces in rotary machinery induce complex vibration signatures, and have a tendency to mislead defect diagnosis models. A challenging problem in machine defect diagnosis is to model and study defect signature dynamics in the case of multiple-point defects and surface abrasion. In this study, a multiple-point defect model (MPDM) that characterizes the dynamics of n-point bearing defects is proposed. MPDM is further extended to model degradation in a rotating machine as a special case of multiple-point defects. Analytical and experimental results for multiple-point defects and abrasions show that the location of the fundamental defect frequency shifts depending upon the relative location of the defects and width of the abrasive region. This variation in the defect frequency results in a degradation of the defect detection accuracy of the defect diagnostic model. Based on envelope detection analysis, a modification in existing defect diagnostic models is recommended to nullify the impact of multiple-point defects, and general abrasion in machine components.
An adaptive self-configuration scheme for severity invariant machine fault diagnosis
- Authors: Yaqub, Muhammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2013
- Type: Text , Journal article
- Relation: IEEE Transactions on Reliability Vol. 62, no. 1 (2013), p. 116-126
- Full Text: false
- Reviewed:
- Description: Vibration signals, used for abnormality detection in machine health monitoring (MHM), exhibit significant variation with varying fault severity. This signal variation causes overlap among the features characterizing different types of faults, which results in severe performance degradation of the fault diagnostic model. In this paper, a wavelet based adaptive training set and feature selection (WATF) self-configuration scheme is presented, which selects the optimum wavelet decomposition level, and employs adaptive selection of the training set and features. Optimal wavelet decomposition level selection is such that the maximum fault signature-signal energy bands are achieved. The severity variant features, which could cause detrimental class overlap for MHM, are avoided using adaptive selection of the training set and features based on the location of a test data in feature space. WATF uses Support Vector Machines (SVM) to build the fault diagnostic model, and its performance and robustness has been tested with data having different severity levels. Comparative studies of WATF with eight existing fault diagnosis schemes show that, for publicly available data sets, WATF achieves higher fault detection accuracy, even when training and testing data sets belong to different severity levels.
Generating a performance test-bed for cloud computing systems
- Authors: Chen, Feifei
- Date: 2013
- Type: Text , Conference paper
- Relation: 22nd Australian Software Engineering Conference
- Full Text: false
- Reviewed:
- Description: Cloud computing delivers IT solutions as a utility to users. A common economic objective for both cloud consumers and providers is to minimise their total deployment and operational costs while achieving satisfactory system performance to meet Service Level Agreements (SLAs). Therefore, the trade-off between cost and system performance is needed to be managed to achieve the best cost effectiveness. The PhD project presented in this paper provides an efficient and accurate method to evaluate the trade-off between cost and system performance by proposing a performance testing tool for Cloud systems. This tool can accommodate different Cloud system architectures and adopt different workload and cost models of Cloud systems during the trade-off evaluation process.
A performance evaluation of distributed database architectures
- Authors: Chen, Shiping , Ng, Alex , Greenfield, Paul
- Date: 2012
- Type: Text , Journal article
- Relation: Concurrency Computation Practice and Experience Vol. , no. (2012), p.
- Full Text: false
- Reviewed:
- Description: The globally integrated contemporary business environment has prompted new challenges to database architectures in order to enable organizations to improve database applications performance, scalability, reliability and data privacy in adapting to the evolving nature of business. Although a number of distributed database architectures are available for choice, there is a lack of an in-depth understanding of the performance characteristics of these database architectures in a comparison way. In this paper, we report a performance study of three typical (centralized, partitioned and replicated) database architectures. We used the TPC-C as the evaluation benchmark to simulate a contemporary business environment, and a commercially available database management system that supports the three architectures. We compared the performance of the partitioned and replicated architectures against the centralized database, which results in some interesting observations and practical experience. The findings and the practice presented in this paper provide useful information and experience for the enterprise architects and database administrators in determining the appropriate database architecture in moving from centralized to distributed environments. © 2012 John Wiley & Sons, Ltd.