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

The Runner -- Recommender System of Workout and Nutrition for Runners 跑步者——跑步者锻炼和营养推荐系统

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

Mihnea Donciu, M. Ionita, M. Dascalu, Stefan Trausan-Matu

{"title":"The Runner -- Recommender System of Workout and Nutrition for Runners","authors":"Mihnea Donciu, M. Ionita, M. Dascalu, Stefan Trausan-Matu","doi":"10.1109/SYNASC.2011.18","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.18","url":null,"abstract":"Recommender systems have been gaining popularity and appreciation over the past few years and they kept growing towards a semantic web. Internet users search for more and more facilities to get information and recommendations based on their preferences, experience and expectations. Nowadays, there are many recommender systems on the web for music, movies, diets, products, etc. Some of them use very efficient recommending techniques (ex. Amazon), while others are very simple, based on algorithms that do not always provide relevant or interesting recommendations. The solution we propose is a recommender system for running professionals and amateurs, which is able to provide information to users regarding the workout and the diet that best suits them, based on their profile information, preferences and declared purpose. The solution mixes a social dimension derived from an expanding community with expert knowledge defined within an ontology. Moreover, our model addresses adaptability in terms of personal profile, professional results and unfortunate events that might occur during workouts.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"88 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":"126199186","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}

引用次数: 15

A GIS Integrated Solution for Traffic Management GIS交通管理综合解决方案

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

E. Necula, R. Necula, Adrian Iftene

引用次数: 1

A Reinforcement Learning Approach for Solving the Fragment Assembly Problem 一种求解碎片装配问题的强化学习方法

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

Maria-Iuliana Bocicor, G. Czibula, I. Czibula

引用次数: 22

Grid Based Services and Tools for Hydrological Model Processing and Visualization 基于网格的水文模型处理和可视化服务和工具

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

V. Bâcu, D. Mihon, T. Stefanut, D. Rodila, D. Gorgan, P. Cau, S. Manca

{"title":"Grid Based Services and Tools for Hydrological Model Processing and Visualization","authors":"V. Bâcu, D. Mihon, T. Stefanut, D. Rodila, D. Gorgan, P. Cau, S. Manca","doi":"10.1109/SYNASC.2011.28","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.28","url":null,"abstract":"Different scenarios based on environmental changes and water quality models could be used to assess the sustainability and vulnerability of a particular geographical region. The gSWAT and BASHYT platforms provide services and tools supporting the calibration, execution and visualization of the SWAT models. The paper presents the experiments on the execution of different scenarios based on calibrated SWAT model over the Grid infrastructure. Based on the requirements for the SWAT models, lots of input and output data, the high number of simulations that must be performed in the calibration process, the Grid could offer both the storing and execution solutions. This paper presents the interoperability between gSWAT and BASHYT platforms highlighting the architectural components and presenting some test cases to assess the system performances. The research work is supported by the 4-years FP7 Project called Enviro GRIDS - Black Sea Catchment Observation and Assessment System supporting Sustainable Development (http://www.envirogrids.net/) co founded by the European Commission.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"8 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":"132807875","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}

引用次数: 5

Using the Executable Semantics for CFG Extraction and Unfolding 使用可执行语义进行CFG提取和展开

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

Mihail Asavoae, I. Asavoae

引用次数: 0

Nominal Semantics of the pi I-calculus i -微积分的名义语义

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

A. Alexandru, Gabriel Ciobanu

引用次数: 0

Estimating the Number of Processors towards an Efficient Non-preemptive Scheduling Algorithm 面向高效非抢占调度算法的处理器数量估计

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

S. Andrei, A. Cheng, V. Radulescu

{"title":"Estimating the Number of Processors towards an Efficient Non-preemptive Scheduling Algorithm","authors":"S. Andrei, A. Cheng, V. Radulescu","doi":"10.1109/SYNASC.2011.21","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.21","url":null,"abstract":"Given a task set T, finding a feasible schedule for T is one of the most significant problems of real time embedded systems. The research community has found a lot of important results for the scheduling problem on both uniprocessor and multiprocessor platforms. To the best of our knowledge, there is still room for research in determining the number of processors for a given task set, where each task is specified by its starting time, computation time, and deadline. The present paper describes an improved lower bound on the number of processors that allows a feasible schedule for a single-instance, non-preemptive, and independent task set T. In addition, an efficient algorithm is described, in order to achieve a feasible schedule for T for the real-time system with the number of processors equal to the lower bound previously determined. Both the above facts are extensions of the results presented in a previous work. Among many improvements, one of the main differences consists in considering the start times of the tasks when defining the task set, hence by allowing the considered model to cover more practical situations.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"23 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":"125435649","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

Metric Denotational Semantics for Parallel Rewriting of Multisets 多集并行重写的度量指称语义

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

Gabriel Ciobanu, E. Todoran

引用次数: 8

Dealing with Class Noise in Large Training Datasets for Malware Detection 针对恶意软件检测的大型训练数据集类噪声处理

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

Dragos Gavrilut, Liviu Ciortuz

引用次数: 5

What can Symbolic Computation Contribute to Mathematics? 符号计算对数学有何贡献?

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

F. Winkler

引用次数: 1