2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献

A Data Dissemination Algorithm for Opportunistic Networks 机会网络中的一种数据传播算法

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.56

Radu-Ioan Ciobanu, C. Dobre, V. Cristea

引用次数: 4

Experiences in Computing Mesh Root Systems for Dynkin Diagrams Using Maple and C++ 用Maple和c++计算动态图网格根系统的经验

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.41

Mariusz Felisiak, D. Simson

引用次数: 13

Intelligent Web-History Based on a Hybrid Clustering Algorithm for Future-Internet Systems 未来互联网系统中基于混合聚类算法的智能web历史

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.24

A. Marin, Florin Pop

{"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}

引用次数: 6

Optimal Inequality Factor for Ehrlich-Aberth's Method Ehrlich-Aberth方法的最优不等式因子

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.8

Octavian Cira, Ş. Măruşter

引用次数: 0

Multi-agent Stock Trading Algorithm Model 多智能体股票交易算法模型

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.11

M. Tirea, Ioan Tandau, V. Negru

引用次数: 8

On a Non-periodic Shrinking Generator 非周期收缩发生器

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.25

I. Berzina, Raivis Bēts, J. Buls, Edmunds Cers, Liga Kulesa

引用次数: 5

Learning to Unlearn in Lattices of Concepts: A Case Study in Fluid Construction Grammars 在概念格中学习遗忘:以流体结构语法为例

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.27

Liviu Ciortuz, Vlad Saveluc

{"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}

引用次数: 2

A Genetic Approximation of Closest String via Rank Distance 基于秩距的最近弦的遗传逼近

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.31

Liviu P. Dinu, Radu Tudor Ionescu

引用次数: 7

Lorenz Equilibrium: Concept and Evolutionary Detection 洛伦兹平衡:概念和进化检测

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.46

Réka Nagy, D. Dumitrescu, R. Lung

引用次数: 5

Trust Model for Virtual Organizations 虚拟组织的信任模型

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.40

Sofia Neata, A. Urzica, A. Florea

引用次数: 4