Pub Date : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377326
H. M. Bilal, Usman Akhtar, Asim Abbas, Muhammad Asif Razzaq, U. Rehman, Jamil Hussain, S. Kang, Sungyoung Lee, Seong-Bae Park
Recent evidence shows that occurrence of Non-Communicable Diseases (NCDs) are the leading cause of death in low and middle-income countries. The fitness applications are not capable enough to help persons with NCDs to change their lifestyle behavior for improving life quality. Currently, the major focus of the existing healthcare applications is towards general public fitness. However, existing solutions lacks in monitoring and adaptation of healthy behaviors. The rehabilitation of person with NCDs is very demanding and challenging to avoid and reduce the advert impacts. In this paper, we argue that the context based behavior adaption observing multiple factors provides an appropriate solution. We have developed a methodology of context-based Just-in-Time actionable interventions for adopting healthy behavior. The risk factors defining the target context are obtained from literature and evaluated by 7 experts with inter-rater agreement kappa value of 0.5 based on 3 categories. The result shows the effectiveness of our proposed approach and depicts the usefulness of context-based intervention in terms of higher receptivity and user satisfaction level. The implicit feedback from 142 persons with different NCDs highlighted the effectiveness of methodology with 82.37% of responded intervention. Whereas, the explicit UEQ benchmark result indicated that the application got excellent responses in the categories of attractiveness, motivation, and novelty.
{"title":"CbI-M: Context-based Intervention Methodology for Rehabilitation of Persons with NCDs","authors":"H. M. Bilal, Usman Akhtar, Asim Abbas, Muhammad Asif Razzaq, U. Rehman, Jamil Hussain, S. Kang, Sungyoung Lee, Seong-Bae Park","doi":"10.1109/IMCOM51814.2021.9377326","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377326","url":null,"abstract":"Recent evidence shows that occurrence of Non-Communicable Diseases (NCDs) are the leading cause of death in low and middle-income countries. The fitness applications are not capable enough to help persons with NCDs to change their lifestyle behavior for improving life quality. Currently, the major focus of the existing healthcare applications is towards general public fitness. However, existing solutions lacks in monitoring and adaptation of healthy behaviors. The rehabilitation of person with NCDs is very demanding and challenging to avoid and reduce the advert impacts. In this paper, we argue that the context based behavior adaption observing multiple factors provides an appropriate solution. We have developed a methodology of context-based Just-in-Time actionable interventions for adopting healthy behavior. The risk factors defining the target context are obtained from literature and evaluated by 7 experts with inter-rater agreement kappa value of 0.5 based on 3 categories. The result shows the effectiveness of our proposed approach and depicts the usefulness of context-based intervention in terms of higher receptivity and user satisfaction level. The implicit feedback from 142 persons with different NCDs highlighted the effectiveness of methodology with 82.37% of responded intervention. Whereas, the explicit UEQ benchmark result indicated that the application got excellent responses in the categories of attractiveness, motivation, and novelty.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115032373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-11-06DOI: 10.1109/IMCOM51814.2021.9377349
V. Parque, T. Miyashita
Trees are useful entities allowing to model data structures and hierarchical relationships in networked decision systems ubiquitously. An ordered tree is a rooted tree where the order of the subtrees (children) of a node is significant. In combinatorial optimization, generating ordered trees is relevant to evaluate candidate combinatorial objects. In this paper, we present an algebraic scheme to generate ordered trees with $n$ vertices with utmost efficiency; whereby our approach uses $O$ (n) space and $O$ (1) time in average per tree. Our computational studies have shown the feasibility and efficiency to generate ordered trees in constant time in average, in about one tenth of a millisecond per ordered tree. Due to the 1–1 bijective nature to other combinatorial classes, our approach is favorable to study the generation of binary trees with $n$ external nodes, trees with $n$ nodes, legal sequences of $n$ pairs of parentheses, triangulated n-gons, gambler's sequences and lattice paths. We believe our scheme may find its use in devising algorithms for planning and combinatorial optimization involving Catalan numbers.
{"title":"An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time","authors":"V. Parque, T. Miyashita","doi":"10.1109/IMCOM51814.2021.9377349","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377349","url":null,"abstract":"Trees are useful entities allowing to model data structures and hierarchical relationships in networked decision systems ubiquitously. An ordered tree is a rooted tree where the order of the subtrees (children) of a node is significant. In combinatorial optimization, generating ordered trees is relevant to evaluate candidate combinatorial objects. In this paper, we present an algebraic scheme to generate ordered trees with $n$ vertices with utmost efficiency; whereby our approach uses $O$ (n) space and $O$ (1) time in average per tree. Our computational studies have shown the feasibility and efficiency to generate ordered trees in constant time in average, in about one tenth of a millisecond per ordered tree. Due to the 1–1 bijective nature to other combinatorial classes, our approach is favorable to study the generation of binary trees with $n$ external nodes, trees with $n$ nodes, legal sequences of $n$ pairs of parentheses, triangulated n-gons, gambler's sequences and lattice paths. We believe our scheme may find its use in devising algorithms for planning and combinatorial optimization involving Catalan numbers.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130286518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-19DOI: 10.1109/IMCOM51814.2021.9377426
F. Mohammadi, Farzan Shenavarmasouleh, M. Amini, H. Arabnia
Steganography algorithms facilitate communication between a source and a destination in a secret manner. This is done by embedding messages/text/data into images without impacting the appearance of the resultant images/videos. Ste-ganalysis is the science of determining if an image has secret messages embedded/hidden in it. Because there are numerous steganography algorithms, and since each one of them requires a different type of steganalysis, the steganalysis process is extremely challenging. Thus, researchers aim to develop one universal steganalysis to detect all steganography algorithms. Universal steganalysis extracts a large number of features to distinguish stego images from cover images. However, this leads to the problem of the curse of dimensionality (CoD), which is considered to be an NP-hard problem. Generating a machine learning based model also takes a long time which makes real-time processing appear impossible in any optimization for time-intensive fields such as visual computing. In this study, we investigate previously developed evolutionary algorithms for boosting real-time image processing and argue that they provide the most promising solutions for the CoD problem.
{"title":"Evolutionary Algorithms and Efficient Data Analytics for Image Processing","authors":"F. Mohammadi, Farzan Shenavarmasouleh, M. Amini, H. Arabnia","doi":"10.1109/IMCOM51814.2021.9377426","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377426","url":null,"abstract":"Steganography algorithms facilitate communication between a source and a destination in a secret manner. This is done by embedding messages/text/data into images without impacting the appearance of the resultant images/videos. Ste-ganalysis is the science of determining if an image has secret messages embedded/hidden in it. Because there are numerous steganography algorithms, and since each one of them requires a different type of steganalysis, the steganalysis process is extremely challenging. Thus, researchers aim to develop one universal steganalysis to detect all steganography algorithms. Universal steganalysis extracts a large number of features to distinguish stego images from cover images. However, this leads to the problem of the curse of dimensionality (CoD), which is considered to be an NP-hard problem. Generating a machine learning based model also takes a long time which makes real-time processing appear impossible in any optimization for time-intensive fields such as visual computing. In this study, we investigate previously developed evolutionary algorithms for boosting real-time image processing and argue that they provide the most promising solutions for the CoD problem.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122919840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：