Pub Date : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377429
Nakema Deonauth, Xiangtai Chen, Mingchu Li
Exploring behavioral patterns amongst scholars in Academic Social Networks (ASNs) has attracted significant attention in the field of social computing in recent years. Scholars are faced with a dilemma in which they either opt to cooperate with others or to spend their limited resources for their own individual gain. These interactions and decisions can be modeled using Game Theory. Recent research has shown that favorable longterm strategies are characterized as being reciprocal, forgiving, and flexible. Little focus has been given to the phenomenon of Upstream Reciprocity (UR), which occurs when a person who has just received help, in turn, offers help to another, in a ‘pay it forward’ manner. This paper provides a framework to model scholarly interactions of ASNs using an iterative multi-player game and investigates the occurrence of UR amongst players. The presence of UR amongst scholars is observed and shows to possess a higher publication and citation count by those who adopt it. Moreover, cascades of UR have been identified to replicate throughout the network, thereby increasing further adoption of this behavior. More importantly theoretical proof is provided that suggests that UR has the potential to become an Evolutionary Stable Strategy (ESS).
近年来，学者在学术社交网络(Academic Social Networks, ASNs)中的行为模式研究引起了社会计算领域的广泛关注。学者们面临着一个两难的选择:要么选择与他人合作，要么将有限的资源用于自己的个人利益。这些互动和决策可以用博弈论来建模。最近的研究表明，有利的长期策略具有互惠、宽容和灵活的特点。很少有人关注上游互惠(UR)现象，即刚刚得到帮助的人反过来以“传递”的方式向另一个人提供帮助。本文提供了一个框架，使用迭代的多玩家游戏来模拟人工神经网络的学术互动，并研究了玩家之间UR的发生。UR在学者中的存在被观察到，并且表明那些采用UR的人拥有更高的出版物和引用数。此外，已经确定UR级联在整个网络中复制，从而进一步增加了这种行为的采用。更重要的是提供了理论证据，表明UR有可能成为一种进化稳定策略(ESS)。
{"title":"Scientific Collaboration Analytics based on Multi-Player Game Theory","authors":"Nakema Deonauth, Xiangtai Chen, Mingchu Li","doi":"10.1109/IMCOM51814.2021.9377429","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377429","url":null,"abstract":"Exploring behavioral patterns amongst scholars in Academic Social Networks (ASNs) has attracted significant attention in the field of social computing in recent years. Scholars are faced with a dilemma in which they either opt to cooperate with others or to spend their limited resources for their own individual gain. These interactions and decisions can be modeled using Game Theory. Recent research has shown that favorable longterm strategies are characterized as being reciprocal, forgiving, and flexible. Little focus has been given to the phenomenon of Upstream Reciprocity (UR), which occurs when a person who has just received help, in turn, offers help to another, in a ‘pay it forward’ manner. This paper provides a framework to model scholarly interactions of ASNs using an iterative multi-player game and investigates the occurrence of UR amongst players. The presence of UR amongst scholars is observed and shows to possess a higher publication and citation count by those who adopt it. Moreover, cascades of UR have been identified to replicate throughout the network, thereby increasing further adoption of this behavior. More importantly theoretical proof is provided that suggests that UR has the potential to become an Evolutionary Stable Strategy (ESS).","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"6 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":"117056906","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377427
Takashi Ito
Genetic programming (GP), which is an evolutionary computational method, is known to be effective for agent problems because individuals are represented by a tree structure. As an extension method, GP with control nodes (GPCN) has been proposed. Because one individual has multiple tree structures, GPCN can efficiently evolve and obtain highly readable behavioral rules. However, the number of trees suitable for each problem has to be manually adjusted in advance and cannot be easily applied various problems. In the previous study, a method for automatically determining the number of trees have proposed. However, because the method of the previous study changes the fitness function and uses a special population, it cannot be combined with the extension methods to improve the evolution performance. In this study, a method for searching for the appropriate number of trees using three islands is proposed. The proposed method divides the population into three islands, but because the genetic operations and the fitness function of each island are not changed, it can be combined with the existing extension methods. In the experiments, they are compared these using two benchmark problems.
{"title":"Search Method of Number of Trees for Genetic Programming with Multiple Trees","authors":"Takashi Ito","doi":"10.1109/IMCOM51814.2021.9377427","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377427","url":null,"abstract":"Genetic programming (GP), which is an evolutionary computational method, is known to be effective for agent problems because individuals are represented by a tree structure. As an extension method, GP with control nodes (GPCN) has been proposed. Because one individual has multiple tree structures, GPCN can efficiently evolve and obtain highly readable behavioral rules. However, the number of trees suitable for each problem has to be manually adjusted in advance and cannot be easily applied various problems. In the previous study, a method for automatically determining the number of trees have proposed. However, because the method of the previous study changes the fitness function and uses a special population, it cannot be combined with the extension methods to improve the evolution performance. In this study, a method for searching for the appropriate number of trees using three islands is proposed. The proposed method divides the population into three islands, but because the genetic operations and the fitness function of each island are not changed, it can be combined with the existing extension methods. In the experiments, they are compared these using two benchmark problems.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"14 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":"127368703","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377399
Z. Jahanshiri, M. S. Abadeh, H. Sajedi
Estimation of biological brain age is one of the topics that has been much discussed in recent years. One of the most important reasons for this is the possibility of early detection of neurodegenerative disorders such as Alzheimer's and Parkinson's with Brain Age Estimation (BAE). Brain imaging is one of the most important data to estimate the biological age of the brain. Because the brain's natural aging follows a particular pattern, it enables researchers and physicians to predict the human brain's age from its degeneration. Some studies have been done on 2D or 3D brain images data for this purpose. In this study, an ensemble structure, including 3D and 2D Convolutional Neural Networks (CNNs), is used to BAE. The proposed ensemble CNN (ECNN) method obtained a Mean Absolute Error (MAE) of 3.57 years, which is better than the previous studies.
{"title":"Brain Age Estimation based on Brain MRI by an Ensemble of Deep Networks","authors":"Z. Jahanshiri, M. S. Abadeh, H. Sajedi","doi":"10.1109/IMCOM51814.2021.9377399","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377399","url":null,"abstract":"Estimation of biological brain age is one of the topics that has been much discussed in recent years. One of the most important reasons for this is the possibility of early detection of neurodegenerative disorders such as Alzheimer's and Parkinson's with Brain Age Estimation (BAE). Brain imaging is one of the most important data to estimate the biological age of the brain. Because the brain's natural aging follows a particular pattern, it enables researchers and physicians to predict the human brain's age from its degeneration. Some studies have been done on 2D or 3D brain images data for this purpose. In this study, an ensemble structure, including 3D and 2D Convolutional Neural Networks (CNNs), is used to BAE. The proposed ensemble CNN (ECNN) method obtained a Mean Absolute Error (MAE) of 3.57 years, which is better than the previous studies.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"11 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":"126124877","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377376
Sihan Tian, Yun Liu, Yansong Zhang, Yingsi Zhao
To optimize the Byzantine fault tolerance of Raft algorithm, a Byzantine fault-tolerant B-Raft algorithm combined with Schnorr signature mechanism is proposed. First, during leader election, followers are required to sign the ballot to prevent the Byzantine node from forging the vote. Second, the client is required to sign the message when sending the message to leader to prevent the Byzantine leader from tampering with the logs. B-Raft combines the signature mechanism with the Raft algorithm and several modifications and additions provide Byzantine fault tolerance. The results of the experiments launched in Hyperledger Fabric show that compared with the Raft algorithm, the safety of B-Raft is greatly improved.
{"title":"A Byzantine Fault-Tolerant Raft Algorithm Combined with Schnorr Signature","authors":"Sihan Tian, Yun Liu, Yansong Zhang, Yingsi Zhao","doi":"10.1109/IMCOM51814.2021.9377376","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377376","url":null,"abstract":"To optimize the Byzantine fault tolerance of Raft algorithm, a Byzantine fault-tolerant B-Raft algorithm combined with Schnorr signature mechanism is proposed. First, during leader election, followers are required to sign the ballot to prevent the Byzantine node from forging the vote. Second, the client is required to sign the message when sending the message to leader to prevent the Byzantine leader from tampering with the logs. B-Raft combines the signature mechanism with the Raft algorithm and several modifications and additions provide Byzantine fault tolerance. The results of the experiments launched in Hyperledger Fabric show that compared with the Raft algorithm, the safety of B-Raft is greatly improved.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"16 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":"122947805","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377407
Hoil Ryu, Dongwoo Kang, Dongho Won
The term “digital signature” refers to electronic information that is used to identify signatories and indicate that they have signed a document; such information is either attached to or logically combined with a specific electronic document. However, digital signatures entail privacy infringements because it is possible to verify such signatures only when all the data are disclosed to the verifier. Zero-knowledge proofs are considered to be capable of solving this privacy problem. In general, a zero-knowledge proof can be established even if the prover hides the information required in the verification process from the verifier. Zero-knowledge succinct non-interactive argument of knowledge (ZK-SNARK), a prevalent zero-knowledge proof, has been optimized to generate non-interactive and succinct proofs; nevertheless, the generation of proofs is excessively time consuming, making the application of ZK-SNARK impractical in most scenarios. In this paper, we show that existing cryptographic algorithms, such as a one-way hash function or digital signature, can be combined with a zero knowledge proof. Particularly, we propose the multi-argument zero-knowledge argument (MAZKA) algorithm, which can verify data by exposing only the part to be verified and also verify that the part of data has not been manipulated compared to the original. In addition, the proposed algorithm satisfies the adaptive proof of knowledge, perfect zero-knowledze and combinatorial succinctness conditions.
{"title":"On a Partially Verifiable Multi-party Multi-argument Zero-knowledge Proof","authors":"Hoil Ryu, Dongwoo Kang, Dongho Won","doi":"10.1109/IMCOM51814.2021.9377407","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377407","url":null,"abstract":"The term “digital signature” refers to electronic information that is used to identify signatories and indicate that they have signed a document; such information is either attached to or logically combined with a specific electronic document. However, digital signatures entail privacy infringements because it is possible to verify such signatures only when all the data are disclosed to the verifier. Zero-knowledge proofs are considered to be capable of solving this privacy problem. In general, a zero-knowledge proof can be established even if the prover hides the information required in the verification process from the verifier. Zero-knowledge succinct non-interactive argument of knowledge (ZK-SNARK), a prevalent zero-knowledge proof, has been optimized to generate non-interactive and succinct proofs; nevertheless, the generation of proofs is excessively time consuming, making the application of ZK-SNARK impractical in most scenarios. In this paper, we show that existing cryptographic algorithms, such as a one-way hash function or digital signature, can be combined with a zero knowledge proof. Particularly, we propose the multi-argument zero-knowledge argument (MAZKA) algorithm, which can verify data by exposing only the part to be verified and also verify that the part of data has not been manipulated compared to the original. In addition, the proposed algorithm satisfies the adaptive proof of knowledge, perfect zero-knowledze and combinatorial succinctness conditions.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"223 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114045961","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377366
T. K. Dang, M. Ta, N. Hoang
With the development of technology, data is becoming an extremely valuable resource. Data is being created, analyzed and used in a massive scale in every modern system. As a result, data analysis and data mining are very essential in each aspect of social applications. The value of data will be more useful if it can be linked and merged with other different data resources, especially for solving current social problems. In order to make a reality of this big challenge, data transformation is a crucial step that we have to overcome. Among data conversion methods, the intermediate method is to be a preferable one due to its expandable ability. However, for this type of model, finding the intermediate data type for the system is the crucial problem that needs to be solved firstly. In this paper, we will make comparisons among some popular data formats to find the appropriate data type for this elastic data conversion system.
{"title":"Intermediate Data Format for the Elastic Data Conversion Framework","authors":"T. K. Dang, M. Ta, N. Hoang","doi":"10.1109/IMCOM51814.2021.9377366","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377366","url":null,"abstract":"With the development of technology, data is becoming an extremely valuable resource. Data is being created, analyzed and used in a massive scale in every modern system. As a result, data analysis and data mining are very essential in each aspect of social applications. The value of data will be more useful if it can be linked and merged with other different data resources, especially for solving current social problems. In order to make a reality of this big challenge, data transformation is a crucial step that we have to overcome. Among data conversion methods, the intermediate method is to be a preferable one due to its expandable ability. However, for this type of model, finding the intermediate data type for the system is the crucial problem that needs to be solved firstly. In this paper, we will make comparisons among some popular data formats to find the appropriate data type for this elastic data conversion system.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"133 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":"116625142","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377411
Dohyung Kim, Jahwan Koo, U. Kim
Imbalanced and noisy classification problems pose a challenge for predictive modeling as most of the machine learning algorithms used for classification were designed around the assumption of an equal number of non-noisy examples for each class. Models with these problems cause classification errors. We propose a multi-label text classification model based on BERT, EnvBERT, which includes multi-label features in text classification and has good predictive performance for imbalanced, noisy environmental news data. EnvBERT is based on the KoBERT model pre-trained with Korean text data. We used the data oversampling technique to resolve the imbalanced characteristics of multi-label data and fine-tuned while setting a global threshold for label prediction. As a result, we show that EnvBERT improves classification performance by more than 80% on the imbalanced and noisy environmental news data.
{"title":"EnvBERT: Multi-Label Text Classification for Imbalanced, Noisy Environmental News Data","authors":"Dohyung Kim, Jahwan Koo, U. Kim","doi":"10.1109/IMCOM51814.2021.9377411","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377411","url":null,"abstract":"Imbalanced and noisy classification problems pose a challenge for predictive modeling as most of the machine learning algorithms used for classification were designed around the assumption of an equal number of non-noisy examples for each class. Models with these problems cause classification errors. We propose a multi-label text classification model based on BERT, EnvBERT, which includes multi-label features in text classification and has good predictive performance for imbalanced, noisy environmental news data. EnvBERT is based on the KoBERT model pre-trained with Korean text data. We used the data oversampling technique to resolve the imbalanced characteristics of multi-label data and fine-tuned while setting a global threshold for label prediction. As a result, we show that EnvBERT improves classification performance by more than 80% on the imbalanced and noisy environmental news data.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"1 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":"114122066","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377389
N. Ahmad, Tasnia Sharmin, Jesmin Akter, Rashedul Amin Tuhin, A. Das
The Internet is a blessing to our modern era. We cannot think of our life without it. It is used for various purposes. Children are most likely spending their leisure time watching YouTube videos or playing different online games. Sometimes they become addicted. Internet addiction is one of the most cynical, dangerous consequences of this. This study aims to determine any typical behavioral pattern in the average level and excessive level of Internet users based on watching YouTube videos and playing online games. This study is conducted for eight to seventeen years old children. It is a qualitative study, and the method used for this study is a questionnaire survey and case study. Results indicate that some behavioral issues are present in both average and excessive levels of internet users. For the case study, a difference is found between the actual and assumed Internet usage time of participants. This paper will help parents and many researchers because it will give them a new viewpoint on this serious issue.
{"title":"Behavioral Issues of Children in Terms of Internet Usages Time in Bangladesh","authors":"N. Ahmad, Tasnia Sharmin, Jesmin Akter, Rashedul Amin Tuhin, A. Das","doi":"10.1109/IMCOM51814.2021.9377389","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377389","url":null,"abstract":"The Internet is a blessing to our modern era. We cannot think of our life without it. It is used for various purposes. Children are most likely spending their leisure time watching YouTube videos or playing different online games. Sometimes they become addicted. Internet addiction is one of the most cynical, dangerous consequences of this. This study aims to determine any typical behavioral pattern in the average level and excessive level of Internet users based on watching YouTube videos and playing online games. This study is conducted for eight to seventeen years old children. It is a qualitative study, and the method used for this study is a questionnaire survey and case study. Results indicate that some behavioral issues are present in both average and excessive levels of internet users. For the case study, a difference is found between the actual and assumed Internet usage time of participants. This paper will help parents and many researchers because it will give them a new viewpoint on this serious issue.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"42 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":"127844981","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377378
Snehasish Banerjee, Anjan Pal
YouTube introduced skippable video ads, which give Internet users the option to skip the ads after a 5-second non-skippable segment. This interactive format has now become dominant in the industry as it offers greater control to the audience. However, if users always skip skippable ads, the advertisers' purposes would not be served. Bombarding users with long-duration non-skippable ads is also not a viable option as it can result in negative user experiences. On the scholarly front, this problem has mostly been tackled using quantitative studies. The literature still lacks an in-depth understanding of users' perceptions of skippable ads. Hence, adopting a qualitative lens of investigation, this research explores users' responses toward skippable ads. Using in-depth interviews, it investigates (1) how, (2) when, (3) why, and (4) why not users skip skippable ads. Themes related to the question of “how” include habitual skipping and emotional skipping. Regarding the question of “when”, a few respondents would have liked to skip even before five seconds. About half of the respondents thought that the non-skippable duration of five seconds was reasonable but they would skip as soon as skipping is allowed. Occasionally, some respondents were open to consider a longer duration of non-skippability. Skippable ads are skipped due to repetitions, time constraints, lack of personalization, and users' negative attitudes towards advertising. In contrast, they are not skipped if they are captivating and personalized. Additionally, when users are in a relaxing mood, skippable ads may not be skipped. The contributions of the findings are discussed.
{"title":"Skipping Skippable Ads on YouTube: How, When, Why and Why Not?","authors":"Snehasish Banerjee, Anjan Pal","doi":"10.1109/IMCOM51814.2021.9377378","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377378","url":null,"abstract":"YouTube introduced skippable video ads, which give Internet users the option to skip the ads after a 5-second non-skippable segment. This interactive format has now become dominant in the industry as it offers greater control to the audience. However, if users always skip skippable ads, the advertisers' purposes would not be served. Bombarding users with long-duration non-skippable ads is also not a viable option as it can result in negative user experiences. On the scholarly front, this problem has mostly been tackled using quantitative studies. The literature still lacks an in-depth understanding of users' perceptions of skippable ads. Hence, adopting a qualitative lens of investigation, this research explores users' responses toward skippable ads. Using in-depth interviews, it investigates (1) how, (2) when, (3) why, and (4) why not users skip skippable ads. Themes related to the question of “how” include habitual skipping and emotional skipping. Regarding the question of “when”, a few respondents would have liked to skip even before five seconds. About half of the respondents thought that the non-skippable duration of five seconds was reasonable but they would skip as soon as skipping is allowed. Occasionally, some respondents were open to consider a longer duration of non-skippability. Skippable ads are skipped due to repetitions, time constraints, lack of personalization, and users' negative attitudes towards advertising. In contrast, they are not skipped if they are captivating and personalized. Additionally, when users are in a relaxing mood, skippable ads may not be skipped. The contributions of the findings are discussed.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"39 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":"132876695","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377350
V. Shakhov, O. Sokolova
Air pollution monitoring is an important and urgent problem in modern megacities. Nowadays, wireless sensor networks, including those with mobile nodes, are used to improve the monitoring. Expensive field experiments or experiments with full-scale models of monitoring systems are usually used to evaluate the effectiveness of these systems. However, in some cases, expensive and time-cost experiments can be avoided. In the paper we consider a monitoring system, which sensors installed on vehicles. We offer the corresponding approach. The results help to optimize, rationalize, and manage efficient systems for monitoring of air pollution.
{"title":"On Modeling Air Pollution Detection With Internet of Vehicles","authors":"V. Shakhov, O. Sokolova","doi":"10.1109/IMCOM51814.2021.9377350","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377350","url":null,"abstract":"Air pollution monitoring is an important and urgent problem in modern megacities. Nowadays, wireless sensor networks, including those with mobile nodes, are used to improve the monitoring. Expensive field experiments or experiments with full-scale models of monitoring systems are usually used to evaluate the effectiveness of these systems. However, in some cases, expensive and time-cost experiments can be avoided. In the paper we consider a monitoring system, which sensors installed on vehicles. We offer the corresponding approach. The results help to optimize, rationalize, and manage efficient systems for monitoring of air pollution.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"82 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":"131932325","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
扫码关注我们
求助内容：
应助结果提醒方式：