首页 > 最新文献

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

英文 中文
The Runner -- Recommender System of Workout and Nutrition for Runners 跑步者——跑步者锻炼和营养推荐系统
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.
在过去的几年里,推荐系统越来越受欢迎,并不断向语义网发展。互联网用户搜索越来越多的设施,根据他们的喜好、经验和期望来获取信息和推荐。如今,网络上有许多音乐、电影、饮食、产品等方面的推荐系统。其中一些使用非常有效的推荐技术(例如Amazon),而另一些则非常简单,基于并不总是提供相关或有趣推荐的算法。我们提出的解决方案是为跑步专业人士和业余爱好者提供一个推荐系统,该系统能够根据用户的个人资料信息、偏好和声明的目的,向用户提供最适合他们的锻炼和饮食信息。该解决方案将来自不断扩展的社区的社会维度与本体中定义的专家知识混合在一起。此外,我们的模型解决了个人资料、专业成绩和锻炼过程中可能发生的不幸事件等方面的适应性问题。
{"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交通管理综合解决方案
E. Necula, R. Necula, Adrian Iftene
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.
随着移动设备的传播和计算能力的增强,现在可以在各种情况下执行分布式人工智能应用:使用算法的智能路由,规划,交通灯的分布式优化。我们的解决方案提供了一种复杂的方式,将智能交通模拟与分布式交通管理系统相结合,既适用于驾驶员,也适用于城市地区的交通灯调整负责人。顶部是一个桌面应用程序,它提供了主要功能,并有一个分布式内置服务器来处理数据。它与一个web应用程序相连,该应用程序能够显示到感兴趣点的最佳路线。根据天气状况、道路限制、驾驶员的平均速度或特定的小时间隔等参数,系统会相应地调整输出。在移动电话上运行的应用程序收集数据非常有用,这些数据将每天作为跟踪日志存储在数据库中。
{"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}
引用次数: 1
A Reinforcement Learning Approach for Solving the Fragment Assembly Problem 一种求解碎片装配问题的强化学习方法
Maria-Iuliana Bocicor, G. Czibula, I. Czibula
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.
DNA片段组装是一个非常复杂的优化问题,在生物信息学和计算生物学等许多领域都具有重要意义。这个问题是np困难的,这就是为什么许多计算技术,包括计算智能算法,都是为了找到这个问题的好解决方案而设计的。由于DNA片段组装是任何测序项目的关键部分,研究人员仍然专注于开发更好的组装器。本文旨在提出一种新的基于强化学习的模型来解决碎片组装问题。我们特别关注DNA片段组装问题。我们的模型是基于基于q学习代理的方法。实验验证了所提模型的良好性能,表明了所提模型的潜力。
{"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}
引用次数: 22
Grid Based Services and Tools for Hydrological Model Processing and Visualization 基于网格的水文模型处理和可视化服务和工具
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.
基于环境变化和水质模型的不同情景可用于评估特定地理区域的可持续性和脆弱性。gSWAT和BASHYT平台提供支持SWAT模型校准、执行和可视化的服务和工具。本文给出了在网格基础设施上基于标定SWAT模型的不同场景的执行实验。基于SWAT模型的需求,大量的输入和输出数据,以及在校准过程中必须执行的大量仿真,网格可以提供存储和执行的解决方案。本文介绍了gSWAT和BASHYT平台之间的互操作性,重点介绍了体系结构组件,并给出了一些测试用例来评估系统性能。这项研究工作得到了欧盟委员会共同发起的为期四年的FP7项目“环境网格-支持可持续发展的黑海流域观测和评估系统”(http://www.envirogrids.net/)的支持。
{"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提取和展开
Mihail Asavoae, I. Asavoae
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.
最长路径搜索问题在低级的最坏情况执行时间分析中很重要,它意味着通过方便的抽象来显示和检查所有程序执行的时间行为。本文提出了一种基于目标语言的形式化可执行语义的定义程序展开。我们与K合作,这是一个基于重写的框架,用于设计和分析编程语言。我们的方法分为两个阶段。首先,通过可达性分析,直接从语言的可执行语义中提取出一个安全的控制流图(CFG)近似。其次,它使用循环边界注释展开控制流图,并输出所有可能的程序执行集。两个阶段的定义程序unfolder是使用K- maude工具实现的,这是K框架的原型实现。
{"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}
引用次数: 0
Nominal Semantics of the pi I-calculus i -微积分的名义语义
A. Alexandru, Gabriel Ciobanu
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.
我们提出了pii -微积分的一种新的语义,即标称语义。利用标称量词,从标称逻辑的角度给出了一组紧凑的转换规则。我们证明了新的标称语义与Sangiorgi提供的pi -微积分的原始语义之间的等价性,强调了使用标称技术表示转换规则的好处。
{"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}
引用次数: 0
Estimating the Number of Processors towards an Efficient Non-preemptive Scheduling Algorithm 面向高效非抢占调度算法的处理器数量估计
S. Andrei, A. Cheng, V. Radulescu
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.
给定一个任务集T,为T找到一个可行的调度是实时嵌入式系统最重要的问题之一。对于单处理器和多处理器平台上的调度问题,学术界已经取得了许多重要的成果。据我们所知,在确定给定任务集的处理器数量方面仍有研究的余地,其中每个任务都由其开始时间、计算时间和截止日期指定。本文描述了一个改进的处理器数下界,该下界允许对单实例、非抢占和独立的任务集T进行可行调度,并描述了一种有效的算法,以便在处理器数等于先前确定的下界的情况下实现实时系统对T的可行调度。上述两个事实都是对先前工作中提出的结果的扩展。在许多改进中,主要的区别之一是在定义任务集时考虑任务的开始时间,从而允许考虑的模型涵盖更多的实际情况。
{"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 多集并行重写的度量指称语义
Gabriel Ciobanu, E. Todoran
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}
引用次数: 8
Dealing with Class Noise in Large Training Datasets for Malware Detection 针对恶意软件检测的大型训练数据集类噪声处理
Dragos Gavrilut, Liviu Ciortuz
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}
引用次数: 5
What can Symbolic Computation Contribute to Mathematics? 符号计算对数学有何贡献?
F. Winkler
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.
符号计算(数学学科分类2000,68W30)通常被视为数学中广泛的专题领域中的另一门学科,与网格生成(65L50)或拟frobenius环(16L60)处于同一水平。在这里,我们想要论证的是,实际上符号计算并不是数学中的一个主题,而是一种相对新颖的数学认识论方法,一种不同的,我们认为富有成效的看待数学和数学知识获取的方式。
{"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}
引用次数: 1
期刊
2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1