Mihnea Donciu, M. Ionita, M. Dascalu, Stefan Trausan-Matu
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.
{"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}
With the increased dissemination and computing power of mobile devices, it is now possible to execute distributed artificial intelligence applications for various situations: intelligent routing using algorithms, planning, distributed optimization of traffic lights. Our solution provides a complex way of integrating intelligent traffic simulation with a distributed traffic management system that is both useful for the drivers and for the persons in charge with traffic light adjustment in urban regions. At the top lays a desktop application that provides the main features and has a distributed built-in server to process the data. This one is connected with a web application capable of showing the optimum route for a point of interest. The output is adjusted accordingly with a set of parameters related to weather conditions, road restrictions, driver's average speed or specific hour intervals. The application that runs on mobile phones it's very useful to collect the data that will be stored daily in the database as trace logs.
{"title":"A GIS Integrated Solution for Traffic Management","authors":"E. Necula, R. Necula, Adrian Iftene","doi":"10.1109/SYNASC.2011.36","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.36","url":null,"abstract":"With the increased dissemination and computing power of mobile devices, it is now possible to execute distributed artificial intelligence applications for various situations: intelligent routing using algorithms, planning, distributed optimization of traffic lights. Our solution provides a complex way of integrating intelligent traffic simulation with a distributed traffic management system that is both useful for the drivers and for the persons in charge with traffic light adjustment in urban regions. At the top lays a desktop application that provides the main features and has a distributed built-in server to process the data. This one is connected with a web application capable of showing the optimum route for a point of interest. The output is adjusted accordingly with a set of parameters related to weather conditions, road restrictions, driver's average speed or specific hour intervals. The application that runs on mobile phones it's very useful to collect the data that will be stored daily in the database as trace logs.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"3 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":"131205965","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 DNA fragment assembly is a very complex optimization problem important within many fields including bioinformatics and computational biology. The problem is NP-hard, that is why many computational techniques including computational intelligence algorithms were designed for finding good solutions for this problem. Since DNA fragment assembly is a crucial part of any sequencing project, researchers are still focusing on developing better assemblers. In this paper we aim at proposing a new reinforcement learning based model for solving the fragment assembly problem. We are particularly focusing on the DNA fragment assembly problem. Our model is based on a Q-learning agent-based approach. The experimental evaluation confirms a good performance of the proposed model and indicates the potential of our proposal.
{"title":"A Reinforcement Learning Approach for Solving the Fragment Assembly Problem","authors":"Maria-Iuliana Bocicor, G. Czibula, I. Czibula","doi":"10.1109/SYNASC.2011.9","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.9","url":null,"abstract":"The DNA fragment assembly is a very complex optimization problem important within many fields including bioinformatics and computational biology. The problem is NP-hard, that is why many computational techniques including computational intelligence algorithms were designed for finding good solutions for this problem. Since DNA fragment assembly is a crucial part of any sequencing project, researchers are still focusing on developing better assemblers. In this paper we aim at proposing a new reinforcement learning based model for solving the fragment assembly problem. We are particularly focusing on the DNA fragment assembly problem. Our model is based on a Q-learning agent-based approach. The experimental evaluation confirms a good performance of the proposed model and indicates the potential of our proposal.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"69 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":"126991238","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}
V. Bâcu, D. Mihon, T. Stefanut, D. Rodila, D. Gorgan, P. Cau, S. Manca
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.
{"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}
The longest path search problem is important in low-level worst-case execution time analysis and implies that all program executions are exhibited and inspected, via convenient abstractions, for their timing behavior. In this paper we present a definitional program unfolded that is based on the formal executable semantics of a target language. We work with K, a rewrite-based framework for the design and analysis of programming languages. Our methodology has two phases. First, it extracts directly from the executable semantics of the language, via reach ability analysis, a safe control-flow graph (CFG) approximation. Second, it unfolds the control-flow graph, using loop bounds annotations and outputs the set of all possible program executions. The two-phased definitional program un folder is implemented using the K-Maude tool, a prototype implementation of the K framework.
{"title":"Using the Executable Semantics for CFG Extraction and Unfolding","authors":"Mihail Asavoae, I. Asavoae","doi":"10.1109/SYNASC.2011.53","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.53","url":null,"abstract":"The longest path search problem is important in low-level worst-case execution time analysis and implies that all program executions are exhibited and inspected, via convenient abstractions, for their timing behavior. In this paper we present a definitional program unfolded that is based on the formal executable semantics of a target language. We work with K, a rewrite-based framework for the design and analysis of programming languages. Our methodology has two phases. First, it extracts directly from the executable semantics of the language, via reach ability analysis, a safe control-flow graph (CFG) approximation. Second, it unfolds the control-flow graph, using loop bounds annotations and outputs the set of all possible program executions. The two-phased definitional program un folder is implemented using the K-Maude tool, a prototype implementation of the K framework.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"69 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":"133896352","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 a new semantics of the piI-calculus, namely the nominal semantics. A set of compact transition rules is given in terms of nominal logic by using a nominal quantifier. We prove an equivalence between the new nominal semantics and the original semantics of the piI-calculus provided by Sangiorgi, emphasizing the benefits of presenting the transition rules by using the nominal techniques.
{"title":"Nominal Semantics of the pi I-calculus","authors":"A. Alexandru, Gabriel Ciobanu","doi":"10.1109/SYNASC.2011.19","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.19","url":null,"abstract":"We present a new semantics of the piI-calculus, namely the nominal semantics. A set of compact transition rules is given in terms of nominal logic by using a nominal quantifier. We prove an equivalence between the new nominal semantics and the original semantics of the piI-calculus provided by Sangiorgi, emphasizing the benefits of presenting the transition rules by using the nominal techniques.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"5 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":"122128975","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}
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.
{"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}
We present a denotational semantics designed with metric spaces and continuations for an abstract concurrent language embodying two new features: the semantics of parallel composition is based on the concept of maximal parallelism, and computations are specified by means of multiset rewriting rules. To the best of our knowledge, this is the first paper that presents a metric denotational semantics for this combination of features, encountered also in membrane computing.
{"title":"Metric Denotational Semantics for Parallel Rewriting of Multisets","authors":"Gabriel Ciobanu, E. Todoran","doi":"10.1109/SYNASC.2011.20","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.20","url":null,"abstract":"We present a denotational semantics designed with metric spaces and continuations for an abstract concurrent language embodying two new features: the semantics of parallel composition is based on the concept of maximal parallelism, and computations are specified by means of multiset rewriting rules. To the best of our knowledge, this is the first paper that presents a metric denotational semantics for this combination of features, encountered also in membrane computing.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"9 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":"126340908","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 presents the ways we explored until now for detecting and dealing with the class noise found in large annotated datasets used for training the classifiers that we have previously designed for industrial-scale malware identification. First we established a number of distance-based filtering rules that allow us to identify different "levels'' of potential noise in the training data, and secondly we analysed the effects produced by either removal or "cleaning'' of the potentially-noised records on the performances of our simplest classifiers. We show that a careful distance-based filtering can lead to sensibly better results in malware detection.
{"title":"Dealing with Class Noise in Large Training Datasets for Malware Detection","authors":"Dragos Gavrilut, Liviu Ciortuz","doi":"10.1109/SYNASC.2011.39","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.39","url":null,"abstract":"This paper presents the ways we explored until now for detecting and dealing with the class noise found in large annotated datasets used for training the classifiers that we have previously designed for industrial-scale malware identification. First we established a number of distance-based filtering rules that allow us to identify different \"levels'' of potential noise in the training data, and secondly we analysed the effects produced by either removal or \"cleaning'' of the potentially-noised records on the performances of our simplest classifiers. We show that a careful distance-based filtering can lead to sensibly better results in malware detection.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"9 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":"131901043","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}
Symbolic Computation (Mathematics Subject Classification 2000, 68W30) is often treated as just another subject in the wide field of special topics within mathematics, on the same level as mesh generation (65L50) or quasi-Frobenius rings (16L60). Here we want to argue that actually Symbolic Computation is not so much a topic in mathematics, but a relatively novel approach to mathematical epistemology, a different and, as we believe, fruitful way of looking at mathematics and the acquisition of knowledge in mathematics.
{"title":"What can Symbolic Computation Contribute to Mathematics?","authors":"F. Winkler","doi":"10.1109/SYNASC.2011.59","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.59","url":null,"abstract":"Symbolic Computation (Mathematics Subject Classification 2000, 68W30) is often treated as just another subject in the wide field of special topics within mathematics, on the same level as mesh generation (65L50) or quasi-Frobenius rings (16L60). Here we want to argue that actually Symbolic Computation is not so much a topic in mathematics, but a relatively novel approach to mathematical epistemology, a different and, as we believe, fruitful way of looking at mathematics and the acquisition of knowledge in mathematics.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"22 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":"133239046","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
扫码关注我们
求助内容：
应助结果提醒方式：