2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献_第4页

Traders' Behavior Effect on Stock Price Evolution 交易者行为对股票价格演化的影响

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.43

M. Tirea

引用次数: 1

Online-Scheduling on Identical Machines with Bounded Migration 具有有界迁移的同机在线调度

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.54

Thorsten Ehlers, K. Jansen

引用次数: 2

Managing Risk Behavior on an Evolutionary Market -- A Risk Limits and Value-at-Risk Measures Approach 在演化市场中管理风险行为——风险限制和风险价值度量方法

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.77

M. Tirea, V. Negru

引用次数: 0

Resolution of the Probabilistic Vector Machine Problem via Single Linear Program 用单线性程序求解概率向量机问题

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.78

Mihai Cimpoesu, Andrei Sucila, H. Luchian

引用次数: 0

Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures 基于树结构的稀疏矩阵结构的空间高效格式

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.52

I. Šimeček, D. Langr, P. Tvrdík

引用次数: 6

Planar Stretching Flows with Partial Slip 部分滑移的平面拉伸流动

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.24

R. Ene, V. Marinca, R. Negrea

引用次数: 1

Certified, Efficient and Sharp Univariate Taylor Models in COQ COQ中的认证、高效和夏普单变量泰勒模型

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.33

Érik Martin-Dorel, L. Rideau, L. Théry, Micaela Mayero, I. Pasca

引用次数: 13

Should We Beware the Exceptions? An Empirical Study on the Eclipse Project 我们应该注意例外吗?Eclipse项目的实证研究

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.40

C. Marinescu

{"title":"Should We Beware the Exceptions? An Empirical Study on the Eclipse Project","authors":"C. Marinescu","doi":"10.1109/SYNASC.2013.40","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.40","url":null,"abstract":"Exception handling is a mechanism that highlights exceptional functionality of software systems. Currently there are empirical studies pointing out that design entities (classes) that use exceptions are more defect prone than the other classes and sometimes developers neglect exceptional functionality, minimizing its importance. In this paper we investigate if classes that use exceptions are the most complex classes from software systems and, consequently, have an increased likelihood to exhibit defects. We also detect two types of improper usages of exceptions in three releases of Eclipse and investigate the relations between classes that handle/do not handle properly exceptions and the defects those classes exhibit. The results show that (i) classes that use exceptions are more complex than the other classes and (ii) classes that handle improperly the exceptions in the source code exhibit an increased likelihood of exhibiting defects than classes which handle them properly. Based on the provided evidence, practitioners get knowledge about the correlations between exceptions and complexity and are advised once again about the negative impact deviations from best programming practices have at a source code level.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133037778","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}

引用次数: 14

Identifying Features via Homotopy on Handwritten Mathematical Symbols 手写数学符号的同伦特征识别

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.15

Rui Hu, S. Watt

{"title":"Identifying Features via Homotopy on Handwritten Mathematical Symbols","authors":"Rui Hu, S. Watt","doi":"10.1109/SYNASC.2013.15","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.15","url":null,"abstract":"In handwritten mathematics, it is common to have characters in various sizes and for writing not to follow simple baselines. For example, subscripts and superscripts appear relatively smaller than normal text and are written slightly below or above it. Rather than use the location, features and size to identify the character, it may be more effective to do the reverse --- to use knowledge about specific characters to determine baseline, size, etc. In this approach, it is necessary to find the location of certain expected features that are determined by particular points. In earlier work, we have presented a method to derive the determining points for a new instance of a symbol from those on an average model for each symbol type. For those characters that are significantly different from the average instance, one can use a numerical homotopy between the average instance and the target character, and apply the determining point algorithm at each step. The present article studies the factors to be taken into account in performing such homotopies. We examine two strategies for possible starting points for the homotopy, and we examine the relation between the distance and the number of steps required. The first starting point strategy performs a homotopy from the average of samples of the same type. The second strategy uses a homotopy from the nearest neighbour with known determining points. Our experimental results show a useful relation between the homotopy distance and the number of steps usually required and improved strategies to find determining points for poorly written characters.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122191825","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

An Effective Ensemble-Based Method for Creating On-the-Fly Surrogate Fitness Functions for Multi-objective Evolutionary Algorithms 基于集成的多目标进化算法动态代理适应度函数生成方法

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2013-09-23 DOI: 10.1109/SYNASC.2013.38

Alexandru-Ciprian Zavoianu, E. Lughofer, G. Bramerdorfer, W. Amrhein, E. Klement

{"title":"An Effective Ensemble-Based Method for Creating On-the-Fly Surrogate Fitness Functions for Multi-objective Evolutionary Algorithms","authors":"Alexandru-Ciprian Zavoianu, E. Lughofer, G. Bramerdorfer, W. Amrhein, E. Klement","doi":"10.1109/SYNASC.2013.38","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.38","url":null,"abstract":"The task of designing electrical drives is a multi-objective optimization problem (MOOP) that remains very slow even when using state-of-the-art approaches like particle swarm optimization and evolutionary algorithms because the fitness function used to assess the quality of a proposed design is based on time-intensive finite element (FE) simulations. One straightforward solution is to replace the original FE-based fitness function with a much faster-to-evaluate surrogate. In our particular case each optimization scenario poses rather unique challenges (i.e., goals and constraints) and the surrogate models need to be constructed on-the-fly, automatically, during the run of the evolutionary algorithm. In the present research, using three industrial MOOPs, we investigated several approaches for creating such surrogate models and discovered that a strategy that uses ensembles of multi-layer perceptron neural networks and Pareto-trimmed training sets is able to produce very high quality surrogate models in a relatively short time interval.","PeriodicalId":293085,"journal":{"name":"2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125029661","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