A Survey on Behavioral Pattern Mining from Sensor Data in Internet of Things
- Rashid, Md Mamunur, Kamruzzaman, Joarder, Hassan, Mohammad, Shahriar Shafin, Sakib, Bhuiyan, Md Zakirul
- Authors: Rashid, Md Mamunur , Kamruzzaman, Joarder , Hassan, Mohammad , Shahriar Shafin, Sakib , Bhuiyan, Md Zakirul
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 33318-33341
- Full Text:
- Reviewed:
- Description: The deployment of large-scale wireless sensor networks (WSNs) for the Internet of Things (IoT) applications is increasing day-by-day, especially with the emergence of smart city services. The sensor data streams generated from these applications are largely dynamic, heterogeneous, and often geographically distributed over large areas. For high-value use in business, industry and services, these data streams must be mined to extract insightful knowledge, such as about monitoring (e.g., discovering certain behaviors over a deployed area) or network diagnostics (e.g., predicting faulty sensor nodes). However, due to the inherent constraints of sensor networks and application requirements, traditional data mining techniques cannot be directly used to mine IoT data streams efficiently and accurately in real-time. In the last decade, a number of works have been reported in the literature proposing behavioral pattern mining algorithms for sensor networks. This paper presents the technical challenges that need to be considered for mining sensor data. It then provides a thorough review of the mining techniques proposed in the recent literature to mine behavioral patterns from sensor data in IoT, and their characteristics and differences are highlighted and compared. We also propose a behavioral pattern mining framework for IoT and discuss possible future research directions in this area. © 2013 IEEE.
- Authors: Rashid, Md Mamunur , Kamruzzaman, Joarder , Hassan, Mohammad , Shahriar Shafin, Sakib , Bhuiyan, Md Zakirul
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 33318-33341
- Full Text:
- Reviewed:
- Description: The deployment of large-scale wireless sensor networks (WSNs) for the Internet of Things (IoT) applications is increasing day-by-day, especially with the emergence of smart city services. The sensor data streams generated from these applications are largely dynamic, heterogeneous, and often geographically distributed over large areas. For high-value use in business, industry and services, these data streams must be mined to extract insightful knowledge, such as about monitoring (e.g., discovering certain behaviors over a deployed area) or network diagnostics (e.g., predicting faulty sensor nodes). However, due to the inherent constraints of sensor networks and application requirements, traditional data mining techniques cannot be directly used to mine IoT data streams efficiently and accurately in real-time. In the last decade, a number of works have been reported in the literature proposing behavioral pattern mining algorithms for sensor networks. This paper presents the technical challenges that need to be considered for mining sensor data. It then provides a thorough review of the mining techniques proposed in the recent literature to mine behavioral patterns from sensor data in IoT, and their characteristics and differences are highlighted and compared. We also propose a behavioral pattern mining framework for IoT and discuss possible future research directions in this area. © 2013 IEEE.
Reusing artifact-centric business process models : a behavioral consistent specialization approach
- Yongchareon, Sira, Liu, Chengfei, Zhao, Xiaohui
- Authors: Yongchareon, Sira , Liu, Chengfei , Zhao, Xiaohui
- Date: 2020
- Type: Text , Journal article
- Relation: Computing Vol. 102, no. 8 (2020), p. 1843-1879
- Full Text:
- Reviewed:
- Description: Process reuse is one of the important research areas that address efficiency issues in business process modeling. Similar to software reuse, business processes should be able to be componentized and specialized in order to enable flexible process expansion and customization. Current activity/control-flow centric workflow modeling approaches face difficulty in supporting highly flexible process reuse, limited by their procedural nature. In comparison, the emerging artifact-centric workflow modeling approach well fits into these reuse requirements. Beyond the classic class level reuse in existing object-oriented approaches, process reuse faces the challenge of handling synchronization dependencies among artifact lifecycles as parts of a business process. In this article, we propose a theoretical framework for business process specialization that comprises an artifact-centric business process model, a set of methods to design and construct a specialized business process model from a base model, and a set of behavioral consistency criteria to help check the consistency between the two process models. © 2020, Springer-Verlag GmbH Austria, part of Springer Nature.
- Authors: Yongchareon, Sira , Liu, Chengfei , Zhao, Xiaohui
- Date: 2020
- Type: Text , Journal article
- Relation: Computing Vol. 102, no. 8 (2020), p. 1843-1879
- Full Text:
- Reviewed:
- Description: Process reuse is one of the important research areas that address efficiency issues in business process modeling. Similar to software reuse, business processes should be able to be componentized and specialized in order to enable flexible process expansion and customization. Current activity/control-flow centric workflow modeling approaches face difficulty in supporting highly flexible process reuse, limited by their procedural nature. In comparison, the emerging artifact-centric workflow modeling approach well fits into these reuse requirements. Beyond the classic class level reuse in existing object-oriented approaches, process reuse faces the challenge of handling synchronization dependencies among artifact lifecycles as parts of a business process. In this article, we propose a theoretical framework for business process specialization that comprises an artifact-centric business process model, a set of methods to design and construct a specialized business process model from a base model, and a set of behavioral consistency criteria to help check the consistency between the two process models. © 2020, Springer-Verlag GmbH Austria, part of Springer Nature.
Big data and predictive analytics in healthcare in Bangladesh: regulatory challenges
- Hassan, Shafiqul, Dhali, Mohsin, Zaman, Fazluz, Tanveer, Muhammad
- Authors: Hassan, Shafiqul , Dhali, Mohsin , Zaman, Fazluz , Tanveer, Muhammad
- Date: 2021
- Type: Text , Journal article
- Relation: Vol. 7, no. 6 (2021), p.
- Full Text:
- Reviewed:
- Description: Big data analytics and artificial intelligence are revolutionizing the global healthcare industry. As the world accumulates unfathomable volumes of data and health technology grows more and more critical to the advancement of medicine, policymakers and regulators are faced with tough challenges around data security and data privacy. This paper reviews existing regulatory frameworks for artificial intelligence-based medical devices and health data privacy in Bangladesh. The study is legal research employing a comparative approach where data is collected from primary and secondary legal materials and filtered based on policies relating to medical data privacy and medical device regulation of Bangladesh. Such policies are then compared with benchmark policies of the European Union and the USA to test the adequacy of the present regulatory framework of Bangladesh and identify the gaps in the current regulation. The study highlights the gaps in policy and regulation in Bangladesh that are hampering the widespread adoption of big data analytics and artificial intelligence in the industry. Despite the vast benefits that big data would bring to Bangladesh's healthcare industry, it lacks the proper data governance and legal framework necessary to gain consumer trust and move forward. Policymakers and regulators must work collaboratively with clinicians, patients and industry to adopt a new regulatory framework that harnesses the potential of big data but ensures adequate privacy and security of personal data. The article opens valuable insight to regulators, academicians, researchers and legal practitioners regarding the present regulatory loopholes in Bangladesh involving exploiting the promise of big data in the medical field. The study concludes with the recommendation for future research into the area of privacy as it relates to artificial intelligence-based medical devices should consult the patients' perspective by employing quantitative analysis research methodology. © 2021 The Author(s)
- Authors: Hassan, Shafiqul , Dhali, Mohsin , Zaman, Fazluz , Tanveer, Muhammad
- Date: 2021
- Type: Text , Journal article
- Relation: Vol. 7, no. 6 (2021), p.
- Full Text:
- Reviewed:
- Description: Big data analytics and artificial intelligence are revolutionizing the global healthcare industry. As the world accumulates unfathomable volumes of data and health technology grows more and more critical to the advancement of medicine, policymakers and regulators are faced with tough challenges around data security and data privacy. This paper reviews existing regulatory frameworks for artificial intelligence-based medical devices and health data privacy in Bangladesh. The study is legal research employing a comparative approach where data is collected from primary and secondary legal materials and filtered based on policies relating to medical data privacy and medical device regulation of Bangladesh. Such policies are then compared with benchmark policies of the European Union and the USA to test the adequacy of the present regulatory framework of Bangladesh and identify the gaps in the current regulation. The study highlights the gaps in policy and regulation in Bangladesh that are hampering the widespread adoption of big data analytics and artificial intelligence in the industry. Despite the vast benefits that big data would bring to Bangladesh's healthcare industry, it lacks the proper data governance and legal framework necessary to gain consumer trust and move forward. Policymakers and regulators must work collaboratively with clinicians, patients and industry to adopt a new regulatory framework that harnesses the potential of big data but ensures adequate privacy and security of personal data. The article opens valuable insight to regulators, academicians, researchers and legal practitioners regarding the present regulatory loopholes in Bangladesh involving exploiting the promise of big data in the medical field. The study concludes with the recommendation for future research into the area of privacy as it relates to artificial intelligence-based medical devices should consult the patients' perspective by employing quantitative analysis research methodology. © 2021 The Author(s)
A new cascaded multilevel inverter topology with galvanic isolation
- Hasan, Mubashwar, Abu-Siada, Ahmed, Islam, Syed, Dahidah, Mohamed
- Authors: Hasan, Mubashwar , Abu-Siada, Ahmed , Islam, Syed , Dahidah, Mohamed
- Date: 2018
- Type: Text , Journal article
- Relation: IEEE Transactions on Industry Applications Vol. 54, no. 4 (2018), p. 3463-3472
- Full Text:
- Reviewed:
- Description: IEEE This paper presents a new compact three-phase cascaded multilevel inverter (CMLI) topology with reduced device count and high frequency magnetic link. The proposed topology overcomes the predominant limitation of separate DC power supplies, which CMLI always require. The high frequency magnetic link also provides a galvanic isolation between the input and output sides of the inverter, which is essential for various grid-connected applications. The proposed topology utilizes an asymmetric inverter configuration that consists of cascaded H-bridge cells and a conventional three-phase two-level inverter. A toroidal core is employed for the high frequency magnetic link to ensure compact size and high-power density. Compared with counterpart CMLI topologies available in the literatures, the proposed inverter has the advantage of utilizing the least number of power electronic components without compromising the overall performance, particularly when a high number of output voltage levels is required. The feasibility of the proposed inverter is confirmed through extensive simulation and experimentally validated studies.
- Authors: Hasan, Mubashwar , Abu-Siada, Ahmed , Islam, Syed , Dahidah, Mohamed
- Date: 2018
- Type: Text , Journal article
- Relation: IEEE Transactions on Industry Applications Vol. 54, no. 4 (2018), p. 3463-3472
- Full Text:
- Reviewed:
- Description: IEEE This paper presents a new compact three-phase cascaded multilevel inverter (CMLI) topology with reduced device count and high frequency magnetic link. The proposed topology overcomes the predominant limitation of separate DC power supplies, which CMLI always require. The high frequency magnetic link also provides a galvanic isolation between the input and output sides of the inverter, which is essential for various grid-connected applications. The proposed topology utilizes an asymmetric inverter configuration that consists of cascaded H-bridge cells and a conventional three-phase two-level inverter. A toroidal core is employed for the high frequency magnetic link to ensure compact size and high-power density. Compared with counterpart CMLI topologies available in the literatures, the proposed inverter has the advantage of utilizing the least number of power electronic components without compromising the overall performance, particularly when a high number of output voltage levels is required. The feasibility of the proposed inverter is confirmed through extensive simulation and experimentally validated studies.
A comprehensive spectrum trading scheme based on market competition, reputation and buyer specific requirements
- Hassan, Md Rakib, Karmakar, Gour, Kamruzzaman, Joarder, Srinivasan, Bala
- Authors: Hassan, Md Rakib , Karmakar, Gour , Kamruzzaman, Joarder , Srinivasan, Bala
- Date: 2015
- Type: Text , Journal article
- Relation: Computer Networks Vol. 84, no. (2015), p. 17-31
- Full Text:
- Reviewed:
- Description: In the exclusive-use model of spectrum trading, cognitive radio devices or secondary users can buy spectrum resources from licensed users or primary users for a short or long period of time. Considering such spectrum access, a trading model is introduced where a buyer can select a set of candidate sellers based on their reputation and their offers in fulfilling its requirements, namely, offered signal quality, contract duration, coverage and bandwidth. Similarly, a seller can assess a buyer as a potential trading partner considering the buyer's reliability, which the seller can derive from the buyer's reputation and financial profile. In our scheme, seller reputation or buyer reliability can be either obtained from a reputation brokerage service, if one exists, or calculated using our model. Since in a competitive market, the price of a seller depends on that of other sellers, game theory is used to model the competition among multiple sellers. An optimization technique is used by a buyer to select the best seller(s) and optimize purchase to maximize its utility. This may result in buying from multiple sellers of certain amount of bandwidth from each, depending on price and meeting requirements and budget constraints. Stability of the model is analyzed and performance evaluation shows that it benefits sellers and buyers in terms of profit and throughput, respectively. © 2015 Elsevier B.V. All rights reserved.
- Authors: Hassan, Md Rakib , Karmakar, Gour , Kamruzzaman, Joarder , Srinivasan, Bala
- Date: 2015
- Type: Text , Journal article
- Relation: Computer Networks Vol. 84, no. (2015), p. 17-31
- Full Text:
- Reviewed:
- Description: In the exclusive-use model of spectrum trading, cognitive radio devices or secondary users can buy spectrum resources from licensed users or primary users for a short or long period of time. Considering such spectrum access, a trading model is introduced where a buyer can select a set of candidate sellers based on their reputation and their offers in fulfilling its requirements, namely, offered signal quality, contract duration, coverage and bandwidth. Similarly, a seller can assess a buyer as a potential trading partner considering the buyer's reliability, which the seller can derive from the buyer's reputation and financial profile. In our scheme, seller reputation or buyer reliability can be either obtained from a reputation brokerage service, if one exists, or calculated using our model. Since in a competitive market, the price of a seller depends on that of other sellers, game theory is used to model the competition among multiple sellers. An optimization technique is used by a buyer to select the best seller(s) and optimize purchase to maximize its utility. This may result in buying from multiple sellers of certain amount of bandwidth from each, depending on price and meeting requirements and budget constraints. Stability of the model is analyzed and performance evaluation shows that it benefits sellers and buyers in terms of profit and throughput, respectively. © 2015 Elsevier B.V. All rights reserved.
A technique for parallel share-frequent sensor pattern mining from wireless sensor networks
- Rashid, Md. Mamunur, Gondal, Iqbal, Kamruzzaman, Joarder
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2014
- Type: Text , Conference paper
- Relation: 14th Annual International Conference on Computational Science, ICCS 2014; Cairns, Australia; 10th-12th June 2014; published in Procedia Computer Science p. 124-133
- Full Text:
- Reviewed:
- Description: WSNs generate huge amount of data in the form of streams and mining useful knowledge from these streams is a challenging task. Existing works generate sensor association rules using occurrence frequency of patterns with binary frequency (either absent or present) or support of a pattern as a criterion. However, considering the binary frequency or support of a pattern may not be a sufficient indicator for finding meaningful patterns from WSN data because it only reflects the number of epochs in the sensor data which contain that pattern. The share measure of sensorsets could discover useful knowledge about numerical values associated with sensor in a sensor database. Therefore, in this paper, we propose a new type of behavioral pattern called share-frequent sensor patterns by considering the non-binary frequency values of sensors in epochs. To discover share-frequent sensor patterns from sensor dataset, we propose a novel parallel technique. In this technique, we develop a novel tree structure, called parallel share-frequent sensor pattern tree (PShrFSP-tree) that is constructed at each local node independently, by capturing the database contents to generate the candidate patterns using a pattern growth technique with a single scan and then merges the locally generated candidate patterns at the final stage to generate global share-frequent sensor patterns. Comprehensive experimental results show that our proposed model is very efficient for mining share-frequent patterns from WSN data in terms of time and scalability.
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2014
- Type: Text , Conference paper
- Relation: 14th Annual International Conference on Computational Science, ICCS 2014; Cairns, Australia; 10th-12th June 2014; published in Procedia Computer Science p. 124-133
- Full Text:
- Reviewed:
- Description: WSNs generate huge amount of data in the form of streams and mining useful knowledge from these streams is a challenging task. Existing works generate sensor association rules using occurrence frequency of patterns with binary frequency (either absent or present) or support of a pattern as a criterion. However, considering the binary frequency or support of a pattern may not be a sufficient indicator for finding meaningful patterns from WSN data because it only reflects the number of epochs in the sensor data which contain that pattern. The share measure of sensorsets could discover useful knowledge about numerical values associated with sensor in a sensor database. Therefore, in this paper, we propose a new type of behavioral pattern called share-frequent sensor patterns by considering the non-binary frequency values of sensors in epochs. To discover share-frequent sensor patterns from sensor dataset, we propose a novel parallel technique. In this technique, we develop a novel tree structure, called parallel share-frequent sensor pattern tree (PShrFSP-tree) that is constructed at each local node independently, by capturing the database contents to generate the candidate patterns using a pattern growth technique with a single scan and then merges the locally generated candidate patterns at the final stage to generate global share-frequent sensor patterns. Comprehensive experimental results show that our proposed model is very efficient for mining share-frequent patterns from WSN data in terms of time and scalability.
A scalable framework for healthcare monitoring application using the Internet of Medical Things
- Balasubramanian, Venki, Jolfaei, Alireza
- Authors: Balasubramanian, Venki , Jolfaei, Alireza
- Date: 2021
- Type: Text , Journal article
- Relation: Software - Practice and Experience Vol. 51, no. 12 (2021), p. 2457-2468
- Full Text:
- Reviewed:
- Description: Internet of Things (IoT) is finding application in many areas, particularly in health care where an IoT can be effectively used in the form of an Internet of Medical Things (IoMT) to monitor the patients remotely. The quality of life of the patients and health care outcomes can be improved with the deployment of an IoMT because health care professionals can monitor conditions; access the electronic medical records and communicates with each other. This remote monitoring and consultations might reduce the traditional stressful and costly exercise of frequent hospitalization. Also, the rising costs of health care in many developed countries have influenced the introduction of the Healthcare Monitoring Application (HMA) to their existing health care practices. To materialize the HMA concepts for successful deployment for civilian and commercial use with ease, application developers can benefit from a generic, scalable framework that provides significant components for building an HMA. In this chapter, a generic maintainable HMA is advanced by amalgamating the advantages of event-driven and the layered architecture. The proposed framework is used to establish an HMA with an end-to-end Assistive Care Loop Framework (ACLF) to provide a real-time alarm and assistance to monitor pregnant women. © 2020 John Wiley & Sons, Ltd.
- Authors: Balasubramanian, Venki , Jolfaei, Alireza
- Date: 2021
- Type: Text , Journal article
- Relation: Software - Practice and Experience Vol. 51, no. 12 (2021), p. 2457-2468
- Full Text:
- Reviewed:
- Description: Internet of Things (IoT) is finding application in many areas, particularly in health care where an IoT can be effectively used in the form of an Internet of Medical Things (IoMT) to monitor the patients remotely. The quality of life of the patients and health care outcomes can be improved with the deployment of an IoMT because health care professionals can monitor conditions; access the electronic medical records and communicates with each other. This remote monitoring and consultations might reduce the traditional stressful and costly exercise of frequent hospitalization. Also, the rising costs of health care in many developed countries have influenced the introduction of the Healthcare Monitoring Application (HMA) to their existing health care practices. To materialize the HMA concepts for successful deployment for civilian and commercial use with ease, application developers can benefit from a generic, scalable framework that provides significant components for building an HMA. In this chapter, a generic maintainable HMA is advanced by amalgamating the advantages of event-driven and the layered architecture. The proposed framework is used to establish an HMA with an end-to-end Assistive Care Loop Framework (ACLF) to provide a real-time alarm and assistance to monitor pregnant women. © 2020 John Wiley & Sons, Ltd.
Robust image classification using a low-pass activation function and DCT augmentation
- Hossain, Md Tahmid, Teng, Shyh, Sohel, Ferdous, Lu, Guojun
- Authors: Hossain, Md Tahmid , Teng, Shyh , Sohel, Ferdous , Lu, Guojun
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Access Vol. 9, no. (2021), p. 86460-86474
- Full Text:
- Reviewed:
- Description: Convolutional Neural Network's (CNN's) performance disparity on clean and corrupted datasets has recently come under scrutiny. In this work, we analyse common corruptions in the frequency domain, i.e., High Frequency corruptions (HFc, e.g., noise) and Low Frequency corruptions (LFc, e.g., blur). Although a simple solution to HFc is low-pass filtering, ReLU - a widely used Activation Function (AF), does not have any filtering mechanism. In this work, we instill low-pass filtering into the AF (LP-ReLU) to improve robustness against HFc. To deal with LFc, we complement LP-ReLU with Discrete Cosine Transform based augmentation. LP-ReLU, coupled with DCT augmentation, enables a deep network to tackle the entire spectrum of corruption. We use CIFAR-10-C and Tiny ImageNet-C for evaluation and demonstrate improvements of 5% and 7.3% in accuracy respectively, compared to the State-Of-The-Art (SOTA). We further evaluate our method's stability on a variety of perturbations in CIFAR-10-P and Tiny ImageNet-P, achieving new SOTA in these experiments as well. To further strengthen our understanding regarding CNN's lack of robustness, a decision space visualisation process is proposed and presented in this work. © 2013 IEEE.
- Authors: Hossain, Md Tahmid , Teng, Shyh , Sohel, Ferdous , Lu, Guojun
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Access Vol. 9, no. (2021), p. 86460-86474
- Full Text:
- Reviewed:
- Description: Convolutional Neural Network's (CNN's) performance disparity on clean and corrupted datasets has recently come under scrutiny. In this work, we analyse common corruptions in the frequency domain, i.e., High Frequency corruptions (HFc, e.g., noise) and Low Frequency corruptions (LFc, e.g., blur). Although a simple solution to HFc is low-pass filtering, ReLU - a widely used Activation Function (AF), does not have any filtering mechanism. In this work, we instill low-pass filtering into the AF (LP-ReLU) to improve robustness against HFc. To deal with LFc, we complement LP-ReLU with Discrete Cosine Transform based augmentation. LP-ReLU, coupled with DCT augmentation, enables a deep network to tackle the entire spectrum of corruption. We use CIFAR-10-C and Tiny ImageNet-C for evaluation and demonstrate improvements of 5% and 7.3% in accuracy respectively, compared to the State-Of-The-Art (SOTA). We further evaluate our method's stability on a variety of perturbations in CIFAR-10-P and Tiny ImageNet-P, achieving new SOTA in these experiments as well. To further strengthen our understanding regarding CNN's lack of robustness, a decision space visualisation process is proposed and presented in this work. © 2013 IEEE.
Discrete state transition algorithm for unconstrained integer optimization problems
- Zhou, Xiaojun, Gao, David, Yang, Chunhua, Gui, Weihua
- Authors: Zhou, Xiaojun , Gao, David , Yang, Chunhua , Gui, Weihua
- Date: 2016
- Type: Text , Journal article
- Relation: Neurocomputing Vol. 173, no. (2016), p. 864-874
- Full Text:
- Reviewed:
- Description: A recently new intelligent optimization algorithm called discrete state transition algorithm is considered in this study, for solving unconstrained integer optimization problems. Firstly, some key elements for discrete state transition algorithm are summarized to guide its well development. Several intelligent operators are designed for local exploitation and global exploration. Then, a dynamic adjustment strategy "risk and restoration in probability" is proposed to capture global solutions with high probability. Finally, numerical experiments are carried out to test the performance of the proposed algorithm compared with other heuristics, and they show that the similar intelligent operators can be applied to ranging from traveling salesman problem, boolean integer programming, to discrete value selection problem, which indicates the adaptability and flexibility of the proposed intelligent elements. (C) 2015 Elsevier B.V. All rights reserved.
- Authors: Zhou, Xiaojun , Gao, David , Yang, Chunhua , Gui, Weihua
- Date: 2016
- Type: Text , Journal article
- Relation: Neurocomputing Vol. 173, no. (2016), p. 864-874
- Full Text:
- Reviewed:
- Description: A recently new intelligent optimization algorithm called discrete state transition algorithm is considered in this study, for solving unconstrained integer optimization problems. Firstly, some key elements for discrete state transition algorithm are summarized to guide its well development. Several intelligent operators are designed for local exploitation and global exploration. Then, a dynamic adjustment strategy "risk and restoration in probability" is proposed to capture global solutions with high probability. Finally, numerical experiments are carried out to test the performance of the proposed algorithm compared with other heuristics, and they show that the similar intelligent operators can be applied to ranging from traveling salesman problem, boolean integer programming, to discrete value selection problem, which indicates the adaptability and flexibility of the proposed intelligent elements. (C) 2015 Elsevier B.V. All rights reserved.
Internet Gaming Disorder : The interplay between physical activity and user–avatar relationship
- Liew, Lucas, Stavropoulos, Vasileios, Adams, Baxter, Burleigh, Tyrone, Griffiths, Mark
- Authors: Liew, Lucas , Stavropoulos, Vasileios , Adams, Baxter , Burleigh, Tyrone , Griffiths, Mark
- Date: 2018
- Type: Text , Journal article
- Relation: Behaviour and Information Technology Vol. 37, no. 6 (2018), p. 558-574
- Full Text:
- Reviewed:
- Description: Understanding both the risk and protective factors associated with Internet Gaming Disorder (IGD) has been viewed by many in the gaming studies field as an area of research priority. The present study focused on the potential risk and protective effects of user–avatar (game figure) relationship and physical activity (PA), respectively. To address these aims, a cross-sectional and a longitudinal mixed-methods design were combined (comprising both psychological and physiological assessments). A sample of 121 emerging adult gamers (18–29 years) residing in Australia, who played massively multiplayer online games, were assessed in relation to their IGD behaviours using the nine-item Internet Gaming Disorder Scale–Short Form. Additionally, the Proto-Self-Presence (PSP) scale was used to evaluate the extent to which gamers identified with the body of their avatar. Finally, a PA monitor (Fitbit Flex) measured levels of energy consumed during real-world daily activities (active minutes). A number of linear regressions and moderation analyses were conducted. Findings confirmed that PSP functioned as an IGD risk factor and that PA acted protectively, weakening the association between PSP and IGD behaviours. Implications of these findings are discussed in relation to IGD treatment and gaming development aspects.
- Authors: Liew, Lucas , Stavropoulos, Vasileios , Adams, Baxter , Burleigh, Tyrone , Griffiths, Mark
- Date: 2018
- Type: Text , Journal article
- Relation: Behaviour and Information Technology Vol. 37, no. 6 (2018), p. 558-574
- Full Text:
- Reviewed:
- Description: Understanding both the risk and protective factors associated with Internet Gaming Disorder (IGD) has been viewed by many in the gaming studies field as an area of research priority. The present study focused on the potential risk and protective effects of user–avatar (game figure) relationship and physical activity (PA), respectively. To address these aims, a cross-sectional and a longitudinal mixed-methods design were combined (comprising both psychological and physiological assessments). A sample of 121 emerging adult gamers (18–29 years) residing in Australia, who played massively multiplayer online games, were assessed in relation to their IGD behaviours using the nine-item Internet Gaming Disorder Scale–Short Form. Additionally, the Proto-Self-Presence (PSP) scale was used to evaluate the extent to which gamers identified with the body of their avatar. Finally, a PA monitor (Fitbit Flex) measured levels of energy consumed during real-world daily activities (active minutes). A number of linear regressions and moderation analyses were conducted. Findings confirmed that PSP functioned as an IGD risk factor and that PA acted protectively, weakening the association between PSP and IGD behaviours. Implications of these findings are discussed in relation to IGD treatment and gaming development aspects.
Identification of coherent generators by support vector clustering with an embedding strategy
- Babaei, Mehdi, Muyeen, S., Islam, Syed
- Authors: Babaei, Mehdi , Muyeen, S. , Islam, Syed
- Date: 2019
- Type: Text , Journal article
- Relation: IEEE Access Vol. 7, no. (2019), p. 105420-105431
- Full Text:
- Reviewed:
- Description: Identification of coherent generators (CGs) is necessary for the area-based monitoring and protection system of a wide area power system. Synchrophasor has enabled smarter monitoring and control measures to be devised; hence, measurement-based methodologies can be implemented in online applications to identify the CGs. This paper presents a new framework for coherency identification that is based on the dynamic coupling of generators. A distance matrix that contains the dissimilarity indices between any pair of generators is constructed from the pairwise dynamic coupling of generators after the post-disturbance data are obtained by phasor measurement units (PMUs). The dataset is embedded in Euclidean space to produce a new dataset with a metric distance between the points, and then the support vector clustering (SVC) technique is applied to the embedded dataset to identify the final clusters of generators. Unlike other clustering methods that need a priori knowledge about the number of clusters or the parameters of clustering, this information is set in an automatic search procedure that results in the optimal number of clusters. The algorithm is verified by time-domain simulations of defined scenarios in 39 bus and 118 bus test systems. Finally, the clustering result of 39 bus systems is validated by cluster validity measures, and a comparative study investigates the efficacy of the proposed algorithm to cluster the generators with an optimal number of clusters and also its computational efficiency compared with other clustering methods.
- Authors: Babaei, Mehdi , Muyeen, S. , Islam, Syed
- Date: 2019
- Type: Text , Journal article
- Relation: IEEE Access Vol. 7, no. (2019), p. 105420-105431
- Full Text:
- Reviewed:
- Description: Identification of coherent generators (CGs) is necessary for the area-based monitoring and protection system of a wide area power system. Synchrophasor has enabled smarter monitoring and control measures to be devised; hence, measurement-based methodologies can be implemented in online applications to identify the CGs. This paper presents a new framework for coherency identification that is based on the dynamic coupling of generators. A distance matrix that contains the dissimilarity indices between any pair of generators is constructed from the pairwise dynamic coupling of generators after the post-disturbance data are obtained by phasor measurement units (PMUs). The dataset is embedded in Euclidean space to produce a new dataset with a metric distance between the points, and then the support vector clustering (SVC) technique is applied to the embedded dataset to identify the final clusters of generators. Unlike other clustering methods that need a priori knowledge about the number of clusters or the parameters of clustering, this information is set in an automatic search procedure that results in the optimal number of clusters. The algorithm is verified by time-domain simulations of defined scenarios in 39 bus and 118 bus test systems. Finally, the clustering result of 39 bus systems is validated by cluster validity measures, and a comparative study investigates the efficacy of the proposed algorithm to cluster the generators with an optimal number of clusters and also its computational efficiency compared with other clustering methods.
Calibration of an articulated CMM using stochastic approximations
- Sultan, Ibrahim, Puthiyaveettil, Prajeesh
- Authors: Sultan, Ibrahim , Puthiyaveettil, Prajeesh
- Date: 2012
- Type: Text , Journal article
- Relation: International Journal of Advanced Manufacturing Technology Vol. 63, no. 1-4 (2012), p. 201-207
- Full Text:
- Reviewed:
- Description: A coordinate measuring machine (CMM) is meant to digitise the spatial locations of points and feed the resulting measurements to a CAD system for storing and processing. For reliable utilisation of a CMM, a calibration procedure is often undertaken to eliminate the inaccuracies which result from manufacturing, assembly and installation errors. In this paper, an Immersion digitizer coordinate measuring machine has been calibrated using an accurately manufactured master cuboid fixture. This CMM has been designed as an articulated manipulator to enhance its dexterity and versatility. As such, the calibration problem is tackled with the aid of a kinematic model similar to those employed for the analysis of serial robots. In addition, a stochastic-based optimisation technique is used to identify the parameters of the kinematic model in order for the accurate performance to be achieved. The experimental results demonstrate the effectiveness of this method, whereby the measuring accuracy has been improved considerably. © 2012 Springer-Verlag London Limited.
- Description: 2003010394
- Authors: Sultan, Ibrahim , Puthiyaveettil, Prajeesh
- Date: 2012
- Type: Text , Journal article
- Relation: International Journal of Advanced Manufacturing Technology Vol. 63, no. 1-4 (2012), p. 201-207
- Full Text:
- Reviewed:
- Description: A coordinate measuring machine (CMM) is meant to digitise the spatial locations of points and feed the resulting measurements to a CAD system for storing and processing. For reliable utilisation of a CMM, a calibration procedure is often undertaken to eliminate the inaccuracies which result from manufacturing, assembly and installation errors. In this paper, an Immersion digitizer coordinate measuring machine has been calibrated using an accurately manufactured master cuboid fixture. This CMM has been designed as an articulated manipulator to enhance its dexterity and versatility. As such, the calibration problem is tackled with the aid of a kinematic model similar to those employed for the analysis of serial robots. In addition, a stochastic-based optimisation technique is used to identify the parameters of the kinematic model in order for the accurate performance to be achieved. The experimental results demonstrate the effectiveness of this method, whereby the measuring accuracy has been improved considerably. © 2012 Springer-Verlag London Limited.
- Description: 2003010394
A low-complexity equalizer for video broadcasting in cyber-physical social systems through handheld mobile devices
- Solyman, Ahmad, Attar, Hani, Khosravi, Mohammad, Menon, Varun, Jolfaei, Alireza, Balasubramanian, Venki, Selvaraj, Buvana, Tavallali, Pooya
- Authors: Solyman, Ahmad , Attar, Hani , Khosravi, Mohammad , Menon, Varun , Jolfaei, Alireza , Balasubramanian, Venki , Selvaraj, Buvana , Tavallali, Pooya
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 67591-67602
- Full Text:
- Reviewed:
- Description: In Digital Video Broadcasting-Handheld (DVB-H) devices for cyber-physical social systems, the Discrete Fractional Fourier Transform-Orthogonal Chirp Division Multiplexing (DFrFT-OCDM) has been suggested to enhance the performance over Orthogonal Frequency Division Multiplexing (OFDM) systems under time and frequency-selective fading channels. In this case, the need for equalizers like the Minimum Mean Square Error (MMSE) and Zero-Forcing (ZF) arises, though it is excessively complex due to the need for a matrix inversion, especially for DVB-H extensive symbol lengths. In this work, a low complexity equalizer, Least-Squares Minimal Residual (LSMR) algorithm, is used to solve the matrix inversion iteratively. The paper proposes the LSMR algorithm for linear and nonlinear equalizers with the simulation results, which indicate that the proposed equalizer has significant performance and reduced complexity over the classical MMSE equalizer and other low complexity equalizers, in time and frequency-selective fading channels. © 2013 IEEE.
- Authors: Solyman, Ahmad , Attar, Hani , Khosravi, Mohammad , Menon, Varun , Jolfaei, Alireza , Balasubramanian, Venki , Selvaraj, Buvana , Tavallali, Pooya
- Date: 2020
- Type: Text , Journal article
- Relation: IEEE Access Vol. 8, no. (2020), p. 67591-67602
- Full Text:
- Reviewed:
- Description: In Digital Video Broadcasting-Handheld (DVB-H) devices for cyber-physical social systems, the Discrete Fractional Fourier Transform-Orthogonal Chirp Division Multiplexing (DFrFT-OCDM) has been suggested to enhance the performance over Orthogonal Frequency Division Multiplexing (OFDM) systems under time and frequency-selective fading channels. In this case, the need for equalizers like the Minimum Mean Square Error (MMSE) and Zero-Forcing (ZF) arises, though it is excessively complex due to the need for a matrix inversion, especially for DVB-H extensive symbol lengths. In this work, a low complexity equalizer, Least-Squares Minimal Residual (LSMR) algorithm, is used to solve the matrix inversion iteratively. The paper proposes the LSMR algorithm for linear and nonlinear equalizers with the simulation results, which indicate that the proposed equalizer has significant performance and reduced complexity over the classical MMSE equalizer and other low complexity equalizers, in time and frequency-selective fading channels. © 2013 IEEE.
A lightweight integrity protection scheme for low latency smart grid applications
- Jolfaei, Alireza, Kant, Krishna
- Authors: Jolfaei, Alireza , Kant, Krishna
- Date: 2019
- Type: Text , Journal article
- Relation: Computers and Security Vol. 86, no. (2019), p. 471-483
- Full Text:
- Reviewed:
- Description: The substation communication protocol used in smart grid allows the transmission of messages without integrity protection for applications that require very low communication latency. This leaves the real-time measurements taken by phasor measurement units (PMUs) vulnerable to man-in-the-middle attacks, and hence makes high voltage to medium voltage (HV/MV) substations vulnerable to cyber-attacks. In this paper, a lightweight and secure integrity protection algorithm has been proposed to maintain the integrity of PMU data, which fills the missing integrity protection in the IEC 61850-90-5 standard, when the MAC identifier is declared 0. The rigorous security analysis proves the security of the proposed integrity protection method against ciphertext-only attacks and known/chosen plaintext attacks. A comparison with existing integrity protection methods shows that our method is much faster, and is also the only integrity protection scheme that meets the strict timing requirement. Not only the proposed method can be used in power protection applications, but it also can be used in emerging anomaly detection scenarios, where a fast integrity check coupled with low latency communications is used for multiple rounds of message exchanges. This paper is an extension of work originally reported in Proceedings of 14th International Conference on Security and Cryptography (Jolfaei and Kant, 2017).
- Authors: Jolfaei, Alireza , Kant, Krishna
- Date: 2019
- Type: Text , Journal article
- Relation: Computers and Security Vol. 86, no. (2019), p. 471-483
- Full Text:
- Reviewed:
- Description: The substation communication protocol used in smart grid allows the transmission of messages without integrity protection for applications that require very low communication latency. This leaves the real-time measurements taken by phasor measurement units (PMUs) vulnerable to man-in-the-middle attacks, and hence makes high voltage to medium voltage (HV/MV) substations vulnerable to cyber-attacks. In this paper, a lightweight and secure integrity protection algorithm has been proposed to maintain the integrity of PMU data, which fills the missing integrity protection in the IEC 61850-90-5 standard, when the MAC identifier is declared 0. The rigorous security analysis proves the security of the proposed integrity protection method against ciphertext-only attacks and known/chosen plaintext attacks. A comparison with existing integrity protection methods shows that our method is much faster, and is also the only integrity protection scheme that meets the strict timing requirement. Not only the proposed method can be used in power protection applications, but it also can be used in emerging anomaly detection scenarios, where a fast integrity check coupled with low latency communications is used for multiple rounds of message exchanges. This paper is an extension of work originally reported in Proceedings of 14th International Conference on Security and Cryptography (Jolfaei and Kant, 2017).
On the security of permutation-only image encryption schemes
- Jolfaei, Alireza, Wu, Xinwen, Muthukkumarasamy, Vallipuram
- Authors: Jolfaei, Alireza , Wu, Xinwen , Muthukkumarasamy, Vallipuram
- Date: 2016
- Type: Text , Journal article
- Relation: IEEE Transactions on Information Forensics and Security Vol. 11, no. 2 (2016), p. 235-246
- Full Text:
- Reviewed:
- Description: Permutation is a commonly used primitive in multimedia (image/video) encryption schemes, and many permutation-only algorithms have been proposed in recent years for the protection of multimedia data. In permutation-only image ciphers, the entries of the image matrix are scrambled using a permutation mapping matrix which is built by a pseudo-random number generator. The literature on the cryptanalysis of image ciphers indicates that the permutation-only image ciphers are insecure against ciphertext-only attacks and/or known/chosenplaintext attacks. However, the previous studies have not been able to ensure the correct retrieval of the complete plaintext elements. In this paper, we revisited the previous works on cryptanalysis of permutation-only image encryption schemes and made the cryptanalysis work on chosen-plaintext attacks complete and more efficient. We proved that in all permutationonly image ciphers, regardless of the cipher structure, the correct permutation mapping is recovered completely by a chosenplaintext attack. To the best of our knowledge, for the first time, this paper gives a chosen-plaintext attack that completely determines the correct plaintext elements using a deterministic method. When the plain-images are of size M × N and with L different color intensities, the number n of required chosen plain-images to break the permutation-only image encryption algorithm is n = logL(MN). The complexity of the proposed attack is O (n · M N) which indicates its feasibility in a polynomial amount of computation time. To validate the performance of the proposed chosen-plaintext attack, numerous experiments were performed on two recently proposed permutation-only image/video ciphers. Both theoretical and experimental results showed that the proposed attack outperforms the state-of-theart cryptanalytic methods.
- Authors: Jolfaei, Alireza , Wu, Xinwen , Muthukkumarasamy, Vallipuram
- Date: 2016
- Type: Text , Journal article
- Relation: IEEE Transactions on Information Forensics and Security Vol. 11, no. 2 (2016), p. 235-246
- Full Text:
- Reviewed:
- Description: Permutation is a commonly used primitive in multimedia (image/video) encryption schemes, and many permutation-only algorithms have been proposed in recent years for the protection of multimedia data. In permutation-only image ciphers, the entries of the image matrix are scrambled using a permutation mapping matrix which is built by a pseudo-random number generator. The literature on the cryptanalysis of image ciphers indicates that the permutation-only image ciphers are insecure against ciphertext-only attacks and/or known/chosenplaintext attacks. However, the previous studies have not been able to ensure the correct retrieval of the complete plaintext elements. In this paper, we revisited the previous works on cryptanalysis of permutation-only image encryption schemes and made the cryptanalysis work on chosen-plaintext attacks complete and more efficient. We proved that in all permutationonly image ciphers, regardless of the cipher structure, the correct permutation mapping is recovered completely by a chosenplaintext attack. To the best of our knowledge, for the first time, this paper gives a chosen-plaintext attack that completely determines the correct plaintext elements using a deterministic method. When the plain-images are of size M × N and with L different color intensities, the number n of required chosen plain-images to break the permutation-only image encryption algorithm is n = logL(MN). The complexity of the proposed attack is O (n · M N) which indicates its feasibility in a polynomial amount of computation time. To validate the performance of the proposed chosen-plaintext attack, numerous experiments were performed on two recently proposed permutation-only image/video ciphers. Both theoretical and experimental results showed that the proposed attack outperforms the state-of-theart cryptanalytic methods.
Continuous patient monitoring with a patient centric agent : A block architecture
- Uddin, Ashraf, Stranieri, Andrew, Gondal, Iqbal, Balasubramanian, Venki
- Authors: Uddin, Ashraf , Stranieri, Andrew , Gondal, Iqbal , Balasubramanian, Venki
- Date: 2018
- Type: Text , Journal article
- Relation: IEEE Access Vol. 6, no. (2018), p. 32700-32726
- Full Text:
- Reviewed:
- Description: The Internet of Things (IoT) has facilitated services without human intervention for a wide range of applications, including continuous remote patient monitoring (RPM). However, the complexity of RPM architectures, the size of data sets generated and limited power capacity of devices make RPM challenging. In this paper, we propose a tier-based End to End architecture for continuous patient monitoring that has a patient centric agent (PCA) as its center piece. The PCA manages a blockchain component to preserve privacy when data streaming from body area sensors needs to be stored securely. The PCA based architecture includes a lightweight communication protocol to enforce security of data through different segments of a continuous, real time patient monitoring architecture. The architecture includes the insertion of data into a personal blockchain to facilitate data sharing amongst healthcare professionals and integration into electronic health records while ensuring privacy is maintained. The blockchain is customized for RPM with modifications that include having the PCA select a Miner to reduce computational effort, enabling the PCA to manage multiple blockchains for the same patient, and the modification of each block with a prefix tree to minimize energy consumption and incorporate secure transaction payments. Simulation results demonstrate that security and privacy can be enhanced in RPM with the PCA based End to End architecture.
- Authors: Uddin, Ashraf , Stranieri, Andrew , Gondal, Iqbal , Balasubramanian, Venki
- Date: 2018
- Type: Text , Journal article
- Relation: IEEE Access Vol. 6, no. (2018), p. 32700-32726
- Full Text:
- Reviewed:
- Description: The Internet of Things (IoT) has facilitated services without human intervention for a wide range of applications, including continuous remote patient monitoring (RPM). However, the complexity of RPM architectures, the size of data sets generated and limited power capacity of devices make RPM challenging. In this paper, we propose a tier-based End to End architecture for continuous patient monitoring that has a patient centric agent (PCA) as its center piece. The PCA manages a blockchain component to preserve privacy when data streaming from body area sensors needs to be stored securely. The PCA based architecture includes a lightweight communication protocol to enforce security of data through different segments of a continuous, real time patient monitoring architecture. The architecture includes the insertion of data into a personal blockchain to facilitate data sharing amongst healthcare professionals and integration into electronic health records while ensuring privacy is maintained. The blockchain is customized for RPM with modifications that include having the PCA select a Miner to reduce computational effort, enabling the PCA to manage multiple blockchains for the same patient, and the modification of each block with a prefix tree to minimize energy consumption and incorporate secure transaction payments. Simulation results demonstrate that security and privacy can be enhanced in RPM with the PCA based End to End architecture.
Online dispute resolution in mediating EHR disputes : a case study on the impact of emotional intelligence
- Bellucci, Emilia, Venkatraman, Sitalakshmi, Stranieri, Andrew
- Authors: Bellucci, Emilia , Venkatraman, Sitalakshmi , Stranieri, Andrew
- Date: 2020
- Type: Text , Journal article
- Relation: Behaviour and Information Technology Vol. 39, no. 10 (2020), p. 1124-1139
- Full Text:
- Reviewed:
- Description: An Electronic Health Record (EHR) is an individual’s record of all health events that enables critical information to be documented and shared electronically amongst health care providers and patients. The introduction of an EHR, particularly a patient-accessible EHR, can be expected to lead to an escalation of enquiries, complaints and ultimately, disputes. Prevailing opinion is that Online Dispute Resolution (ODR) systems can help with the mediation of certain types of disputes electronically, particularly systems which deploy Artificial Intelligence (AI) to reduce the need for a human mediator. However, disputes regarding health tend to invoke emotional responses from patients that may conceivably impact ODR efficacy. This raises an interesting question on the influence of emotional intelligence (EI) in the process of mediation. Using a phenomenological research methodology simulating doctor–patient disputes mediated with an AI Smart ODR system in place of a human mediator, we found an association between EI and the propensity for a participant to change their previously asserted claims. Our results indicate participants with lower EI tend to prolong resolution compared to those with higher EI. Future research include trialling larger scale ODR systems for specific cohorts of patients in the area of health related dispute resolution are advanced. © 2019 Informa UK Limited, trading as Taylor & Francis Group.
- Authors: Bellucci, Emilia , Venkatraman, Sitalakshmi , Stranieri, Andrew
- Date: 2020
- Type: Text , Journal article
- Relation: Behaviour and Information Technology Vol. 39, no. 10 (2020), p. 1124-1139
- Full Text:
- Reviewed:
- Description: An Electronic Health Record (EHR) is an individual’s record of all health events that enables critical information to be documented and shared electronically amongst health care providers and patients. The introduction of an EHR, particularly a patient-accessible EHR, can be expected to lead to an escalation of enquiries, complaints and ultimately, disputes. Prevailing opinion is that Online Dispute Resolution (ODR) systems can help with the mediation of certain types of disputes electronically, particularly systems which deploy Artificial Intelligence (AI) to reduce the need for a human mediator. However, disputes regarding health tend to invoke emotional responses from patients that may conceivably impact ODR efficacy. This raises an interesting question on the influence of emotional intelligence (EI) in the process of mediation. Using a phenomenological research methodology simulating doctor–patient disputes mediated with an AI Smart ODR system in place of a human mediator, we found an association between EI and the propensity for a participant to change their previously asserted claims. Our results indicate participants with lower EI tend to prolong resolution compared to those with higher EI. Future research include trialling larger scale ODR systems for specific cohorts of patients in the area of health related dispute resolution are advanced. © 2019 Informa UK Limited, trading as Taylor & Francis Group.
Multiple comorbidities of 21 psychological disorders and relationships with psychosocial variables: A study of the online assessment and diagnostic system within a web-based population
- Al-Asadi, Ali, Klein, Britt, Meyer, Denny
- Authors: Al-Asadi, Ali , Klein, Britt , Meyer, Denny
- Date: 2015
- Type: Text , Journal article
- Relation: Journal of Medical Internet Research Vol. 17, no. 2 (2015), p. 355
- Full Text:
- Reviewed:
- Description: Background: While research in the area of e-mental health has received considerable attention over the last decade, there are still many areas that have not been addressed. One such area is the comorbidity of psychological disorders in a Web-based sample using online assessment and diagnostic tools, and the relationships between comorbidities and psychosocial variables. Objective: We aimed to identify comorbidities of psychological disorders of an online sample using an online diagnostic tool. Based on diagnoses made by an automated online assessment and diagnostic system administered to a large group of online participants, multiple comorbidities (co-occurrences) of 21 psychological disorders for males and females were identified. We examined the relationships between dyadic comorbidities of anxiety and depressive disorders and the psychosocial variables sex, age, suicidal ideation, social support, and quality of life. Methods: An online complex algorithm based on the criteria of the Diagnostic and Statistical Manual of Mental Disorders, 4th edition, Text Revision, was used to assign primary and secondary diagnoses of 21 psychological disorders to 12,665 online participants. The frequency of co-occurrences of psychological disorders for males and females were calculated for all disorders. A series of hierarchical loglinear analyses were performed to examine the relationships between the dyadic comorbidities of depression and various anxiety disorders and the variables suicidal ideation, social support, quality of life, sex, and age. Results: A 21-by-21 frequency of co-occurrences of psychological disorders matrix revealed the presence of multiple significant dyadic comorbidities for males and females. Also, for those with some of the dyadic depression and the anxiety disorders, the odds for having suicidal ideation, reporting inadequate social support, and poorer quality of life increased for those with two-disorder comorbidity than for those with only one of the same two disorders. Conclusions: Comorbidities of several psychological disorders using an online assessment tool within a Web-based population were similar to those found in face-to-face clinics using traditional assessment tools. Results provided support for the transdiagnostic approaches and confirmed the positive relationship between comorbidity and suicidal ideation, the negative relationship between comorbidity and social support, and the negative relationship comorbidity and quality of life. © 2015, Journal of Medical Internet Research. All rights reserved.
- Authors: Al-Asadi, Ali , Klein, Britt , Meyer, Denny
- Date: 2015
- Type: Text , Journal article
- Relation: Journal of Medical Internet Research Vol. 17, no. 2 (2015), p. 355
- Full Text:
- Reviewed:
- Description: Background: While research in the area of e-mental health has received considerable attention over the last decade, there are still many areas that have not been addressed. One such area is the comorbidity of psychological disorders in a Web-based sample using online assessment and diagnostic tools, and the relationships between comorbidities and psychosocial variables. Objective: We aimed to identify comorbidities of psychological disorders of an online sample using an online diagnostic tool. Based on diagnoses made by an automated online assessment and diagnostic system administered to a large group of online participants, multiple comorbidities (co-occurrences) of 21 psychological disorders for males and females were identified. We examined the relationships between dyadic comorbidities of anxiety and depressive disorders and the psychosocial variables sex, age, suicidal ideation, social support, and quality of life. Methods: An online complex algorithm based on the criteria of the Diagnostic and Statistical Manual of Mental Disorders, 4th edition, Text Revision, was used to assign primary and secondary diagnoses of 21 psychological disorders to 12,665 online participants. The frequency of co-occurrences of psychological disorders for males and females were calculated for all disorders. A series of hierarchical loglinear analyses were performed to examine the relationships between the dyadic comorbidities of depression and various anxiety disorders and the variables suicidal ideation, social support, quality of life, sex, and age. Results: A 21-by-21 frequency of co-occurrences of psychological disorders matrix revealed the presence of multiple significant dyadic comorbidities for males and females. Also, for those with some of the dyadic depression and the anxiety disorders, the odds for having suicidal ideation, reporting inadequate social support, and poorer quality of life increased for those with two-disorder comorbidity than for those with only one of the same two disorders. Conclusions: Comorbidities of several psychological disorders using an online assessment tool within a Web-based population were similar to those found in face-to-face clinics using traditional assessment tools. Results provided support for the transdiagnostic approaches and confirmed the positive relationship between comorbidity and suicidal ideation, the negative relationship between comorbidity and social support, and the negative relationship comorbidity and quality of life. © 2015, Journal of Medical Internet Research. All rights reserved.
Decisions surrounding adverse drug reaction prescribing : Insights from consumers and implications for decision support
- O'Brien, Michelle, Yearwood, John
- Authors: O'Brien, Michelle , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Research and Practice in Information Technology Vol. 37, no. 1 (2005), p. 57-71
- Full Text:
- Reviewed:
- Description: This paper presents findings from case studies of health consumers who each suspect they may have experienced an adverse drug reaction (ADR). These case studies are part of a larger study involving consumer/doctor decisions surrounding suspected adverse drug reactions and prescribing. Decision support to assist with the diagnosis and management of ADRs has, to date, primarily focused on providing in-time information to prescribers about factors that pertain to the consumer and the medications they are taking. Decision support that includes consumers usually targets treatment decisions. The results of this paper indicate the prescriber is only one decision contributor in a rich tapestry of decision contributors and decision types, and consumer decision types are significantly broader than treatment decisions. The results provide guidance for the development of decision support within this domain.
- Description: C1
- Description: 2003001435
- Authors: O'Brien, Michelle , Yearwood, John
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Research and Practice in Information Technology Vol. 37, no. 1 (2005), p. 57-71
- Full Text:
- Reviewed:
- Description: This paper presents findings from case studies of health consumers who each suspect they may have experienced an adverse drug reaction (ADR). These case studies are part of a larger study involving consumer/doctor decisions surrounding suspected adverse drug reactions and prescribing. Decision support to assist with the diagnosis and management of ADRs has, to date, primarily focused on providing in-time information to prescribers about factors that pertain to the consumer and the medications they are taking. Decision support that includes consumers usually targets treatment decisions. The results of this paper indicate the prescriber is only one decision contributor in a rich tapestry of decision contributors and decision types, and consumer decision types are significantly broader than treatment decisions. The results provide guidance for the development of decision support within this domain.
- Description: C1
- Description: 2003001435
Gene regulatory network modeling via global optimization of high-order dynamic Bayesian network
- Nguyen, Vinh, Chetty, Madhu, Coppel, Ross, Wangikar, Pramod
- Authors: Nguyen, Vinh , Chetty, Madhu , Coppel, Ross , Wangikar, Pramod
- Date: 2012
- Type: Text , Journal article
- Relation: BMC Bioinformatics Vol. 13, no. 131 (2012), p. 1-16
- Full Text:
- Reviewed:
- Description: Abstract Background Dynamic Bayesian network (DBN) is among the mainstream approaches for modeling various biological networks, including the gene regulatory network (GRN). Most current methods for learning DBN employ either local search such as hill-climbing, or a meta stochastic global optimization framework such as genetic algorithm or simulated annealing, which are only able to locate sub-optimal solutions. Further, current DBN applications have essentially been limited to small sized networks. Results To overcome the above difficulties, we introduce here a deterministic global optimization based DBN approach for reverse engineering genetic networks from time course gene expression data. For such DBN models that consist only of inter time slice arcs, we show that there exists a polynomial time algorithm for learning the globally optimal network structure. The proposed approach, named GlobalMIT+, employs the recently proposed information theoretic scoring metric named mutual information test (MIT). GlobalMIT+ is able to learn high-order time delayed genetic interactions, which are common to most biological systems. Evaluation of the approach using both synthetic and real data sets, including a 733 cyanobacterial gene expression data set, shows significantly improved performance over other techniques. Conclusions Our studies demonstrate that deterministic global optimization approaches can infer large scale genetic networks.
- Authors: Nguyen, Vinh , Chetty, Madhu , Coppel, Ross , Wangikar, Pramod
- Date: 2012
- Type: Text , Journal article
- Relation: BMC Bioinformatics Vol. 13, no. 131 (2012), p. 1-16
- Full Text:
- Reviewed:
- Description: Abstract Background Dynamic Bayesian network (DBN) is among the mainstream approaches for modeling various biological networks, including the gene regulatory network (GRN). Most current methods for learning DBN employ either local search such as hill-climbing, or a meta stochastic global optimization framework such as genetic algorithm or simulated annealing, which are only able to locate sub-optimal solutions. Further, current DBN applications have essentially been limited to small sized networks. Results To overcome the above difficulties, we introduce here a deterministic global optimization based DBN approach for reverse engineering genetic networks from time course gene expression data. For such DBN models that consist only of inter time slice arcs, we show that there exists a polynomial time algorithm for learning the globally optimal network structure. The proposed approach, named GlobalMIT+, employs the recently proposed information theoretic scoring metric named mutual information test (MIT). GlobalMIT+ is able to learn high-order time delayed genetic interactions, which are common to most biological systems. Evaluation of the approach using both synthetic and real data sets, including a 733 cyanobacterial gene expression data set, shows significantly improved performance over other techniques. Conclusions Our studies demonstrate that deterministic global optimization approaches can infer large scale genetic networks.