Helene Lachambre, Benjamin Ricaud, Guillaume Stempfel, Bruno Torrésani, Christoph Wiesmeyr, Darian Onchis-Moaca
{"title":"Optimal Window and Lattice in Gabor Transform. Application to Audio Analysis.","authors":"Helene Lachambre, Benjamin Ricaud, Guillaume Stempfel, Bruno Torrésani, Christoph Wiesmeyr, Darian Onchis-Moaca","doi":"10.1109/SYNASC.2015.25","DOIUrl":"10.1109/SYNASC.2015.25","url":null,"abstract":"<p><p>This article deals with the use of optimal lattice and optimal window in Discrete Gabor Transform computation. In the case of a generalized Gaussian window, extending earlier contributions, we introduce an additional local window adaptation technique for non-stationary signals. We illustrate our approach and the earlier one by addressing three time-frequency analysis problems to show the improvements achieved by the use of optimal lattice and window: close frequencies distinction, frequency estimation and SNR estimation. The results are presented, when possible, with real world audio signals.</p>","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"17 ","pages":"109-112"},"PeriodicalIF":0.0,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5405796/pdf/emss-71455.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34957853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model-Driven Decision Procedures for Arithmetic","authors":"L. D. Moura, Dejan Jovanovic","doi":"10.1109/SYNASC.2013.84","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.84","url":null,"abstract":"Summary form only given, as follows. Considering the theoretical hardness of SAT, the astonishing adeptness of SAT solvers when attacking practical problems has changed the way we perceive the limits of algorithmic reasoning. Modern SAT solvers are based on the idea of conflict driven clause learning (CDCL). The CDCL algorithm is a combination of an explicit backtracking search for a satisfying assignment complemented with a deduction system based on Boolean resolution. In this combination, the worst-case complexity of both components is circumvented by the components guiding and focusing each other. In this talk, we describe new procedures for nonlinear real arithmetic and linear integer arithmetic based on the CDCL algorithm. These procedures perform a backtracking search for a model, where the backtracking is powered by a novel conflict resolution procedure. Our approach takes advantage of the fact that each conflict encountered during the search is based on the current assignment and generally involves only a few constraints, a conflicting core. When in conflict, we project only the constraints from the conflicting core and explain the conflict in terms of the current model. The conflict resolution provides the usual benefits of a CDCL-style search engine, such as non-chronological backtracking and the ability to ignore irrelevant parts of the search space. The procedures described in the talk are instances of the model-constructing satisfiability calculus proposed by the authors.","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"35 1","pages":"11"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77758079","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}
{"title":"A New Digital Repository for Remotely Sensed Hyperspectral Imagery on GPUs","authors":"J. S. Cedillo, A. Plaza","doi":"10.1109/SYNASC.2013.68","DOIUrl":"https://doi.org/10.1109/SYNASC.2013.68","url":null,"abstract":"Hyperspectral imaging is a new technique in remote sensing in which an imaging spectrometer collects hundred of images (at different wavelength channels) for the same area on the surface of Earth. Over the last years, hyperspectral image data sets have been collected from a great amount of locations over the world using a variety of instruments for Earth observation. Only a small amount of them are available for public use and they are spread among different storage locations and exhibit significant heterogeneity regarding the storage format. Therefore, the development of a standardized hyperspectral data repository is a highly desired goal in the remote sensing community. In this paper, we describe the development of a shared digital repository for remotely sensed hyperspectral data, which allows uploading new hyperspectral data sets along with meta-data, ground-truth and analysis results (spectral information). Such repository is presented as a web service for providing the management of images through a web interface, and it is available online from http://www.hypercomp.es/repository. Most importantly, the developed system includes a spectral unmixing-based content based image retrieval (CBIR) functionality which allows searching for images from the database using spectrally pure components or endmembers in the scene. A full spectral unmixing chain is implemented for spectral information extraction, which allows filtering images using the similarity of the spectral signature and abundance of a given ground-truth. In order to accelerate the process of obtaining the spectral information for new entries in the system, we resort to an efficient implementations of spectral unmixing algorithms of graphics processing units (GPUs).","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"6 1","pages":"473-480"},"PeriodicalIF":0.0,"publicationDate":"2013-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76444527","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}
{"title":"A Method for Submodelling Inside Transient Flows","authors":"Anton Alin-Adrian","doi":"10.1109/SYNASC.2011.48","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.48","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"67 1","pages":"75-82"},"PeriodicalIF":0.0,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82194344","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}
{"title":"A Numerical Solution of the Semi Linear Singularly Perturbed Boundary Value Problem Using Multi Region Finite Difference Method","authors":"D. Edwards","doi":"10.1109/SYNASC.2009.35","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.35","url":null,"abstract":"A multi region finite difference method is described and applied to the one dimension, semi linear, singularly perturbed boundary value problem (SPBVP). The process of developing high precision algorithms for this problem is described and it is shown that when the multi region method is combined with the use of these high order algorithms, numerical solutions can achieve accuracies in the range of 10-20. This represents a gain of between 9 to 14 orders of magnitude over current techniques.","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"79 1","pages":"130-136"},"PeriodicalIF":0.0,"publicationDate":"2009-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74212812","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}
{"title":"A Modeling Framework for Generating Security Protocol Specifications","authors":"B. Genge, P. Haller","doi":"10.1109/SYNASC.2008.21","DOIUrl":"https://doi.org/10.1109/SYNASC.2008.21","url":null,"abstract":"We propose a modeling framework for generating security protocol specifications. The generated protocol specifications rely on the use of a sequential and a semantical component. The first component defines protocol properties such as preconditions, effects, message sequences and it is developed as a WSDL-S specification. The second component defines the semantic aspects corresponding to the messages included in the first component by the use of ontological constructions and it is developed as an OWL-based specification. Our approach was validated on 13 protocols from which we mention: the ISO9798 protocol, the CCITTX.509 data transfer protocol and the Kerberos symmetric key protocol.","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"70 1","pages":"362-365"},"PeriodicalIF":0.0,"publicationDate":"2009-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82648016","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}
{"title":"Finding the Solutions of Nonlinear Equation Systems from an Interval","authors":"Cristian Cira","doi":"10.1109/SYNASC.2009.60","DOIUrl":"https://doi.org/10.1109/SYNASC.2009.60","url":null,"abstract":"The paper describes an algorithm that determines the solutions of a n-dimensional nonlinear equation system within a given interval. The result is based on Semenov algorithm that isolates the solutions and improves upon it by introducing Kantorovich existence criterion. In Semenov algorithm the existence of the solution is decided by applying Newton method on each interval containing at most one solution. This article improves and completes the Semenov algorithm by determining the start iteration for each solution. With the computed start iteration the Newton method is applied to determine the solution with the precision ε. The Kantorovich error function E(k) is also computed for each iteration k. The paper contains numerical experiments.","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"117 1","pages":"124-129"},"PeriodicalIF":0.0,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81179479","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}
{"title":"The Design of Neural Network Direct Inverse Controller Based on Complex Particle Swarm Optimization Algorithm","authors":"Yuan-bin Mo, Heng Liu","doi":"10.1109/SYNASC.2006.72","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.72","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"73 1","pages":"382-388"},"PeriodicalIF":0.0,"publicationDate":"2006-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76470820","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}