Opportunistic networks are an evolution of MANETs, where highly mobile nodes that have no physical route connecting them might need to communicate. In this case routes are built dynamically, as nodes act according to a store-carry-and-forward paradigm. A natural continuation of forwarding in opportunistic networks is data dissemination, which is usually performed using the publish/subscribe model. In this paper, we propose a socially-based data dissemination technique for opportunistic networks called Social Dissemination. The solution assumes that nodes are grouped into communities, where nodes in the same community meet often, while at the same time certain nodes may have relationships with nodes from other communities. When two nodes meet, they exchange information about the data they store, and select data objects from the other node according to a utility function. We define such a utility function and experimentally compare its results with previously proposed state-of-the-art dissemination techniques.
{"title":"A Data Dissemination Algorithm for Opportunistic Networks","authors":"Radu-Ioan Ciobanu, C. Dobre, V. Cristea","doi":"10.1109/SYNASC.2011.56","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.56","url":null,"abstract":"Opportunistic networks are an evolution of MANETs, where highly mobile nodes that have no physical route connecting them might need to communicate. In this case routes are built dynamically, as nodes act according to a store-carry-and-forward paradigm. A natural continuation of forwarding in opportunistic networks is data dissemination, which is usually performed using the publish/subscribe model. In this paper, we propose a socially-based data dissemination technique for opportunistic networks called Social Dissemination. The solution assumes that nodes are grouped into communities, where nodes in the same community meet often, while at the same time certain nodes may have relationships with nodes from other communities. When two nodes meet, they exchange information about the data they store, and select data objects from the other node according to a utility function. We define such a utility function and experimentally compare its results with previously proposed state-of-the-art dissemination techniques.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115612700","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 show that the reduced mesh root systems and mesh geometries of roots for each of the simply-laced Dynkin diagrams can be classified by applying symbolic computer algebra computations and numeric algorithmic computations in Maple, C++ and Linux. Results of our computing experiences are presented in a table of Section 2 and in Section 6.
{"title":"Experiences in Computing Mesh Root Systems for Dynkin Diagrams Using Maple and C++","authors":"Mariusz Felisiak, D. Simson","doi":"10.1109/SYNASC.2011.41","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.41","url":null,"abstract":"We show that the reduced mesh root systems and mesh geometries of roots for each of the simply-laced Dynkin diagrams can be classified by applying symbolic computer algebra computations and numeric algorithmic computations in Maple, C++ and Linux. Results of our computing experiences are presented in a table of Section 2 and in Section 6.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125582365","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}
Internet grows larger year by year and makes users to be confronted with large quantities of data that they cannot fully comprehend. The ongoing transition from Web 2.0 to the Semantic Web makes the development of intelligent services with the ability to discern, classify and simplify web information of vital importance. In this paper we present a new model for web-history organizing in order to improve the user action over the Internet. Based on this model we proposed an application, delivered as a Google Chrome browser extension, which organizes the web-history into semantic clusters, providing the user with an easy-to-follow hierarchal structure. The paper covers the main algorithms in the field, offering a comprehensive critical analysis, such as document vectorization, relational clustering, fuzzy and genetic variations and the item-set-based approach. Our work consists of adapting these algorithms to support an ever-increasing set of input data. The result is a hybrid variation that rapidly offers an acceptable solution, which is optimized in time, a quality preserved during the extensive web explorations a user may undergo. A variety of test results is presented in the end, with under-stress behavior and a selection of user experience.
{"title":"Intelligent Web-History Based on a Hybrid Clustering Algorithm for Future-Internet Systems","authors":"A. Marin, Florin Pop","doi":"10.1109/SYNASC.2011.24","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.24","url":null,"abstract":"Internet grows larger year by year and makes users to be confronted with large quantities of data that they cannot fully comprehend. The ongoing transition from Web 2.0 to the Semantic Web makes the development of intelligent services with the ability to discern, classify and simplify web information of vital importance. In this paper we present a new model for web-history organizing in order to improve the user action over the Internet. Based on this model we proposed an application, delivered as a Google Chrome browser extension, which organizes the web-history into semantic clusters, providing the user with an easy-to-follow hierarchal structure. The paper covers the main algorithms in the field, offering a comprehensive critical analysis, such as document vectorization, relational clustering, fuzzy and genetic variations and the item-set-based approach. Our work consists of adapting these algorithms to support an ever-increasing set of input data. The result is a hybrid variation that rapidly offers an acceptable solution, which is optimized in time, a quality preserved during the extensive web explorations a user may undergo. A variety of test results is presented in the end, with under-stress behavior and a selection of user experience.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116523609","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 convergence condition for the simultaneous inclusion methods is w (0)
同时包含方法的收敛条件为w(0)。
{"title":"Optimal Inequality Factor for Ehrlich-Aberth's Method","authors":"Octavian Cira, Ş. Măruşter","doi":"10.1109/SYNASC.2011.8","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.8","url":null,"abstract":"The convergence condition for the simultaneous inclusion methods is w (0)","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130668511","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}
Stock Trading Algorithm Models are an important problem researchers dealt with through time that implied knowledge in technical and fundamental analysis, time series combined with knowledge expertise in computer science or programming in order to find solutions of how to have a stock gain. This paper proposes a multi-agent architecture that assists a user in making a successful investment on the stock market. This implies the use of technical and fundamental analysis in order to make a useful prediction of the security's trend.
{"title":"Multi-agent Stock Trading Algorithm Model","authors":"M. Tirea, Ioan Tandau, V. Negru","doi":"10.1109/SYNASC.2011.11","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.11","url":null,"abstract":"Stock Trading Algorithm Models are an important problem researchers dealt with through time that implied knowledge in technical and fundamental analysis, time series combined with knowledge expertise in computer science or programming in order to find solutions of how to have a stock gain. This paper proposes a multi-agent architecture that assists a user in making a successful investment on the stock market. This implies the use of technical and fundamental analysis in order to make a useful prediction of the security's trend.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126228018","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}
I. Berzina, Raivis Bēts, J. Buls, Edmunds Cers, Liga Kulesa
We present a new non-periodic random number generator based on the shrinking generator. The A-sequence is still generated using a LFSR, but the S-sequence is replaced by a finitely generated bi-ideal - a non-periodic sequence. The resulting pseudo-random sequence performs well in statistical tests. We show a method for the construction of an infinite number of finitely generated bi-ideals from a given A-sequence, such that the resulting sequence of the shrinking generator is nonperiodic. Further we prove the existence of what we call universal finitely generated bi-ideals that produce non-periodic words when used as the S-sequence of a shrinking generator for all non-trivial periodic A-sequences.
{"title":"On a Non-periodic Shrinking Generator","authors":"I. Berzina, Raivis Bēts, J. Buls, Edmunds Cers, Liga Kulesa","doi":"10.1109/SYNASC.2011.25","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.25","url":null,"abstract":"We present a new non-periodic random number generator based on the shrinking generator. The A-sequence is still generated using a LFSR, but the S-sequence is replaced by a finitely generated bi-ideal - a non-periodic sequence. The resulting pseudo-random sequence performs well in statistical tests. We show a method for the construction of an infinite number of finitely generated bi-ideals from a given A-sequence, such that the resulting sequence of the shrinking generator is nonperiodic. Further we prove the existence of what we call universal finitely generated bi-ideals that produce non-periodic words when used as the S-sequence of a shrinking generator for all non-trivial periodic A-sequences.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125995570","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 outlines a couple of lattice-based (un)learning strategies proposed in a recent development of unification-based grammars, namely the Fluid Construction Grammar (FCG) setup. These (un)learning strategies are inspired by two linguistic phenomena occurring in a dialect spoken in the Banat area of Romania. Children from that region -- where influences produced over centuries by Serbian, a Slavic language, are obvious -- learn in school the modern Romanian language, which is a Romance language. This particular setup offers us the possibility to model in FCG a two-step learning process: the first step is that of learning a (perfective) verbal aspect similar to the one already presented by Kateryna Gerasymova in her MSc thesis, while the second one is concerned with un-learning (or, learning another linguistic "construction'' over) this verbal aspect. Thus, the interesting issue here is how learning could continue beyond learning the verbal aspects. We will first give linguistic facts, after which we will outline the way in which FCG could model such a linguistic process. From the computational point of view, we show that the heuristics used in this grammar repairing process can be automatically derived since the meanings associated to words and phrases are organized in a lattice of feature structures, according to the underlying constraint logics. We will later discuss the case of another verbal marker in the dialect spoken in Banat. It will lead us to sketch a composite, quite elaborated (un)learning strategy.
{"title":"Learning to Unlearn in Lattices of Concepts: A Case Study in Fluid Construction Grammars","authors":"Liviu Ciortuz, Vlad Saveluc","doi":"10.1109/SYNASC.2011.27","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.27","url":null,"abstract":"This paper outlines a couple of lattice-based (un)learning strategies proposed in a recent development of unification-based grammars, namely the Fluid Construction Grammar (FCG) setup. These (un)learning strategies are inspired by two linguistic phenomena occurring in a dialect spoken in the Banat area of Romania. Children from that region -- where influences produced over centuries by Serbian, a Slavic language, are obvious -- learn in school the modern Romanian language, which is a Romance language. This particular setup offers us the possibility to model in FCG a two-step learning process: the first step is that of learning a (perfective) verbal aspect similar to the one already presented by Kateryna Gerasymova in her MSc thesis, while the second one is concerned with un-learning (or, learning another linguistic \"construction'' over) this verbal aspect. Thus, the interesting issue here is how learning could continue beyond learning the verbal aspects. We will first give linguistic facts, after which we will outline the way in which FCG could model such a linguistic process. From the computational point of view, we show that the heuristics used in this grammar repairing process can be automatically derived since the meanings associated to words and phrases are organized in a lattice of feature structures, according to the underlying constraint logics. We will later discuss the case of another verbal marker in the dialect spoken in Banat. It will lead us to sketch a composite, quite elaborated (un)learning strategy.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128948854","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 aims to fully present a new genetic approach that uses rank distance for solving two known NP complete problems: closest string and closest sub string. We build a genetic algorithm for each of the two problems and we describe the genetic operations involved. The genetic algorithm adapted for the closest sub string problem uses standard genetic operations, while the genetic operations for the closest string problem are only inspired from nature. Both genetic algorithms bring something new by using a fitness function based on rank distance. The tests for both problems show that our genetic approach via rank distance has good results.
{"title":"A Genetic Approximation of Closest String via Rank Distance","authors":"Liviu P. Dinu, Radu Tudor Ionescu","doi":"10.1109/SYNASC.2011.31","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.31","url":null,"abstract":"This paper aims to fully present a new genetic approach that uses rank distance for solving two known NP complete problems: closest string and closest sub string. We build a genetic algorithm for each of the two problems and we describe the genetic operations involved. The genetic algorithm adapted for the closest sub string problem uses standard genetic operations, while the genetic operations for the closest string problem are only inspired from nature. Both genetic algorithms bring something new by using a fitness function based on rank distance. The tests for both problems show that our genetic approach via rank distance has good results.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124453919","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 most popular solution concepts in game theory, Nash and Pareto equilibrium, have some limitations when applied in real life. Nash equilibrium rarely assures maximal payoff and the Pareto equilibrium is a set of solutions that is often too hard to process. Our aim is to find an equilibrium concept that provides a small set of efficient solutions and is equitable for all players. The Lorenz dominance relation is considered and a crowding based differential evolution method is proposed to detect the Lorenz-optimal solutions. The Lorenz equilibrium for games is proposed. Experimental results show the effectiveness of the proposed approach.
{"title":"Lorenz Equilibrium: Concept and Evolutionary Detection","authors":"Réka Nagy, D. Dumitrescu, R. Lung","doi":"10.1109/SYNASC.2011.46","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.46","url":null,"abstract":"The most popular solution concepts in game theory, Nash and Pareto equilibrium, have some limitations when applied in real life. Nash equilibrium rarely assures maximal payoff and the Pareto equilibrium is a set of solutions that is often too hard to process. Our aim is to find an equilibrium concept that provides a small set of efficient solutions and is equitable for all players. The Lorenz dominance relation is considered and a crowding based differential evolution method is proposed to detect the Lorenz-optimal solutions. The Lorenz equilibrium for games is proposed. Experimental results show the effectiveness of the proposed approach.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124024209","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 human society, trust plays an important role -- it is the main factor behind most decisions. Within an organization, both real and virtual, a series of decisions on personnel management flow are made. The paper proposes a trust model of agents in a virtual organization, which can be used to decide whether it is better to start, continue, or stop working with the evaluated agent. The trust factor of an agent is summarized as a unique value based on a function which properly aggregates the agent's characteristics and the available information on agent's performance. The proposed model has the advantage of assuring simple calculations and providing an overview of the evaluated agent's performance.
{"title":"Trust Model for Virtual Organizations","authors":"Sofia Neata, A. Urzica, A. Florea","doi":"10.1109/SYNASC.2011.40","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.40","url":null,"abstract":"in human society, trust plays an important role -- it is the main factor behind most decisions. Within an organization, both real and virtual, a series of decisions on personnel management flow are made. The paper proposes a trust model of agents in a virtual organization, which can be used to decide whether it is better to start, continue, or stop working with the evaluated agent. The trust factor of an agent is summarized as a unique value based on a function which properly aggregates the agent's characteristics and the available information on agent's performance. The proposed model has the advantage of assuring simple calculations and providing an overview of the evaluated agent's performance.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128806013","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
扫码关注我们
求助内容：
应助结果提醒方式：