发布求助
文献互助 智能选刊 最新文献

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献

筛选
英文 中文
Hybrid Modelling of an Audio Signal Based on 1-D Wold Decomposition 基于一维世界分解的音频信号混合建模
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.10
I. Borza, F. Turcu, M. Najim
{"title":"Hybrid Modelling of an Audio Signal Based on 1-D Wold Decomposition","authors":"I. Borza, F. Turcu, M. Najim","doi":"10.1109/SYNASC.2009.10","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.10","url":null,"abstract":"This paper presents a hybrid model which is applicable to a wide variety of unidimensional signals like speech and more complex audio signals. We propose a new criterion for an optimal reconstruction of an unidimensional signal based on Wold-like decomposition of the stochastic processes. This decomposition inthe case 1D implies two mutually orthogonal parts: a purely indeterministic part and a deterministic part, which can be modelled respectively by an autoregressive model and by a harmonic model. The problem to which we answer is the identification and the separation of the two parts, by a new criterion which combines the quality and the parsimony of the parametric representations. Both analytical and experimental results show that the deterministic part and completely non-deterministic components should be parametrized separately. The model proposed by us is very efficient in terms of the numbers of parameters used in the reconstruction of the original signal.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125819261","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
Description and Execution of Patterns for Symbolic Computations 符号计算模式的描述与执行
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.40
A. Cârstea, Georgiana Macariu, M. Frîncu, D. Petcu
{"title":"Description and Execution of Patterns for Symbolic Computations","authors":"A. Cârstea, Georgiana Macariu, M. Frîncu, D. Petcu","doi":"10.1109/SYNASC.2009.40","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.40","url":null,"abstract":"The principal benefit introduced by distributed systems is the ability to use the computation power and processing capabilities of multiple processing nodes in order to solve problems infeasible on a single machine. For symbolic computing these advantages are particularly useful. In order to create a successful distributed system to support symbolic computations is important to have a deep understanding of the way the computer algebra specialists interact with a symbolic computing system. In this paper we investigate general processing capabilities of symbolic computing systems related to control flow and we emphasize several execution patterns. The impact that workflow management functionalities have over general execution patterns in symbolic computing are also investigated.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126046314","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
Coloring Random Graphs: A Short Survey 随机图上色:一个简短的调查
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.8
L. Kirousis
{"title":"Coloring Random Graphs: A Short Survey","authors":"L. Kirousis","doi":"10.1109/SYNASC.2009.8","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.8","url":null,"abstract":"In this invited talk we present a short survey of some recent graphs on coloring random graphs.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117017567","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
Unified Strategy for Feature Selection and Data Imputation 特征选择与数据输入的统一策略
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.53
C. V. Bratu, R. Potolea
{"title":"Unified Strategy for Feature Selection and Data Imputation","authors":"C. V. Bratu, R. Potolea","doi":"10.1109/SYNASC.2009.53","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.53","url":null,"abstract":"Data-related issues represent the main causes for insufficient performance in data mining. Existing strategies for tackling these issues include procedures for handling incomplete data – mandatory in various schemes, and feature selection, both augmenting the learning process. Our previous work on data imputation has shown that a good imputation policy for strongly correlated attributes with the class can improve the learning accuracy. Moreover, feature selection also enhances the performance of an inducer. The focus of the paper is to validate the performance and stability of our combined methodology for pre-processing data. The novelty of the method resides in the combination of feature selection with data imputation, in order to obtain an improved version of the training set. The experimental results have shown that, when mining incomplete data, our combined pre-processing methodology boosts the accuracy of a classifier. Moreover, it is more successful than each of the individual steps it combines,feature selection and imputation, producing better or similar results.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116491811","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
Mamdani FLC with Various Implications Mamdani FLC与各种含义
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.32
I. Iancu, M. Colhon
{"title":"Mamdani FLC with Various Implications","authors":"I. Iancu, M. Colhon","doi":"10.1109/SYNASC.2009.32","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.32","url":null,"abstract":"The task of the standard Mamdani fuzzy logic controller is to find a crisp control action from the fuzzy rule-base and from a set of crisp inputs. Because the interval inputs are frequently used in various domains (online shopping, for instance), in this paper we propose an extension of this type of controller which works with intervals as inputs and with various implication operators. For any implication we obtain a crisp value as output. Finally, these outputs are combined to obtain the overall crisp output action of the system.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121533986","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}
引用次数: 11
m-Hilbert Polynomial and Arbitrariness of the General Solution of Partial Differential Equations m-Hilbert多项式与偏微分方程通解的任意性
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.22
Q. Ding, Hong-qing Zhang
{"title":"m-Hilbert Polynomial and Arbitrariness of the General Solution of Partial Differential Equations","authors":"Q. Ding, Hong-qing Zhang","doi":"10.1109/SYNASC.2009.22","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.22","url":null,"abstract":"Using the framework of formal theory of partial differential equations, we consider a method of computation of the m-Hilbert polynomial (i.e. Hilbert polynomial with multivariable), which generalizes the Seiler's theorem of Hilbert polynomial with single variable. Next we present an approach to compute the number of arbitrary functions of positive differential order in the general solution, and give a formally well-posed initial problem. Finally,as applications the Maxwell equations and weakly over determined equations are considered.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"306 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124362809","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
On a Functional-Differential Equation from Price Theory 从价格理论看泛函微分方程
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.14
Anton S. Muresan
{"title":"On a Functional-Differential Equation from Price Theory","authors":"Anton S. Muresan","doi":"10.1109/SYNASC.2009.14","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.14","url":null,"abstract":"In this paper we consider a functional-differential equation which appears in price theory and in the dynamics of economical systems. We give some new results about existence, uniqueness and data dependence of the solution of a problem which appears in conection with this functional-differential equation. These results are obtained by using Picard operator's technique and an abstract model for the steps method, due to the Professor Ioan A. Rus.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134127792","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
Performance Improvement of Genetic Algorithms by Adaptive Grid Workflows 基于自适应网格工作流的遗传算法性能改进
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.51
B. Jakimovski, Dragan Sahpaski, G. Velinov
{"title":"Performance Improvement of Genetic Algorithms by Adaptive Grid Workflows","authors":"B. Jakimovski, Dragan Sahpaski, G. Velinov","doi":"10.1109/SYNASC.2009.51","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.51","url":null,"abstract":"In this paper we present improvement of the performance of Grid Direct Acyclic Graph (DAG) workflow genetic algorithm by harnessing the power of High Level Petri-Nets workflow model. Genetic Algorithms are very powerful optimization technique that is easily parallelized using different approaches which makes it ideal for the Grid. The High Level Petri-Net workflow model greatly outperforms currently available DAG workflow model available in gLite Grid middleware. Using the flexibility of the High Level Petri-Net workflows we have designed an adaptive workflow that overcomes the heterogeneity and unpredictability of the Grid infrastructure, giving users better and more stable execution times than formerly used DAG workflows. The experimental results obtained by Genetic Algorithm optimization of performance of the Data Warehouse design have shown advantages of the new approach by shortening the optimization time up to 50%for the same CPU time utilization. Another advantage is the increased stability of the time variance of the estimated execution time to approximately 30 minutes for runs on different Grid loads.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"268 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115666192","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}
引用次数: 2
Factorizations of Regular Hedge Languages 正则对冲语言的因子分解
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.27
M. Marin, A. Craciun
{"title":"Factorizations of Regular Hedge Languages","authors":"M. Marin, A. Craciun","doi":"10.1109/SYNASC.2009.27","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.27","url":null,"abstract":"Regular hedge languages are an extension of regular tree languages that received renewed attention since their recognition as a formal model of XML schemata. They share several properties with regular languages, but their study is more involved because we need to analyze regularities of sequences of trees instead of words. We show that one shared property is the existence of only finitely many language factors and the possibility to compute and arrange them in a factor matrix with some remarkable properties. We outline an algorithm for the computation of the factor matrix and indicate an application of the factor matrix of an RHL to the solution of a concrete language reconstruction problem.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124246707","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}
引用次数: 2
Classes of Szilard Languages in NC^1 NC^1中的Szilard语言类
2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2009-09-26 DOI: 10.1109/SYNASC.2009.58
Liliana Cojocaru, E. Mäkinen, F. Ţiplea
{"title":"Classes of Szilard Languages in NC^1","authors":"Liliana Cojocaru, E. Mäkinen, F. Ţiplea","doi":"10.1109/SYNASC.2009.58","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.58","url":null,"abstract":"We prove that Szilard languages of context-free grammars can be accepted by an indexing alternating Turing machine (indexing ATM) in logarithmic time and space. The same result holds for leftmost Szilard languages of unrestricted (phrase-structure or type 0) grammars. Since the class of languages recognizable by an indexing ATM in logarithmic time equals the U_E-uniform NC1 class, we obtain that the above classes of Szilard languages are in NC1. The inclusions are strict, since there exist languages in NC1 that cannot be Szilard languages of any context-free or unrestricted grammar.","PeriodicalId":286180,"journal":{"name":"2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114322941","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}
引用次数: 11
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信