首页 > 最新文献

2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献

英文 中文
Intelligent Stock Market Analysis System - A Fundamental and Macro-economical Analysis Approach 智能股票市场分析系统——一种基础和宏观经济分析方法
M. Tirea, V. Negru
Stock Market Forecasting implies the use of a series of techniques that helps in determining the stock price evolution. The paper describes a multi-agent system that uses numerical, financial and economical data in order to evaluate the company's position on the market, profitability, performance, future expectations in the company's evolution. Determining the effect of political, governmental and social decisions along with detecting the way in which the price is constructed based on technical and fundamental analysis methods and the bid/ask situation helps in determining a more precise buy/sell signals, reducing the false signals and determining some risk/gain positions on different periods of time. In order to validate the results a prototype was developed.
股票市场预测意味着使用一系列技术来帮助确定股票价格的演变。本文描述了一个多智能体系统,该系统使用数值、财务和经济数据来评估公司在市场上的地位、盈利能力、业绩、公司发展的未来预期。确定政治、政府和社会决策的影响,以及基于技术和基本分析方法和买入价/卖出价情况的价格构造方式,有助于确定更精确的买入/卖出信号,减少错误信号,并确定不同时期的一些风险/收益头寸。为了验证结果,开发了一个原型。
{"title":"Intelligent Stock Market Analysis System - A Fundamental and Macro-economical Analysis Approach","authors":"M. Tirea, V. Negru","doi":"10.1109/SYNASC.2014.75","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.75","url":null,"abstract":"Stock Market Forecasting implies the use of a series of techniques that helps in determining the stock price evolution. The paper describes a multi-agent system that uses numerical, financial and economical data in order to evaluate the company's position on the market, profitability, performance, future expectations in the company's evolution. Determining the effect of political, governmental and social decisions along with detecting the way in which the price is constructed based on technical and fundamental analysis methods and the bid/ask situation helps in determining a more precise buy/sell signals, reducing the false signals and determining some risk/gain positions on different periods of time. In order to validate the results a prototype was developed.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026118","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
Reducing Partial Equivalence to Partial Correctness 将部分等价化为部分正确性
Stefan Ciobaca
Two programs P and Q are partially equivalent if, when both terminate on the same input, they end up with equivalent outputs. Establishing partial equivalence is useful in, e.g., Compiler verification, when P is the source program and Q is the target program, or in compiler optimisation, when P is the initial program and Q is the optimised program. A program R is partially correct if, when it terminates, it ends up in a "good" state. We show that, somewhat surprisingly, the problem of establishing partial equivalence can be reduced to the problem of showing partial correctness in an aggregated language, where programs R consist of pairs of programs 〈P, Q〉. Our method is crucially based on the recently-introduced matching logic, which allows to faithfully define the operational semantics of any language. We show that we can construct the aggregated language mechanically, from the semantics of the initial languages. Furthermore, matching logic gives us for free a proof system for partial correctness for the resulting language. This proof system can then be used to prove partial equivalence.
两个程序P和Q是部分等价的,如果它们终止于相同的输入,它们最终得到相同的输出。当P是源程序,Q是目标程序时,在编译器验证中,或者在编译器优化中,当P是初始程序,Q是优化程序时,建立部分等价是有用的。如果程序R在终止时处于“良好”状态,那么它就是部分正确的。令人惊讶的是,我们证明,建立部分等价的问题可以简化为在聚合语言中显示部分正确性的问题,其中程序R由程序对< P, Q >组成。我们的方法主要基于最近引入的匹配逻辑,它允许忠实地定义任何语言的操作语义。我们表明,我们可以从初始语言的语义机械地构建聚合语言。此外,匹配逻辑为我们提供了一个免费的证明系统,用于证明结果语言的部分正确性。这个证明系统可以用来证明部分等价。
{"title":"Reducing Partial Equivalence to Partial Correctness","authors":"Stefan Ciobaca","doi":"10.1109/SYNASC.2014.30","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.30","url":null,"abstract":"Two programs P and Q are partially equivalent if, when both terminate on the same input, they end up with equivalent outputs. Establishing partial equivalence is useful in, e.g., Compiler verification, when P is the source program and Q is the target program, or in compiler optimisation, when P is the initial program and Q is the optimised program. A program R is partially correct if, when it terminates, it ends up in a \"good\" state. We show that, somewhat surprisingly, the problem of establishing partial equivalence can be reduced to the problem of showing partial correctness in an aggregated language, where programs R consist of pairs of programs 〈P, Q〉. Our method is crucially based on the recently-introduced matching logic, which allows to faithfully define the operational semantics of any language. We show that we can construct the aggregated language mechanically, from the semantics of the initial languages. Furthermore, matching logic gives us for free a proof system for partial correctness for the resulting language. This proof system can then be used to prove partial equivalence.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117058812","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}
引用次数: 9
Using Models at Runtime to Support Adaptable Monitoring of Multi-clouds Applications 在运行时使用模型支持多云应用程序的自适应监控
Lorenzo Cianciaruso, Francesco di Forenza, E. D. Nitto, Marco Miglierina, Nicolas Ferry, Arnor Solberg
The ability to run and manage multi-clouds applications (i.e., Applications that run on multiple clouds) allows exploiting the peculiarities of each cloud solution and hence improves non-functional aspects such as availability, cost, and scalability. Monitoring such multi-clouds applications is fundamental to track the health of the applications themselves and of their underlying infrastructures as well as to decide when and how to adapt their behaviour and deployment. It is clear that, not only the application but also the corresponding monitoring infrastructure should dynamically adapt in order to (i) be optimized to the application context (e.g., Adapting the frequency of monitoring to reduce network load), (ii) to enable the co-evolution of the monitoring platform together with the cloud application (e.g., If a service migrates from one provider to another, the monitoring activities have to be adapted accordingly). In this paper, we present a model-based platform for the dynamic provisioning, deployment, and monitoring of multi-clouds applications whose monitoring activities can be automatically and dynamically adapted to best fit with the actual deployment of the application.
运行和管理多云应用程序(即,在多个云上运行的应用程序)的能力允许利用每个云解决方案的特性,从而改进非功能方面,如可用性、成本和可伸缩性。监视此类多云应用程序对于跟踪应用程序本身及其底层基础设施的运行状况以及决定何时以及如何调整其行为和部署至关重要。很明显,不仅应用程序,而且相应的监控基础设施也应该动态适应,以便(i)根据应用程序上下文进行优化(例如,调整监控频率以减少网络负载),(ii)使监控平台与云应用程序一起协同发展(例如,如果服务从一个提供商迁移到另一个提供商,则监控活动必须相应地进行调整)。在本文中,我们提出了一个基于模型的平台,用于多云应用程序的动态供应、部署和监控,这些应用程序的监控活动可以自动和动态地适应应用程序的实际部署。
{"title":"Using Models at Runtime to Support Adaptable Monitoring of Multi-clouds Applications","authors":"Lorenzo Cianciaruso, Francesco di Forenza, E. D. Nitto, Marco Miglierina, Nicolas Ferry, Arnor Solberg","doi":"10.1109/SYNASC.2014.60","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.60","url":null,"abstract":"The ability to run and manage multi-clouds applications (i.e., Applications that run on multiple clouds) allows exploiting the peculiarities of each cloud solution and hence improves non-functional aspects such as availability, cost, and scalability. Monitoring such multi-clouds applications is fundamental to track the health of the applications themselves and of their underlying infrastructures as well as to decide when and how to adapt their behaviour and deployment. It is clear that, not only the application but also the corresponding monitoring infrastructure should dynamically adapt in order to (i) be optimized to the application context (e.g., Adapting the frequency of monitoring to reduce network load), (ii) to enable the co-evolution of the monitoring platform together with the cloud application (e.g., If a service migrates from one provider to another, the monitoring activities have to be adapted accordingly). In this paper, we present a model-based platform for the dynamic provisioning, deployment, and monitoring of multi-clouds applications whose monitoring activities can be automatically and dynamically adapted to best fit with the actual deployment of the application.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122062186","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}
引用次数: 4
Expressing BBUFs Lookup Using the &#x3C0;-Calculus 使用&#x3C0;-微积分表达bbuf查找
Gabriel Ciobanu, Dan Cojocar
In this paper we express Babes Bolyai University File System lookup mechanism by using π-calculus. We describe the lookup process in a peer-to-peer decentralized system, how a request message is forwarded from a client to a system node, and how the response is replied. The formally specified protocol is verified by using the Mobility Workbench model-checker.
本文用π微积分表达了博雅大学档案系统的查找机制。我们描述了点对点分散系统中的查找过程,请求消息如何从客户机转发到系统节点,以及如何响应。使用Mobility Workbench模型检查器验证正式指定的协议。
{"title":"Expressing BBUFs Lookup Using the &amp;#x3C0;-Calculus","authors":"Gabriel Ciobanu, Dan Cojocar","doi":"10.1109/SYNASC.2014.74","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.74","url":null,"abstract":"In this paper we express Babes Bolyai University File System lookup mechanism by using π-calculus. We describe the lookup process in a peer-to-peer decentralized system, how a request message is forwarded from a client to a system node, and how the response is replied. The formally specified protocol is verified by using the Mobility Workbench model-checker.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126215231","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
Optimization Techniques within the Hadoop Eco-system: A Survey Hadoop生态系统中的优化技术:调查
Giulia Rumi, Claudia Colella, D. Ardagna
Nowadays, we live in a digital world producing data at an impressive speed: data are large, change quickly, and are often too complex to be processed by existing tools. The problem is to extract knowledge from all these data in an efficient way. MapReduce is a data parallel programming model for clusters of commodity machines that was created to address this problem. In this paper we provide an overview of the Hadoop ecosystem. We introduce the most significative approaches supporting automatic, on-line resource provisioning. Moreover, we analyse optimization approaches proposed in frameworks built on top of MapReduce, such as Pig and Hive, which point out the importance of scheduling techniques in MapReduce when multiple workflows are executed concurrently. Therefore, the default Hadoop schedulers are discussed along with some enhancements proposed by the research community. The analysis is performed to highlight how research contributions try to address common Hadoop points of weakness. As it stands out from our comparison, none of the frameworks surpasses the others and a fair evaluation is also difficult to be performed, the choice of the framework must be related to the specific application goal but there is no single solution that addresses all the issues typical of MapReduce.
如今,我们生活在一个以惊人的速度产生数据的数字世界:数据量大,变化快,而且往往太复杂,无法用现有工具处理。问题是如何以一种有效的方式从所有这些数据中提取知识。MapReduce是一种用于商用机器集群的数据并行编程模型,它的创建就是为了解决这个问题。在本文中,我们概述了Hadoop生态系统。我们介绍了支持自动在线资源供应的最有意义的方法。此外,我们分析了基于MapReduce框架的优化方法,如Pig和Hive,指出了调度技术在MapReduce中并发执行多个工作流时的重要性。因此,我们将讨论默认的Hadoop调度器以及研究社区提出的一些增强功能。执行分析是为了突出研究贡献如何试图解决常见的Hadoop弱点。从我们的比较中可以看出,没有一个框架能超越其他框架,公平的评估也很难执行,框架的选择必须与特定的应用程序目标相关,但是没有单一的解决方案可以解决MapReduce的所有典型问题。
{"title":"Optimization Techniques within the Hadoop Eco-system: A Survey","authors":"Giulia Rumi, Claudia Colella, D. Ardagna","doi":"10.1109/SYNASC.2014.65","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.65","url":null,"abstract":"Nowadays, we live in a digital world producing data at an impressive speed: data are large, change quickly, and are often too complex to be processed by existing tools. The problem is to extract knowledge from all these data in an efficient way. MapReduce is a data parallel programming model for clusters of commodity machines that was created to address this problem. In this paper we provide an overview of the Hadoop ecosystem. We introduce the most significative approaches supporting automatic, on-line resource provisioning. Moreover, we analyse optimization approaches proposed in frameworks built on top of MapReduce, such as Pig and Hive, which point out the importance of scheduling techniques in MapReduce when multiple workflows are executed concurrently. Therefore, the default Hadoop schedulers are discussed along with some enhancements proposed by the research community. The analysis is performed to highlight how research contributions try to address common Hadoop points of weakness. As it stands out from our comparison, none of the frameworks surpasses the others and a fair evaluation is also difficult to be performed, the choice of the framework must be related to the specific application goal but there is no single solution that addresses all the issues typical of MapReduce.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126573382","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}
引用次数: 7
Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition 利用柱面代数分解中按维分布的单元
D. Wilson, M. England, R. Bradford, J. Davenport
We investigate the distribution of cells by dimension in cylindrical algebraic decompositions (CADs). We find that they follow a standard distribution which seems largely independent of the underlying problem or CAD algorithm used. Rather, the distribution is inherent to the cylindrical structure and determined mostly by the number of variables. This insight is then combined with an algorithm that produces only full-dimensional cells to give an accurate method of predicting the number of cells in a complete CAD. Since constructing only full-dimensional cells is relatively inexpensive (involving no costly algebraic number calculations) this leads to heuristics for helping with various questions of problem formulation for CAD, such as choosing an optimal variable ordering. Our experiments demonstrate that this approach can be highly effective.
我们研究了圆柱代数分解(CADs)中细胞的维数分布。我们发现它们遵循一种标准分布,这种分布似乎在很大程度上独立于所使用的潜在问题或CAD算法。相反,分布是圆柱形结构固有的,主要由变量的数量决定。然后将这种见解与仅产生全维细胞的算法相结合,从而提供准确预测完整CAD中细胞数量的方法。由于只构造全维单元相对便宜(不涉及昂贵的代数数计算),这导致启发式方法有助于解决CAD问题表述的各种问题,例如选择最优变量排序。我们的实验表明,这种方法是非常有效的。
{"title":"Using the Distribution of Cells by Dimension in a Cylindrical Algebraic Decomposition","authors":"D. Wilson, M. England, R. Bradford, J. Davenport","doi":"10.1109/SYNASC.2014.15","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.15","url":null,"abstract":"We investigate the distribution of cells by dimension in cylindrical algebraic decompositions (CADs). We find that they follow a standard distribution which seems largely independent of the underlying problem or CAD algorithm used. Rather, the distribution is inherent to the cylindrical structure and determined mostly by the number of variables. This insight is then combined with an algorithm that produces only full-dimensional cells to give an accurate method of predicting the number of cells in a complete CAD. Since constructing only full-dimensional cells is relatively inexpensive (involving no costly algebraic number calculations) this leads to heuristics for helping with various questions of problem formulation for CAD, such as choosing an optimal variable ordering. Our experiments demonstrate that this approach can be highly effective.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"2 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026491","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}
引用次数: 16
Topological Image Analysis and (Normalised) Representations for Plant Phenotyping 植物表型的拓扑图像分析和(归一化)表示
Ines Janusch, W. Kropatsch, Wolfgang Busch
This paper discusses the use of topological image analysis to derive characteristics needed in plant phenotyping. Due to certain features of root systems (deformation over time, overlaps of branches in a 2D image of the root system) a topological analysis is needed to correctly derive these characteristics. The advantages of such a topological analysis are highlighted in this paper and root phenotyping is presented as a new application for computational topology. Characteristics used in plant phenotyping that can be derived from root images using methods of topological image analysis are further presented. A Reeb graph based representation of root images is shown as an example for such a topological analysis. Based on a graph representation a new, normalised representation of root images is introduced.
本文讨论了利用拓扑图像分析来推导植物表型所需的特征。由于根系的某些特征(随着时间的推移而变形,根系二维图像中的分支重叠),需要进行拓扑分析才能正确地推导出这些特征。本文强调了这种拓扑分析的优点,并提出了根表型作为计算拓扑的新应用。利用拓扑图像分析的方法从根系图像中提取植物表型特征。基于Reeb图的根图像表示作为这种拓扑分析的示例。在图表示的基础上,引入了根图像的一种新的归一化表示。
{"title":"Topological Image Analysis and (Normalised) Representations for Plant Phenotyping","authors":"Ines Janusch, W. Kropatsch, Wolfgang Busch","doi":"10.1109/SYNASC.2014.83","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.83","url":null,"abstract":"This paper discusses the use of topological image analysis to derive characteristics needed in plant phenotyping. Due to certain features of root systems (deformation over time, overlaps of branches in a 2D image of the root system) a topological analysis is needed to correctly derive these characteristics. The advantages of such a topological analysis are highlighted in this paper and root phenotyping is presented as a new application for computational topology. Characteristics used in plant phenotyping that can be derived from root images using methods of topological image analysis are further presented. A Reeb graph based representation of root images is shown as an example for such a topological analysis. Based on a graph representation a new, normalised representation of root images is introduced.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133358957","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}
引用次数: 3
Spiking Neural P Systems - A Quick Survey and Some Research Topics 脉冲神经系统-一个快速调查和一些研究课题
G. Paun
After presenting the basic definition of spiking neural P systems (SN P systems), illustrated with two examples, we recall some results concerning the computing power and the size of universal SN P systems. We end this note with a couple of research topics.
在给出了脉冲神经系统(snp系统)的基本定义之后,用两个例子来说明,我们回顾了关于通用snp系统的计算能力和大小的一些结果。我们以几个研究课题来结束这篇文章。
{"title":"Spiking Neural P Systems - A Quick Survey and Some Research Topics","authors":"G. Paun","doi":"10.1109/SYNASC.2014.11","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.11","url":null,"abstract":"After presenting the basic definition of spiking neural P systems (SN P systems), illustrated with two examples, we recall some results concerning the computing power and the size of universal SN P systems. We end this note with a couple of research topics.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116725323","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
A Population-Based Incremental Learning Method for Constrained Portfolio Optimisation 约束投资组合优化的基于群体的增量学习方法
Yan Jin, R. Qu, J. Atkin
This paper investigates a hybrid algorithm which utilizes exact and heuristic methods to optimise asset selection and capital allocation in portfolio optimisation. The proposed method is composed of a customised population based incremental learning procedure and a mathematical programming application. It is based on the standard Markowitz model with additional practical constraints such as cardinality on the number of assets and quantity of the allocated capital. Computational experiments have been conducted and analysis has demonstrated the performance and effectiveness of the proposed approach.
本文研究了一种利用精确和启发式方法对投资组合优化中的资产选择和资本配置进行优化的混合算法。该方法由基于自定义种群的增量学习过程和数学规划应用程序组成。它基于标准的马科维茨模型,并带有额外的实际约束,如资产数量和分配资本数量的基数。计算实验和分析证明了该方法的性能和有效性。
{"title":"A Population-Based Incremental Learning Method for Constrained Portfolio Optimisation","authors":"Yan Jin, R. Qu, J. Atkin","doi":"10.1109/SYNASC.2014.36","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.36","url":null,"abstract":"This paper investigates a hybrid algorithm which utilizes exact and heuristic methods to optimise asset selection and capital allocation in portfolio optimisation. The proposed method is composed of a customised population based incremental learning procedure and a mathematical programming application. It is based on the standard Markowitz model with additional practical constraints such as cardinality on the number of assets and quantity of the allocated capital. Computational experiments have been conducted and analysis has demonstrated the performance and effectiveness of the proposed approach.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129423981","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}
引用次数: 10
Interactive Data Exploration for High-Performance Fluid Flow Computations through Porous Media 通过多孔介质进行高性能流体流动计算的交互式数据探索
N. Perovic, J. Frisch, R. Mundani, E. Rank
Huge data advent in high-performance computing (HPC) applications such as fluid flow simulations usually hinders the interactive processing and exploration of simulation results. Such an interactive data exploration not only allows scientiest to 'play' with their data but also to visualise huge (distributed) data sets in both an efficient and easy way. Therefore, we propose an HPC data exploration service based on a sliding window concept, that enables researches to access remote data (available on a supercomputer or cluster) during simulation runtime without exceeding any bandwidth limitations between the HPC back-end and the user front-end.
在流体流动模拟等高性能计算应用中,大量数据的出现通常会阻碍对模拟结果的交互处理和探索。这种交互式数据探索不仅可以让科学家们“玩”他们的数据,还可以以一种高效和简单的方式将庞大的(分布式)数据集可视化。因此,我们提出了一种基于滑动窗口概念的HPC数据探索服务,使研究人员能够在模拟运行时访问远程数据(在超级计算机或集群上可用),而不超过HPC后端和用户前端之间的任何带宽限制。
{"title":"Interactive Data Exploration for High-Performance Fluid Flow Computations through Porous Media","authors":"N. Perovic, J. Frisch, R. Mundani, E. Rank","doi":"10.1109/SYNASC.2014.68","DOIUrl":"https://doi.org/10.1109/SYNASC.2014.68","url":null,"abstract":"Huge data advent in high-performance computing (HPC) applications such as fluid flow simulations usually hinders the interactive processing and exploration of simulation results. Such an interactive data exploration not only allows scientiest to 'play' with their data but also to visualise huge (distributed) data sets in both an efficient and easy way. Therefore, we propose an HPC data exploration service based on a sliding window concept, that enables researches to access remote data (available on a supercomputer or cluster) during simulation runtime without exceeding any bandwidth limitations between the HPC back-end and the user front-end.","PeriodicalId":150575,"journal":{"name":"2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127375489","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
期刊
2014 16th 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