Search results for "Application"

showing 10 items of 5559 documents

A New Nonparametric Estimate of the Risk-Neutral Density with Applications to Variance Swaps

2021

We develop a new nonparametric approach for estimating the risk-neutral density of asset prices and reformulate its estimation into a double-constrained optimization problem. We evaluate our approach using the S\&P 500 market option prices from 1996 to 2015. A comprehensive cross-validation study shows that our approach outperforms the existing nonparametric quartic B-spline and cubic spline methods, as well as the parametric method based on the Normal Inverse Gaussian distribution. As an application, we use the proposed density estimator to price long-term variance swaps, and the model-implied prices match reasonably well with those of the variance future downloaded from the CBOE websi…

FOS: Computer and information sciencesStatistics and ProbabilityVariance swapOptimization problemvariance swapStatistics - ApplicationsFOS: Economics and businessNormal-inverse Gaussian distributiondouble-constrained optimizationpricingEconometricsApplications (stat.AP)Asset (economics)normal inverse Gaussian distributionMathematicsParametric statisticslcsh:T57-57.97Applied MathematicsNonparametric statisticsEstimatorVariance (accounting)lcsh:Applied mathematics. Quantitative methodsPricing of Securities (q-fin.PR)risk-neutral densitylcsh:Probabilities. Mathematical statisticslcsh:QA273-280Quantitative Finance - Pricing of Securities
researchProduct

Alignment-free Genomic Analysis via a Big Data Spark Platform

2021

Abstract Motivation Alignment-free distance and similarity functions (AF functions, for short) are a well-established alternative to pairwise and multiple sequence alignments for many genomic, metagenomic and epigenomic tasks. Due to data-intensive applications, the computation of AF functions is a Big Data problem, with the recent literature indicating that the development of fast and scalable algorithms computing AF functions is a high-priority task. Somewhat surprisingly, despite the increasing popularity of Big Data technologies in computational biology, the development of a Big Data platform for those tasks has not been pursued, possibly due to its complexity. Results We fill this impo…

FOS: Computer and information sciencesStatistics and Probabilitysequence analysisComputer science0206 medical engineeringBig data02 engineering and technologyMachine learningcomputer.software_genreBiochemistry03 medical and health sciencesSpark (mathematics)MapReduceMolecular Biology030304 developmental biology0303 health sciencesSettore INF/01 - Informaticabusiness.industryBioinformatics High Performance Computing Compressed Data StructuresMapReduce; hadoop; sequence analysisComputer Science ApplicationsComputational MathematicsTask (computing)Computer Science - Distributed Parallel and Cluster ComputingComputational Theory and MathematicsDistributed Parallel and Cluster Computing (cs.DC)Artificial intelligencehadoopbusinesscomputer020602 bioinformaticsBioinformatics
researchProduct

Binary jumbled string matching for highly run-length compressible texts

2012

The Binary Jumbled String Matching problem is defined as: Given a string $s$ over $\{a,b\}$ of length $n$ and a query $(x,y)$, with $x,y$ non-negative integers, decide whether $s$ has a substring $t$ with exactly $x$ $a$'s and $y$ $b$'s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this index have running time $O(n^2/\log n)$ [Burcsi et al., FUN 2010; Moosa and Rahman, IPL 2010], or $O(n^2/\log^2 n)$ in the word-RAM model [Moosa and Rahman, JDA 2012]. We propose an index constructed directly from the run-length encoding of $s$. The construction time of our index i…

FOS: Computer and information sciencesString algorithmsStructure (category theory)Binary numberG.2.1Data_CODINGANDINFORMATIONTHEORY0102 computer and information sciences02 engineering and technologyString searching algorithm01 natural sciencesComputer Science - Information RetrievalTheoretical Computer ScienceCombinatoricsdata structuresSimple (abstract algebra)Computer Science - Data Structures and AlgorithmsString algorithms; jumbled pattern matching; prefix normal form; data structures0202 electrical engineering electronic engineering information engineeringParikh vectorData Structures and Algorithms (cs.DS)Run-length encodingMathematics68W32 68P05 68P20String (computer science)prefix normal formSubstringComputer Science Applicationsjumbled pattern matching010201 computation theory & mathematicsData structureSignal ProcessingRun-length encoding020201 artificial intelligence & image processingConstant (mathematics)Information Retrieval (cs.IR)Information SystemsInformation Processing Letters
researchProduct

Semantic Computing of Moods Based on Tags in Social Media of Music

2014

Social tags inherent in online music services such as Last.fm provide a rich source of information on musical moods. The abundance of social tags makes this data highly beneficial for developing techniques to manage and retrieve mood information, and enables study of the relationships between music content and mood representations with data substantially larger than that available for conventional emotion research. However, no systematic assessment has been done on the accuracy of social tags and derived semantic models at capturing mood information in music. We propose a novel technique called Affective Circumplex Transformation (ACT) for representing the moods of music tracks in an interp…

FOS: Computer and information sciencesVocabularyComputer scienceMusic information retrievalmedia_common.quotation_subjectSemantic analysis (machine learning)Moodscomputer.software_genreAffect (psychology)SemanticsComputer Science - Information RetrievalSemantic computingMusic information retrievalAffective computingmedia_commonSocial and Information Networks (cs.SI)ta113Probabilistic latent semantic analysisSocial tagsbusiness.industryComputer Science - Social and Information NetworksMultimedia (cs.MM)Semantic analysisComputer Science ApplicationsMoodComputational Theory and MathematicsWeb miningta6131Vector space modelArtificial intelligenceGenresbusinesscomputerComputer Science - MultimediaInformation Retrieval (cs.IR)MusicNatural language processingPrediction.Information SystemsIEEE Transactions on Knowledge and Data Engineering
researchProduct

Statistical Performance Analysis of a Fast Super-Resolution Technique Using Noisy Translations.

2014

It is well known that the registration process is a key step for super-resolution reconstruction. In this work, we propose to use a piezoelectric system that is easily adaptable on all microscopes and telescopes for controlling accurately their motion (down to nanometers) and therefore acquiring multiple images of the same scene at different controlled positions. Then a fast super-resolution algorithm \cite{eh01} can be used for efficient super-resolution reconstruction. In this case, the optimal use of $r^2$ images for a resolution enhancement factor $r$ is generally not enough to obtain satisfying results due to the random inaccuracy of the positioning system. Thus we propose to take seve…

FOS: Computer and information sciences[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingPositioning systemComputer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONsuper-resolution02 engineering and technologyIterative reconstructionMethodology (stat.ME)[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingPosition (vector)[ INFO.INFO-TI ] Computer Science [cs]/Image Processing0202 electrical engineering electronic engineering information engineeringComputer visionImage resolutionStatistics - Methodologyerror analysis[STAT.AP]Statistics [stat]/Applications [stat.AP]business.industryreconstruction algorithms[ STAT.AP ] Statistics [stat]/Applications [stat.AP]Process (computing)high-resolution imaging020206 networking & telecommunicationsFunction (mathematics)Computer Graphics and Computer-Aided DesignSuperresolutionperformance evaluation[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]microscopy020201 artificial intelligence & image processingAlgorithm designArtificial intelligencebusinessSoftwareIEEE transactions on image processing : a publication of the IEEE Signal Processing Society
researchProduct

Determinantal sets, singularities and application to optimal control in medical imagery

2016

International audience; Control theory has recently been involved in the field of nuclear magnetic resonance imagery. The goal is to control the magnetic field optimally in order to improve the contrast between two biological matters on the pictures. Geometric optimal control leads us here to analyze mero-morphic vector fields depending upon physical parameters , and having their singularities defined by a deter-minantal variety. The involved matrix has polynomial entries with respect to both the state variables and the parameters. Taking into account the physical constraints of the problem, one needs to classify, with respect to the parameters, the number of real singularities lying in som…

FOS: Computer and information sciences[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]Computer Science - Symbolic Computation0209 industrial biotechnologyPolynomialRank (linear algebra)010102 general mathematicsBoundary (topology)Field (mathematics)02 engineering and technologySymbolic Computation (cs.SC)Optimal control01 natural sciencesPolynomial system solvingReal geometryPolynomial matrix[ INFO.INFO-SC ] Computer Science [cs]/Symbolic Computation [cs.SC]Set (abstract data type)Matrix (mathematics)020901 industrial engineering & automationApplications0101 mathematicsAlgorithmMathematics
researchProduct

A Unified SVM Framework for Signal Estimation

2013

This paper presents a unified framework to tackle estimation problems in Digital Signal Processing (DSP) using Support Vector Machines (SVMs). The use of SVMs in estimation problems has been traditionally limited to its mere use as a black-box model. Noting such limitations in the literature, we take advantage of several properties of Mercer's kernels and functional analysis to develop a family of SVM methods for estimation in DSP. Three types of signal model equations are analyzed. First, when a specific time-signal structure is assumed to model the underlying system that generated the data, the linear signal model (so called Primal Signal Model formulation) is first stated and analyzed. T…

FOS: Computer and information sciencesbusiness.industryNoise (signal processing)Computer scienceApplied MathematicsSpectral density estimationArray processingPattern recognitionMachine Learning (stat.ML)Statistics - ApplicationsSupport vector machineKernel (linear algebra)Kernel methodComputational Theory and MathematicsStatistics - Machine LearningArtificial IntelligenceSignal ProcessingApplications (stat.AP)Computer Vision and Pattern RecognitionArtificial intelligenceElectrical and Electronic EngineeringStatistics Probability and UncertaintybusinessDigital signal processingReproducing kernel Hilbert space
researchProduct

Study design in causal models

2012

The causal assumptions, the study design and the data are the elements required for scientific inference in empirical research. The research is adequately communicated only if all of these elements and their relations are described precisely. Causal models with design describe the study design and the missing data mechanism together with the causal structure and allow the direct application of causal calculus in the estimation of the causal effects. The flow of the study is visualized by ordering the nodes of the causal diagram in two dimensions by their causal order and the time of the observation. Conclusions whether a causal or observational relationship can be estimated from the collect…

FOS: Computer and information sciencesdesignstructural equation modelG.362A01 62-09 62F99 62D05 62P10 62K99 68T30graphical modelMachine Learning (stat.ML)G.2.2Statistics - ApplicationsG.3; G.2.2Methodology (stat.ME)missing dataStatistics - Machine LearningkausaliteettiApplications (stat.AP)epidemiologiaStatistics - Methodology
researchProduct

Quantum GestART: Identifying and Applying Correlations between Mathematics, Art, and Perceptual Organization

2020

Mathematics can help analyze the arts and inspire new artwork. Mathematics can also help make transformations from one artistic medium to another, considering exceptions and choices, as well as artists' individual and unique contributions. We propose a method based on diagrammatic thinking and quantum formalism. We exploit decompositions of complex forms into a set of simple shapes, discretization of complex images, and Dirac notation, imagining a world of "prototypes" that can be connected to obtain a fine or coarse-graining approximation of a given visual image. Visual prototypes are exchanged with auditory ones, and the information (position, size) characterizing visual prototypes is con…

FOS: Computer and information sciencesdiagrams; Dirac notation; Gestalt; Gestural similarity; sonificationmedia_common.quotation_subjectHistory and Overview (math.HO)ComputerApplications_COMPUTERSINOTHERSYSTEMSThe artsGestaltBra–ket notationPerceptionGestural similarityFOS: MathematicssonificationQuantummedia_commonCognitive scienceSettore INF/01 - InformaticaMathematics - History and OverviewApplied MathematicsSettore MAT/04 - Matematiche ComplementariMultimedia (cs.MM)Gestural similarity Gestalt diagrams Dirac notation sonificationComputational MathematicsdiagramsSonificationModeling and SimulationGestalt psychologyDirac notationInformationSystems_MISCELLANEOUSSettore ING-INF/05 - Sistemi di Elaborazione delle InformazioniComputer Science - MultimediaMusic
researchProduct

The Max-Product Algorithm Viewed as Linear Data-Fusion: A Distributed Detection Scenario

2019

In this paper, we disclose the statistical behavior of the max-product algorithm configured to solve a maximum a posteriori (MAP) estimation problem in a network of distributed agents. Specifically, we first build a distributed hypothesis test conducted by a max-product iteration over a binary-valued pairwise Markov random field and show that the decision variables obtained are linear combinations of the local log-likelihood ratios observed in the network. Then, we use these linear combinations to formulate the system performance in terms of the false-alarm and detection probabilities. Our findings indicate that, in the hypothesis test concerned, the optimal performance of the max-product a…

FOS: Computer and information sciencesfactor graphsComputer scienceComputer Science - Information TheoryMarkovin ketjut02 engineering and technologyMarkov random fieldsalgoritmit0202 electrical engineering electronic engineering information engineeringMaximum a posteriori estimationmax-product algorithmElectrical and Electronic EngineeringLinear combinationStatistical hypothesis testingdistributed systemsMarkov random fieldspectrum sensingApplied MathematicsNode (networking)Information Theory (cs.IT)linear data-fusionApproximation algorithm020206 networking & telecommunicationsComputer Science Applicationssum-product algorithmPairwise comparisonRandom variableAlgorithmstatistical inference
researchProduct