State machine replication is a general approach for building a Byzantine fault-tolerant (BFT) distributed systems like a grid or a cloud or a data center. Various BFT protocols based on state machine replication have been introduced for modern distributed systems to tolerate byzantine failures and thus provide more reliable services. However, most of them have not fully considered the adverse affects of Churn (nodes entering and leaving the system at will) on the correctness and availability of services. In this paper, we propose a new churn tolerance algorithm based on the BFT protocol approach using state machine replication. It is capable of tolerating both Byzantine failures and arbitrary churn when the constraint on the number of faults in the distributed system is satisfied.
{"title":"Churn Tolerance Algorithm for State Machine Replication","authors":"Yihua Ding, J. Wang, P. Srimani","doi":"10.1109/WI-IAT.2012.16","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.16","url":null,"abstract":"State machine replication is a general approach for building a Byzantine fault-tolerant (BFT) distributed systems like a grid or a cloud or a data center. Various BFT protocols based on state machine replication have been introduced for modern distributed systems to tolerate byzantine failures and thus provide more reliable services. However, most of them have not fully considered the adverse affects of Churn (nodes entering and leaving the system at will) on the correctness and availability of services. In this paper, we propose a new churn tolerance algorithm based on the BFT protocol approach using state machine replication. It is capable of tolerating both Byzantine failures and arbitrary churn when the constraint on the number of faults in the distributed system is satisfied.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128868073","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}
One of the main problems that emerges in the classic approach to semantics is the difficulty in acquisition and maintenance of ontologies and semantic annotations. On the other hand, the flow of data and documents which are accessible from the Web is continuously fueled by the contribution of millions of users who interact digitally in a collaborative way. Search engines, continually exploring the Web, are therefore the natural source of information on which to base a modern approach to semantic annotation. A promising idea is that it is possible to generalize the semantic similarity, under the assumption that semantically similar terms behave similarly, and define collaborative proximity measures based on the indexing information returned by search engines. In this work PMING, a new collaborative proximity measure based on search engines, which uses the information provided by search engines, is introduced as a basis to extract semantic content. PMING is defined on the basis of the best features of other state-of-the-art proximity distances which have been considered. It defines the degree of relatedness between terms, by using only the number of documents returned as result for a query, then the measure dynamically reflects the collaborative change made on the web resources. Experiments held on popular collaborative and generalist engines (e.g. Flickr, Youtube, Google, Bing, Yahoo Search) show that PMING outperforms state-of-the-art proximity measures (e.g. Normalized Google Distance, Flickr Distance etc.), in modeling contexts, modeling human perception, and clustering of semantic associations.
{"title":"PMING Distance: A Collaborative Semantic Proximity Measure","authors":"Valentina Franzoni, A. Milani","doi":"10.1109/WI-IAT.2012.226","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.226","url":null,"abstract":"One of the main problems that emerges in the classic approach to semantics is the difficulty in acquisition and maintenance of ontologies and semantic annotations. On the other hand, the flow of data and documents which are accessible from the Web is continuously fueled by the contribution of millions of users who interact digitally in a collaborative way. Search engines, continually exploring the Web, are therefore the natural source of information on which to base a modern approach to semantic annotation. A promising idea is that it is possible to generalize the semantic similarity, under the assumption that semantically similar terms behave similarly, and define collaborative proximity measures based on the indexing information returned by search engines. In this work PMING, a new collaborative proximity measure based on search engines, which uses the information provided by search engines, is introduced as a basis to extract semantic content. PMING is defined on the basis of the best features of other state-of-the-art proximity distances which have been considered. It defines the degree of relatedness between terms, by using only the number of documents returned as result for a query, then the measure dynamically reflects the collaborative change made on the web resources. Experiments held on popular collaborative and generalist engines (e.g. Flickr, Youtube, Google, Bing, Yahoo Search) show that PMING outperforms state-of-the-art proximity measures (e.g. Normalized Google Distance, Flickr Distance etc.), in modeling contexts, modeling human perception, and clustering of semantic associations.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129129680","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}
In this paper we construct an office-use autonomous mobile robot which predicts the state (either stressed, relaxed, usual, or non-existent) of a person at different places and navigates between the places. The productivity of an office worker in advanced countries is a crucial concern and we believe autonomous mobile robots without network connection and with a privacy switch are preferred to privacy-offending solutions such as monitoring cameras. We exploit recent advances in hardware and software to keep the construction cost low. The state prediction of a person in an office is based on support vector machines with image processing with stereo vision. The robot navigation between the prediction places is based on a look-around solution that we devised. Experiments using 8 hours of data gave promising results.
{"title":"Predicting the State of a Person by an Office-Use Autonomous Mobile Robot","authors":"Asuki Kouno, Daisuke Takayama, Einoshin Suzuki","doi":"10.1109/WI-IAT.2012.183","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.183","url":null,"abstract":"In this paper we construct an office-use autonomous mobile robot which predicts the state (either stressed, relaxed, usual, or non-existent) of a person at different places and navigates between the places. The productivity of an office worker in advanced countries is a crucial concern and we believe autonomous mobile robots without network connection and with a privacy switch are preferred to privacy-offending solutions such as monitoring cameras. We exploit recent advances in hardware and software to keep the construction cost low. The state prediction of a person in an office is based on support vector machines with image processing with stereo vision. The robot navigation between the prediction places is based on a look-around solution that we devised. Experiments using 8 hours of data gave promising results.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124307384","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}
Over the last few years, many efforts have been devoted to revealing human mobility patterns. However, the regularity and variability of human mobility from a microscopic view, i.e., what factors affect human mobility patterns, has yet not been investigated. In this paper, we aim to study the impact factors that may affect the regularity and variability of human mobility patterns using social network analysis. Specifically, we introduce the spatial interaction matrix to represent the interaction strength and interaction semantics among spatial regions. Based on the spatial interaction matrix, we investigate the factors that impact the mobility patterns, including temporal factors, occupational factors and age factors. Our experimental results demonstrate that lots of factors such as environmental, temporal and age factors contribute to the shape of human mobility patterns.
{"title":"Understanding the Regularity and Variability of Human Mobility from Geo-trajectory","authors":"Yunji Liang, Xingshe Zhou, Bin Guo, Zhiwen Yu","doi":"10.1109/WI-IAT.2012.163","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.163","url":null,"abstract":"Over the last few years, many efforts have been devoted to revealing human mobility patterns. However, the regularity and variability of human mobility from a microscopic view, i.e., what factors affect human mobility patterns, has yet not been investigated. In this paper, we aim to study the impact factors that may affect the regularity and variability of human mobility patterns using social network analysis. Specifically, we introduce the spatial interaction matrix to represent the interaction strength and interaction semantics among spatial regions. Based on the spatial interaction matrix, we investigate the factors that impact the mobility patterns, including temporal factors, occupational factors and age factors. Our experimental results demonstrate that lots of factors such as environmental, temporal and age factors contribute to the shape of human mobility patterns.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124414013","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}
The goal-oriented agent programming based on BDI model is obtaining increasing attentions, because it allows us to design proactive behaviors for an agent. Generally, an agent does pursue multiple goals not only in a sequential way, but in a simultaneous mode. Accordingly, a rational agent requires that the goals pursued by it are consistent and do not conflict or even deadlock with each other. Existing strategies of goal deliberation are still not sufficient to deal with this task. This paper proposes a runtime goal conflict resolution model for agent systems, which consists of a goal state transition structure and a goal deliberation mechanism based on an extended event calculus. Besides the elaboration on the theoretical parts, a case study is also given to show how this model works. Finally the evaluation of the model is introduced, and the comparing result shows that the goal deliberation time of the agent can be decreased and fewer goal conflicts could happen in the runtime.
{"title":"A Runtime Goal Conflict Resolution Model for Agent Systems","authors":"Xiaogang Wang, Jian Cao, Jie Wang","doi":"10.1109/WI-IAT.2012.56","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.56","url":null,"abstract":"The goal-oriented agent programming based on BDI model is obtaining increasing attentions, because it allows us to design proactive behaviors for an agent. Generally, an agent does pursue multiple goals not only in a sequential way, but in a simultaneous mode. Accordingly, a rational agent requires that the goals pursued by it are consistent and do not conflict or even deadlock with each other. Existing strategies of goal deliberation are still not sufficient to deal with this task. This paper proposes a runtime goal conflict resolution model for agent systems, which consists of a goal state transition structure and a goal deliberation mechanism based on an extended event calculus. Besides the elaboration on the theoretical parts, a case study is also given to show how this model works. Finally the evaluation of the model is introduced, and the comparing result shows that the goal deliberation time of the agent can be decreased and fewer goal conflicts could happen in the runtime.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120951137","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}
Recognizing violations is a key issue in business process management (BPM). As a result that artifact-centric approach is becoming the development trend of BPM, we present a resolution for finding business violations through recognizing valid artifacts in business processes. We provide the formal definition of artifacts and artifact lifecycles, and, based on them, formulize the problem of recognizing valid artifacts. Previous methods for resolving this problem mainly put focus on activities in business process and lose the attention for data. In this work we concentrate on both the evolution of artifacts (data) and services (activities) applied on artifacts to identify the frontier between decidability and undecidability of the problem of recognizing valid artifacts. And we present the results of decidability under the conditions that artifact lifecycles are described in regular artifact lifecycle expressions and pushdown automata.
{"title":"Recognizing Valid Artifacts in Business Processes","authors":"Qi He","doi":"10.1109/WI-IAT.2012.269","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.269","url":null,"abstract":"Recognizing violations is a key issue in business process management (BPM). As a result that artifact-centric approach is becoming the development trend of BPM, we present a resolution for finding business violations through recognizing valid artifacts in business processes. We provide the formal definition of artifacts and artifact lifecycles, and, based on them, formulize the problem of recognizing valid artifacts. Previous methods for resolving this problem mainly put focus on activities in business process and lose the attention for data. In this work we concentrate on both the evolution of artifacts (data) and services (activities) applied on artifacts to identify the frontier between decidability and undecidability of the problem of recognizing valid artifacts. And we present the results of decidability under the conditions that artifact lifecycles are described in regular artifact lifecycle expressions and pushdown automata.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122687367","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}
Toshiya Kuramochi, Naoki Okada, Kyohei Tanikawa, Y. Hijikata, S. Nishida
Many researchers have studied complex networks such as the World Wide Web, social networks, and the protein interaction network. They have found scale-free characteristics, the small-world effect, the property of high-clustering coefficient, and so on. One hot topic in this area is community detection. For example, the community shows a set of web pages about a certain topic in the WWW. The community structure is unquestionably a key characteristic of complex networks. In this paper, we propose a new method for finding communities in complex networks. Our proposed method considers the overlaps between communities using the concept of the intersection graph. Additionally, we address the problem of edge in homogeneity by weighting edges using the degree of overlaps and the similarity of content information between sets. Finally, we conduct clustering based on modularity. And then, we evaluate our method on a real SNS network.
{"title":"Community Extracting Using Intersection Graph and Content Analysis in Complex Network","authors":"Toshiya Kuramochi, Naoki Okada, Kyohei Tanikawa, Y. Hijikata, S. Nishida","doi":"10.1109/WI-IAT.2012.51","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.51","url":null,"abstract":"Many researchers have studied complex networks such as the World Wide Web, social networks, and the protein interaction network. They have found scale-free characteristics, the small-world effect, the property of high-clustering coefficient, and so on. One hot topic in this area is community detection. For example, the community shows a set of web pages about a certain topic in the WWW. The community structure is unquestionably a key characteristic of complex networks. In this paper, we propose a new method for finding communities in complex networks. Our proposed method considers the overlaps between communities using the concept of the intersection graph. Additionally, we address the problem of edge in homogeneity by weighting edges using the degree of overlaps and the similarity of content information between sets. Finally, we conduct clustering based on modularity. And then, we evaluate our method on a real SNS network.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123132041","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}
As an event-based task, Emerging Event Detection (EED) faces the problems of multiple events on the same subject and the evolution of events. Current term weighting schemes for EED exploiting Named Entity, temporal information and Topic Modeling all have their limited utility. In this paper, a new term weighting scheme, which models the sparse aspect, global weight and local weight of each story, is proposed. Then, an unsupervised algorithm based on the new scheme is applied to EED. We evaluate our approach on two datasets from TDT5, and compare it with TFIDF and existing two schemes exploiting Topic Modeling. Experiments on Retrospective and On-line EED show that our scheme yields better results.
{"title":"Term Weighting Schemes for Emerging Event Detection","authors":"Yanghui Rao, Qing Li","doi":"10.1109/WI-IAT.2012.66","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.66","url":null,"abstract":"As an event-based task, Emerging Event Detection (EED) faces the problems of multiple events on the same subject and the evolution of events. Current term weighting schemes for EED exploiting Named Entity, temporal information and Topic Modeling all have their limited utility. In this paper, a new term weighting scheme, which models the sparse aspect, global weight and local weight of each story, is proposed. Then, an unsupervised algorithm based on the new scheme is applied to EED. We evaluate our approach on two datasets from TDT5, and compare it with TFIDF and existing two schemes exploiting Topic Modeling. Experiments on Retrospective and On-line EED show that our scheme yields better results.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115975634","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}
Nora Aion, Linda Helmandollar, Minjuan Wang, Jason W. P. Ng
This paper reports the results of an evaluation study about the impact of the International Intelligent Campus (iCampus) initiative, put forward by the Etisalat British Telecom Innovation Center, on higher educational institutions. The iCampus initiative incorporates six functional "pillars" that provide a holistic intelligent campus framework to enrich the students' end-to-end learning lifecycle. This study examines the impact of the iCampus pillars on the institutions' key performance indicators (KPIs) and investigates the institutions' plans for implementing iCampus solutions. Recommendations for future studies are also given based on the findings of this study.
{"title":"Intelligent Campus (iCampus) Impact Study","authors":"Nora Aion, Linda Helmandollar, Minjuan Wang, Jason W. P. Ng","doi":"10.1109/WI-IAT.2012.261","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.261","url":null,"abstract":"This paper reports the results of an evaluation study about the impact of the International Intelligent Campus (iCampus) initiative, put forward by the Etisalat British Telecom Innovation Center, on higher educational institutions. The iCampus initiative incorporates six functional \"pillars\" that provide a holistic intelligent campus framework to enrich the students' end-to-end learning lifecycle. This study examines the impact of the iCampus pillars on the institutions' key performance indicators (KPIs) and investigates the institutions' plans for implementing iCampus solutions. Recommendations for future studies are also given based on the findings of this study.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132628894","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}
We propose a trust framework model for an educational cloud which is designed to overcome inequalities of M-shaped incomes by simplifying contract-based sharing of resources among multiple schools. We use class algebra, which is similar to SROIQ(D) description logic, as the access control policy language. Benefiting from the high expressivity of class algebra, our model can use implicit relations and reasoning to enforce access control that corresponds to the contracts. The security mechanism allows one-time user login to obtain all of this userâs credentials for accessing services. In addition, our model can select appropriate material to adapt to the level of the student by adding the classification information to the attributes of the educational material and the student, and integrating this information into the access control policy to build an exclusive learning graph for each student.
{"title":"CA-ABAC: Class Algebra Attribute-Based Access Control","authors":"D. Buehrer, Chun-Yao Wang","doi":"10.1109/WI-IAT.2012.268","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.268","url":null,"abstract":"We propose a trust framework model for an educational cloud which is designed to overcome inequalities of M-shaped incomes by simplifying contract-based sharing of resources among multiple schools. We use class algebra, which is similar to SROIQ(D) description logic, as the access control policy language. Benefiting from the high expressivity of class algebra, our model can use implicit relations and reasoning to enforce access control that corresponds to the contracts. The security mechanism allows one-time user login to obtain all of this userâs credentials for accessing services. In addition, our model can select appropriate material to adapt to the level of the student by adding the classification information to the attributes of the educational material and the student, and integrating this information into the access control policy to build an exclusive learning graph for each student.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125338073","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
扫码关注我们
求助内容：
应助结果提醒方式：