For effective smart media service, a reliable and confidential context recognition is required to prepare and react properly. However, it is difficult to achieve a higher confidence level for several reasons. First, raw data from multiple sensors have different degrees of uncertainty. Second, generated contexts can indicate conflicting results, even though they are acquired by simultaneous operations. In this paper, we demonstrate an Evidential Fusion Network (EFN) based context reasoning for smart media service. For this we conduct the context classification and state-space based context modelling. Then, we perform the static evidential fusion process (SEFP) to obtain a higher confidence level of contextual information. It processes sensor data with an evidential form based on the Dezert-smarandache theory (DSmT). The execution with proposed example scenario demonstrates that the DSmT approach based on PCR5 rule performs better than the DST approach based on Dempster's rule.
{"title":"An Evidential Fusion Network based context reasoning for smart media service","authors":"Hyo-Jin Park, Jinhong Yang, Sanghong An, J. Choi","doi":"10.5281/ZENODO.34762","DOIUrl":"https://doi.org/10.5281/ZENODO.34762","url":null,"abstract":"For effective smart media service, a reliable and confidential context recognition is required to prepare and react properly. However, it is difficult to achieve a higher confidence level for several reasons. First, raw data from multiple sensors have different degrees of uncertainty. Second, generated contexts can indicate conflicting results, even though they are acquired by simultaneous operations. In this paper, we demonstrate an Evidential Fusion Network (EFN) based context reasoning for smart media service. For this we conduct the context classification and state-space based context modelling. Then, we perform the static evidential fusion process (SEFP) to obtain a higher confidence level of contextual information. It processes sensor data with an evidential form based on the Dezert-smarandache theory (DSmT). The execution with proposed example scenario demonstrates that the DSmT approach based on PCR5 rule performs better than the DST approach based on Dempster's rule.","PeriodicalId":118033,"journal":{"name":"2013 15th International Conference on Advanced Communications Technology (ICACT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130426045","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 : 2013-03-28DOI: 10.7472/JKSII.2013.14.5.77
Sung-jo Park, Minjae Park, Hyunah Kim, Haksung Kim, Wonhyun Yoon, T. B. Yoon, Kwanghoon Pio Kim
The purpose of this paper is to build a theoretical approach for numerically analyzing closeness centrality measures among workflow-actors of workflow-supported social network models to be formed through BPM(workflow)-driven organizational operations. The essential part of the proposed approach is a closeness centrality analysis equation to calculate each performer's closeness centrality measure on a workflow-supported social network model. In this paper, we try to develop an algorithm that is able to efficiently compute the closeness centrality analysis equation suggested from the conventional social network analysis literature, and eventually the developed algorithm will be applied to analyzing the degree of work-intimacy among those workflow-actors who are allocated to perform the corresponding workflow model.
{"title":"A closeness centrality analysis algorithm for workflow-supported social networks","authors":"Sung-jo Park, Minjae Park, Hyunah Kim, Haksung Kim, Wonhyun Yoon, T. B. Yoon, Kwanghoon Pio Kim","doi":"10.7472/JKSII.2013.14.5.77","DOIUrl":"https://doi.org/10.7472/JKSII.2013.14.5.77","url":null,"abstract":"The purpose of this paper is to build a theoretical approach for numerically analyzing closeness centrality measures among workflow-actors of workflow-supported social network models to be formed through BPM(workflow)-driven organizational operations. The essential part of the proposed approach is a closeness centrality analysis equation to calculate each performer's closeness centrality measure on a workflow-supported social network model. In this paper, we try to develop an algorithm that is able to efficiently compute the closeness centrality analysis equation suggested from the conventional social network analysis literature, and eventually the developed algorithm will be applied to analyzing the degree of work-intimacy among those workflow-actors who are allocated to perform the corresponding workflow model.","PeriodicalId":118033,"journal":{"name":"2013 15th International Conference on Advanced Communications Technology (ICACT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117044768","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 : 2013-03-28DOI: 10.1109/ICACT.2014.6779187
H. Kanemitsu, M. Hanada, Takashige Hoshiai, H. Nakazato
In the last decades, many kinds of task execution models such as grid and cloud computing have been developed. In such distributed systems, each task is processed by respective processor in multicored computers e.g., household PCs which we can easily harness in recent years. If there is one policy to automatically decide the “best” combination and the number of processors (and computers), we effectively utilize those computational resources, thereby large number of jobs can be executed in parallel. In this paper, we propose a method for mapping of execution units for such environments. The method adopts a remapping technology after processor-execution unit mapping[6] is finished. Experimental comparisons by a simulation show the advantages of the proposed method.
{"title":"Effective use of computational resources in multicore distributed systems","authors":"H. Kanemitsu, M. Hanada, Takashige Hoshiai, H. Nakazato","doi":"10.1109/ICACT.2014.6779187","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779187","url":null,"abstract":"In the last decades, many kinds of task execution models such as grid and cloud computing have been developed. In such distributed systems, each task is processed by respective processor in multicored computers e.g., household PCs which we can easily harness in recent years. If there is one policy to automatically decide the “best” combination and the number of processors (and computers), we effectively utilize those computational resources, thereby large number of jobs can be executed in parallel. In this paper, we propose a method for mapping of execution units for such environments. The method adopts a remapping technology after processor-execution unit mapping[6] is finished. Experimental comparisons by a simulation show the advantages of the proposed method.","PeriodicalId":118033,"journal":{"name":"2013 15th International Conference on Advanced Communications Technology (ICACT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128521957","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
扫码关注我们
求助内容：
应助结果提醒方式：