In recent years many approaches into web-content development methods can be observed. In spite of many similarities in their description and formats; as in Dublin Core or LOM (Learning Object Metadata), the characteristic features of these descriptors have not been strictly defined yet. What is more complexity of the available standards brings the user with difficulties to use them. The paper introduces development interfaces, supported by graph theories, for applications description. The web applications unification was determined using frames of the Multimedia Applications Management Shell (MAMS), together with various controlling facilities and functions of interactions. The elaborated shell was provided with RDF and RSS format compatibilities, needed for the web resources safe distribution.
{"title":"Web Databases Descriptors Defined by Means of Pseudo – Natural Language Items","authors":"M. Bernaś, J. Piecha","doi":"10.1109/CASoN.2009.18","DOIUrl":"https://doi.org/10.1109/CASoN.2009.18","url":null,"abstract":"In recent years many approaches into web-content development methods can be observed. In spite of many similarities in their description and formats; as in Dublin Core or LOM (Learning Object Metadata), the characteristic features of these descriptors have not been strictly defined yet. What is more complexity of the available standards brings the user with difficulties to use them. The paper introduces development interfaces, supported by graph theories, for applications description. The web applications unification was determined using frames of the Multimedia Applications Management Shell (MAMS), together with various controlling facilities and functions of interactions. The elaborated shell was provided with RDF and RSS format compatibilities, needed for the web resources safe distribution.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129461394","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}
Whereas multicast transmission in one-to-many communications allows the operator to save drastically network resources, it also makes the routing of the traffic flows more complex than in unicast transmissions. The use of the genetic algorithms (GA) is presented, which can considerably reduce the number of solutions to be evaluated and helps to find the appropriate combination of the trees to comply with the bandwidth needs of the group of point-to-point links and then of the group of multicast sessions.
{"title":"Genetic Algorithms for Network Optimization","authors":"W. Kosinski, D. Mikolajewski","doi":"10.1109/CASoN.2009.19","DOIUrl":"https://doi.org/10.1109/CASoN.2009.19","url":null,"abstract":"Whereas multicast transmission in one-to-many communications allows the operator to save drastically network resources, it also makes the routing of the traffic flows more complex than in unicast transmissions. The use of the genetic algorithms (GA) is presented, which can considerably reduce the number of solutions to be evaluated and helps to find the appropriate combination of the trees to comply with the bandwidth needs of the group of point-to-point links and then of the group of multicast sessions.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132353500","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 try to consider a Web page as information with social aspects. Each Web page is the result of invisible social interaction. This interaction between different groups of people translates into a certain unification of Web page creation. External signs of this unification are the features of the Web page, that meets the user’s expectations. Through analysis of the features, we can obtain information that can simply describe the Web page. This simple description contains strong information about the social group the page is intended for. If the user uses this information to refine the search, then he identifies himself as a member of a certain social group. For the description of the social aspects of Web pages we use the term MicroGenre. This paper describes the fundamental concepts of MicroGenre and also illustrate experiments for the detection and usage of MicroGenres.
{"title":"Social Aspects of Web Page Contents","authors":"M. Kudelka, V. Snás̃el, Z. Horak, A. Abraham","doi":"10.1109/CASON.2009.15","DOIUrl":"https://doi.org/10.1109/CASON.2009.15","url":null,"abstract":"In this paper we try to consider a Web page as information with social aspects. Each Web page is the result of invisible social interaction. This interaction between different groups of people translates into a certain unification of Web page creation. External signs of this unification are the features of the Web page, that meets the user’s expectations. Through analysis of the features, we can obtain information that can simply describe the Web page. This simple description contains strong information about the social group the page is intended for. If the user uses this information to refine the search, then he identifies himself as a member of a certain social group. For the description of the social aspects of Web pages we use the term MicroGenre. This paper describes the fundamental concepts of MicroGenre and also illustrate experiments for the detection and usage of MicroGenres.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122059435","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}
Many social networks share two generic distinct features: power law distributions of degrees and a high clustering. In some cases, it is difficult to obtain the structure information of real networks. Network generators provide a way to generate test networks for simulation. We present a random network generator to generate test networks with prescribed power law distributions of degrees and a finely tunable average clustering coefficient. The generator is composed of three steps. First, the degree sequences are generated following the given degree power law exponents. Second, the generator constructs a test network with these degree sequences. Third, the test network is modified to meet the prescribed average clustering coefficient as closely as possible. Experiments show the impact of the clustering coefficient on network connectivity using this generator. The comparison with existing random network generators is presented.
{"title":"A Random Network Generator with Finely Tunable Clustering Coefficient for Small-World Social Networks","authors":"W. Guo, Steven B. Kraines","doi":"10.1109/CASoN.2009.13","DOIUrl":"https://doi.org/10.1109/CASoN.2009.13","url":null,"abstract":"Many social networks share two generic distinct features: power law distributions of degrees and a high clustering. In some cases, it is difficult to obtain the structure information of real networks. Network generators provide a way to generate test networks for simulation. We present a random network generator to generate test networks with prescribed power law distributions of degrees and a finely tunable average clustering coefficient. The generator is composed of three steps. First, the degree sequences are generated following the given degree power law exponents. Second, the generator constructs a test network with these degree sequences. Third, the test network is modified to meet the prescribed average clustering coefficient as closely as possible. Experiments show the impact of the clustering coefficient on network connectivity using this generator. The comparison with existing random network generators is presented.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128039289","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}
This paper describes the functions of a system proposed for the music tube recommendation from social network data base. Such a system enables the automatic collection, evaluation and rating of music critics, the possibility to rate music tube by auditors and the recommendation of tubes depended from auditor's profiles in form of regional internet radio. First, the system searches and retrieves probable music reviews from the Internet. Subsequently, the system carries out an evaluation and rating of those reviews. From this list of music tubes the system directly allows notation from our application. Finally the system automatically create the record list diffused each day depended form the region, the year season, day hours and age of listeners. Our system uses linguistics and statistic methods for classifying music opinions and data mining techniques for recommendation part needed for recorded list creation. The principal task is the creation of popular intelligent radio adaptive on auditor's age and region - IA-Regional-Radio.
本文介绍了一个基于社交网络数据库的音乐频道推荐系统的功能。这样的系统能够自动收集、评估和评级音乐评论家，由审计员对音乐频道进行评级的可能性，以及以区域网络广播的形式根据审计员的个人资料推荐频道。首先，系统从互联网上搜索和检索可能的音乐评论。随后，系统对这些审查进行评价和评级。从这个列表的音乐管系统直接允许从我们的应用程序符号。最后，系统根据地区、年份、季节、时间和听众的年龄自动创建每天扩散的唱片列表。我们的系统使用语言学和统计学方法对音乐意见进行分类，并使用数据挖掘技术进行录制列表创建所需的推荐部分。本文的主要任务是创造一种适合不同年龄和地域的大众化智能电台——ia - region - radio。
{"title":"Social Network - An Autonomous System Designed for Radio Recommendation","authors":"G. Dziczkowski, L. Bougueroua, K. Wegrzyn-Wolska","doi":"10.1109/CASoN.2009.21","DOIUrl":"https://doi.org/10.1109/CASoN.2009.21","url":null,"abstract":"This paper describes the functions of a system proposed for the music tube recommendation from social network data base. Such a system enables the automatic collection, evaluation and rating of music critics, the possibility to rate music tube by auditors and the recommendation of tubes depended from auditor's profiles in form of regional internet radio. First, the system searches and retrieves probable music reviews from the Internet. Subsequently, the system carries out an evaluation and rating of those reviews. From this list of music tubes the system directly allows notation from our application. Finally the system automatically create the record list diffused each day depended form the region, the year season, day hours and age of listeners. Our system uses linguistics and statistic methods for classifying music opinions and data mining techniques for recommendation part needed for recorded list creation. The principal task is the creation of popular intelligent radio adaptive on auditor's age and region - IA-Regional-Radio.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"335 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133896039","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}
N. Mavridis, Wajahat Kazmi, Panos Toulis, Chiraz BenAbdelkader
This paper explores the intersection of three areas: interactive robots, face recognition, and online social networks, by presenting and discussing an implemented real-world system that combines all three, a “FaceBots” robot. Our robot is a mobile robot with face recognition, natural language dialogue, as well as mapping capabilities. The robot is also equipped with a social database containing information about the people it interacts with, and is also connected in real-time to the “Facebook” online social networking website, which contains information as well as partially tagged pictures. Our system demonstrates the benefits of this triangle of interconnection: it is not only the case that facebook information can lead to more interesting interactions, but also that: facebook photos enable better face recognition, interactive robots enable robot-mediated publishing of photos and information on facebook. Most importantly, as we shall see in detail, social information enables significantly better and faster face recognition, as an interesting bidirectional relationship exists between the “friends” relation in social networks and the “faces appear in the same picture” relation in face recognition. We will present algorithms for exploiting this relationship, as well as quantitative results. The two main novelties of our system are: this is the first interactive conversational mobile robot that utilizes and publishes social information in facebook, and is also the first system utilizing the social context of conjectured identities in a photo for better face recognition.
{"title":"On the Synergies between Online Social Networking, Face Recognition and Interactive Robotics","authors":"N. Mavridis, Wajahat Kazmi, Panos Toulis, Chiraz BenAbdelkader","doi":"10.1109/CASoN.2009.28","DOIUrl":"https://doi.org/10.1109/CASoN.2009.28","url":null,"abstract":"This paper explores the intersection of three areas: interactive robots, face recognition, and online social networks, by presenting and discussing an implemented real-world system that combines all three, a “FaceBots” robot. Our robot is a mobile robot with face recognition, natural language dialogue, as well as mapping capabilities. The robot is also equipped with a social database containing information about the people it interacts with, and is also connected in real-time to the “Facebook” online social networking website, which contains information as well as partially tagged pictures. Our system demonstrates the benefits of this triangle of interconnection: it is not only the case that facebook information can lead to more interesting interactions, but also that: facebook photos enable better face recognition, interactive robots enable robot-mediated publishing of photos and information on facebook. Most importantly, as we shall see in detail, social information enables significantly better and faster face recognition, as an interesting bidirectional relationship exists between the “friends” relation in social networks and the “faces appear in the same picture” relation in face recognition. We will present algorithms for exploiting this relationship, as well as quantitative results. The two main novelties of our system are: this is the first interactive conversational mobile robot that utilizes and publishes social information in facebook, and is also the first system utilizing the social context of conjectured identities in a photo for better face recognition.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128305822","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 present in this paper a drawing algorithm to represent graphically co-citation networks (scientograms). These networks have some interesting and unusual topological properties which are often valuable to be visualized. In general, these networks are pruned with a network scaling algorithm, then visualized using a drawing algorithm cite{Chen98a}. However, typical drawing algorithms do not work properly, especially when the size of the networks grows. Edge crossings appear while the drawing space is not adequately filled resulting in an unsightly display. The approach presented in this paper is able to print the networks filling all the available space in an aesthetic way, while avoiding edge crossings. The algorithm is detailed and compared with the classical Kamada-Kawai drawing algorithm on two maps.
{"title":"A Space-Based Layout Algorithm for the Drawing of Co-citation Networks","authors":"A. Quirin, O. Cordón","doi":"10.1109/CASON.2009.25","DOIUrl":"https://doi.org/10.1109/CASON.2009.25","url":null,"abstract":"We present in this paper a drawing algorithm to represent graphically co-citation networks (scientograms). These networks have some interesting and unusual topological properties which are often valuable to be visualized. In general, these networks are pruned with a network scaling algorithm, then visualized using a drawing algorithm cite{Chen98a}. However, typical drawing algorithms do not work properly, especially when the size of the networks grows. Edge crossings appear while the drawing space is not adequately filled resulting in an unsightly display. The approach presented in this paper is able to print the networks filling all the available space in an aesthetic way, while avoiding edge crossings. The algorithm is detailed and compared with the classical Kamada-Kawai drawing algorithm on two maps.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131284673","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}
For solving problems in a large-scale distributed Web environment, we proposed β-PSML (Problem Solver Markup Language). We have studied the theoretical problems of β-PSML constructed by combining description logic and Horn clauses. In the nonrecursive case, we show that a single step of applying a Horn clause needs to be replaced by a more sophisticated reasoning step in β-PSML. We call it as the hybrid reasoning algorithm. We described the hybrid reasoning algorithm in this paper. Hybrid reasoning algorithm provides a sound and complete inference procedure for nonrecursive β-PSML knowledge bases in which the description logic component is decidable.
{"title":"The Hybrid Reasoning Algorithm of ß-PSML","authors":"Yila Su","doi":"10.1109/CASoN.2009.10","DOIUrl":"https://doi.org/10.1109/CASoN.2009.10","url":null,"abstract":"For solving problems in a large-scale distributed Web environment, we proposed β-PSML (Problem Solver Markup Language). We have studied the theoretical problems of β-PSML constructed by combining description logic and Horn clauses. In the nonrecursive case, we show that a single step of applying a Horn clause needs to be replaced by a more sophisticated reasoning step in β-PSML. We call it as the hybrid reasoning algorithm. We described the hybrid reasoning algorithm in this paper. Hybrid reasoning algorithm provides a sound and complete inference procedure for nonrecursive β-PSML knowledge bases in which the description logic component is decidable.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121725714","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}
Understanding the dynamics of disease spread is of crucial importance, in contexts such as estimating load on medical services to risk assessment and intervention policies against large-scale epidemic outbreaks. However, most of the information is available after the spread itself, and preemptive assessment is far from trivial. Here, we investigate the use of agent-based simulations to model such outbreaks in a stylised urban environment. For most diseases, infection of a new individual may occur from casual contact in crowds as well as from repeated interactions with social partners such as work colleagues or family members. Our model therefore accounts for these two phenomena.Presented in this paper is the initial framework for such a model, detailing implementation of geographical features and generation of social structures. Preliminary results are a promising step towards large-scale simulations and evaluation of potential intervention policies.
{"title":"Considerations for a Social and Geographical Framework for Agent-Based Epidemics","authors":"B. Claude, Dimitri Perrin, H. Ruskin","doi":"10.1109/CASoN.2009.23","DOIUrl":"https://doi.org/10.1109/CASoN.2009.23","url":null,"abstract":"Understanding the dynamics of disease spread is of crucial importance, in contexts such as estimating load on medical services to risk assessment and intervention policies against large-scale epidemic outbreaks. However, most of the information is available after the spread itself, and preemptive assessment is far from trivial. Here, we investigate the use of agent-based simulations to model such outbreaks in a stylised urban environment. For most diseases, infection of a new individual may occur from casual contact in crowds as well as from repeated interactions with social partners such as work colleagues or family members. Our model therefore accounts for these two phenomena.Presented in this paper is the initial framework for such a model, detailing implementation of geographical features and generation of social structures. Preliminary results are a promising step towards large-scale simulations and evaluation of potential intervention policies.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133448443","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}
Trust management is an increasingly important issue in large social networks, where the amount of data is too extensive to be analysed by ordinary users. Hence there is an urgent need for research aiming at building automated systems that can support users in making their decisions concerning trust.This work is a preliminary implementation of selected ideas described in our previous research proposal which concerns taking a machine-learning approach to the problem of trust prediction in social networks.We report experiments conducted on a publicly available social network dataset epinions.com. The results indicate that i) it is possible to predict trust to some extent, but much room for improvement is present; ii) enriching the model with attributes based on similarity between users can significantly improve trust prediction accuracy for more similar users.
{"title":"Enriching Trust Prediction Model in Social Network with User Rating Similarity","authors":"Piotr Borzymek, M. Sydow, A. Wierzbicki","doi":"10.1109/CASoN.2009.30","DOIUrl":"https://doi.org/10.1109/CASoN.2009.30","url":null,"abstract":"Trust management is an increasingly important issue in large social networks, where the amount of data is too extensive to be analysed by ordinary users. Hence there is an urgent need for research aiming at building automated systems that can support users in making their decisions concerning trust.This work is a preliminary implementation of selected ideas described in our previous research proposal which concerns taking a machine-learning approach to the problem of trust prediction in social networks.We report experiments conducted on a publicly available social network dataset epinions.com. The results indicate that i) it is possible to predict trust to some extent, but much room for improvement is present; ii) enriching the model with attributes based on similarity between users can significantly improve trust prediction accuracy for more similar users.","PeriodicalId":425748,"journal":{"name":"2009 International Conference on Computational Aspects of Social Networks","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123090742","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
扫码关注我们
求助内容：
应助结果提醒方式：