Search results for "statistical"

showing 10 items of 4960 documents

Influence of Background Knowledge and Language Proficiency on Comprehension of Domain-Specific Texts by University Students

2019

This paper presents the results of a quantitative study that explores two factors contributing to reading comprehension of domain specific texts, namely level of language proficiency and background knowledge. Overall, 32 students participated in the study by taking two custom-designed reading comprehension tests. The test scores were further  analyzed using SPSS statistical software. The results of statistical tests revealed the differences between study groups as well as the effects of compensation. More precisely, the most proficient group scored higher on almost all tests and completed the tests more quickly than the remaining groups. The statistical tools used to test the data showed th…

ComprehensionLinguistics and LanguageStudy groupsReading comprehensionDevelopmental and Educational PsychologyMathematics educationLanguage proficiencyPsychologyStatistical softwareEducationStatistical hypothesis testingTest (assessment)Domain (software engineering)Theory and Practice of Second Language Acquisition
researchProduct

Spectral approach to the scattering map for the semi-classical defocusing Davey–Stewartson II equation

2019

International audience; The inverse scattering approach for the defocusing Davey–Stewartson II equation is given by a system of D-bar equations. We present a numerical approach to semi-classical D-bar problems for real analytic rapidly decreasing potentials. We treat the D-bar problem as a complex linear second order integral equation which is solved with discrete Fourier transforms complemented by a regularization of the singular parts by explicit analytic computation. The resulting algebraic equation is solved either by fixed point iterations or GMRES. Several examples for small values of the semi-classical parameter in the system are discussed.

ComputationFOS: Physical sciences010103 numerical & computational mathematicsFixed point01 natural sciencesRegularization (mathematics)[MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph]Davey-Stewartson equationsFOS: MathematicsApplied mathematicsMathematics - Numerical Analysis0101 mathematics[MATH]Mathematics [math]Mathematics[PHYS]Physics [physics]Nonlinear Sciences - Exactly Solvable and Integrable SystemsScattering010102 general mathematicsStatistical and Nonlinear PhysicsD-bar problemsNumerical Analysis (math.NA)Condensed Matter PhysicsFourier spectral methodGeneralized minimal residual methodIntegral equationAlgebraic equationInverse scattering problemExactly Solvable and Integrable Systems (nlin.SI)Limit
researchProduct

Appearances of pseudo-bosons from Black-Scholes equation

2016

It is a well known fact that the Black-Scholes equation admits an alternative representation as a Schr\"odinger equation expressed in terms of a non self-adjoint hamiltonian. We show how {\em pseudo-bosons}, linear or not, naturally arise in this context, and how they can be used in the computation of the pricing kernel.

ComputationFOS: Physical sciencesStatistical and Nonlinear PhysicsBlack–Scholes modelMathematical Physics (math-ph)Mathematics::Spectral Theory01 natural sciences010305 fluids & plasmasSchrödinger equationsymbols.namesakeStochastic discount factor0103 physical sciencessymbols010306 general physicsHamiltonian (quantum mechanics)Settore MAT/07 - Fisica MatematicaMathematical PhysicsStatistical and Nonlinear PhysicBosonMathematical physicsMathematics
researchProduct

Approximation of functions over manifolds : A Moving Least-Squares approach

2021

We present an algorithm for approximating a function defined over a $d$-dimensional manifold utilizing only noisy function values at locations sampled from the manifold with noise. To produce the approximation we do not require any knowledge regarding the manifold other than its dimension $d$. We use the Manifold Moving Least-Squares approach of (Sober and Levin 2016) to reconstruct the atlas of charts and the approximation is built on-top of those charts. The resulting approximant is shown to be a function defined over a neighborhood of a manifold, approximating the originally sampled manifold. In other words, given a new point, located near the manifold, the approximation can be evaluated…

Computational Geometry (cs.CG)FOS: Computer and information sciencesComputer Science - Machine LearningClosed manifolddimension reductionMachine Learning (stat.ML)010103 numerical & computational mathematicsComplex dimensionTopology01 natural sciencesMachine Learning (cs.LG)Volume formComputer Science - GraphicsStatistics - Machine Learningmanifold learningApplied mathematics0101 mathematicsfunktiotMathematicsManifold alignmentAtlas (topology)Applied Mathematicshigh dimensional approximationManifoldGraphics (cs.GR)Statistical manifold010101 applied mathematicsregression over manifoldsComputational Mathematicsout-of-sample extensionComputer Science - Computational Geometrynumeerinen analyysimonistotapproksimointimoving least-squaresCenter manifold
researchProduct

<I>A Special Issue on</I> Theoretical and Mathematical Aspects of Discrete Time Quantum Walks

2013

Computational MathematicsDiscrete time and continuous timeGeneral Materials ScienceQuantum walkGeneral ChemistryStatistical physicsElectrical and Electronic EngineeringCondensed Matter PhysicsMathematicsJournal of Computational and Theoretical Nanoscience
researchProduct

A method for detecting vacancy diffusion in molecular dynamics

1992

Computational MathematicsNumerical AnalysisMolecular dynamicsMaterials sciencePhysics and Astronomy (miscellaneous)Chemical physicsApplied MathematicsModeling and SimulationVacancy defectStatistical physicsDiffusion (business)Computer Science ApplicationsJournal of Computational Physics
researchProduct

Fermion sign problem in imaginary-time projection continuum quantum Monte Carlo with local interaction

2016

We use the Shadow Wave Function formalism as a convenient model to study the fermion sign problem affecting all projector Quantum Monte Carlo methods in continuum space. We demonstrate that the efficiency of imaginary time projection algorithms decays exponentially with increasing number of particles and/or imaginary-time propagation. Moreover, we derive an analytical expression that connects the localization of the system with the magnitude of the sign problem, illustrating this prediction through some numerical results. Finally, we discuss the fermion sign problem computational complexity and methods for alleviating its severity.

Computational complexity theoryQuantum Monte CarloFOS: Physical sciences02 engineering and technology01 natural scienceslaw.inventionCondensed Matter - Strongly Correlated ElectronslawPhysics - Chemical Physics0103 physical sciencesStatistical physics010306 general physicsWave functionProjection algorithmsChemical Physics (physics.chem-ph)Numerical sign problemPhysicsStrongly Correlated Electrons (cond-mat.str-el)FermionComputational Physics (physics.comp-ph)021001 nanoscience & nanotechnologyImaginary timeCondensed Matter - Other Condensed MatterClassical mechanicsProjector0210 nano-technologyPhysics - Computational PhysicsOther Condensed Matter (cond-mat.other)Physical Review E
researchProduct

Attentional vs computational complexity measures in observing paintings

2009

Because of the great heterogeneity of subjects and styles, esthetic perception delineates a special and elusive field of research in vision, which represents an interesting challenge for cognitive science tools. With specific regard to the role of visual complexity, in this paper we present an experiment aimed to measure this dimension in a heterogeneous set of paintings. We compared perceived time complexity measures - based on a temporal estimation paradigm - with physical and statistical properties of the paintings, obtaining a strong correlation between psychological and computational results.

Computational complexity theoryVisionmedia_common.quotation_subjectMedicine in the ArtsVisual PhysiologyExperimental and Cognitive PsychologyField (computer science)PerceptionHumansAttentionDimension (data warehouse)Set (psychology)Time complexitymedia_commonSettore INF/01 - Informaticabusiness.industryDistance PerceptionComplexityForm PerceptionPattern Recognition VisualPattern recognition (psychology)PaintingsComputer Vision and Pattern RecognitionArtificial intelligenceFactor Analysis StatisticalPsychologybusinessPhotic StimulationCognitive psychology
researchProduct

A Random Trajectory Approach for the Development of Nonstationary Channel Models Capturing Different Scales of Fading

2017

This paper introduces a new approach to developing stochastic nonstationary channel models, the randomness of which originates from a random trajectory of the mobile station (MS) rather than from the scattering area. The new approach is employed by utilizing a random trajectory model based on the primitives of Brownian fields (BFs), whereas the position of scatterers can be generated from an arbitrarily 2-D distribution function. The employed trajectory model generates random paths along which the MS travels from a given starting point to a fixed predefined destination point. To capture the path loss, the gain of each multipath component is modeled by a negative power law applied to the tra…

Computer Networks and CommunicationsComputer scienceAerospace Engineering020302 automobile design & engineering020206 networking & telecommunications02 engineering and technologysymbols.namesakeFading distribution0203 mechanical engineeringChannel state informationAutomotive Engineering0202 electrical engineering electronic engineering information engineeringElectronic engineeringTrajectorysymbolsPath lossFadingStatistical physicsElectrical and Electronic EngineeringPower delay profileGaussian processRandomnessComputer Science::Information Theory
researchProduct

Robust entanglement preparation against noise by controlling spatial indistinguishability

2019

Initialization of composite quantum systems into highly entangled states is usually a must to allow their use for quantum technologies. However, the presence of unavoidable noise in the preparation stage makes the system state mixed, thus limiting the possibility of achieving this goal. Here we address this problem in the context of identical particle systems. We define the entanglement of formation for an arbitrary state of two identical qubits within the operational framework of spatially localized operations and classical communication (sLOCC). We then introduce an entropic measure of spatial indistinguishability under sLOCC as an information resource. We show that spatial indistinguisha…

Computer Networks and CommunicationsComputer scienceInitializationFOS: Physical sciencesContext (language use)Quantum entanglementNoise (electronics)Measure (mathematics)lcsh:QA75.5-76.95Settore FIS/03 - Fisica Della MateriaEntanglementComputer Science (miscellaneous)Statistical physicsQuantumQuantum PhysicsQuantum resourcesStatistical and Nonlinear PhysicsQuantum Physicslcsh:QC1-999Quantum technologyComputational Theory and MathematicsQubitOpen quantum systemlcsh:Electronic computers. Computer scienceQuantum Physics (quant-ph)lcsh:PhysicsQuantum indistinguishability
researchProduct