Search results for "difference"

showing 10 items of 1534 documents

Frecuencia del consumo de drogas legales: Diferencias de edad en la adolescencia

2007

El consumo de drogas es especialmente relevante por sus efectos negativos sobre la salud psicofísica y el funcionamiento social de los jóvenes. El objetivo de este estudio fue analizar las diferencias de edad respecto a las frecuencias de consumo de alcohol y tabaco en una muestra de 354 escolares (50.85% varones) de 12 a 18 años (M = 14.66; DT = 1.08) que cumplimentaron el Questionnarie about Consume of Alcohol and Tobacco (TNT). Los resultados muestran que el 82.4% de los adolescentes ha consumido bebidas alcohólicas en alguna ocasión y el 25.6% es consumidor actualmente. Respecto al consumo de tabaco, el 40.4% de estudiantes afirma haber fumado en alguna ocasión, siendo consumidores actu…

Diferencias de edad:PSICOLOGÍA::Psicofarmacología [UNESCO]:PSICOLOGÍA [UNESCO]UNESCO::PSICOLOGÍAUNESCO::PSICOLOGÍA::PsicofarmacologíaAdolescenceTabacoAdolescenciaTobaccoAge differencesPrevalenceAlcoholPrevalenciaAdolescencia alcohol tabaco prevalencia diferencias de edad
researchProduct

General Solution of a Second-Order Nonhomogenous Linear Difference Equation with Noncommutative Coefficients

2010

The detailed construction of the general solution of a second-order nonhomogenous linear operator-difference equation is presented. The wide applicability of such an equation as well as the usefulness of its resolutive formula is shown by studying some applications belonging to different mathematical contexts.

Difference equation noncommutativity companion matrix generating functions
researchProduct

Positive solutions for a discrete two point nonlinear boundary value problem with p-Laplacian

2017

Abstract In the framework of variational methods, we use a two non-zero critical points theorem to obtain the existence of two positive solutions to Dirichlet boundary value problems for difference equations involving the discrete p -Laplacian operator.

Difference equationDiscrete boundary value problemTwo solution01 natural sciencesElliptic boundary value problemDirichlet distributionCritical point theory; Difference equations; Discrete boundary value problems; p-Laplacian; Positive solutions; Two solutions; Analysis; Applied MathematicsPositive solutionsymbols.namesakePoint (geometry)Boundary value problem0101 mathematicsMathematicsApplied Mathematics010102 general mathematicsMathematical analysisp-LaplacianAnalysiMixed boundary condition010101 applied mathematicssymbolsp-LaplacianCritical point theoryNonlinear boundary value problemLaplace operatorAnalysis
researchProduct

Multi-level contrast filtering in image difference metrics

2013

In this paper, we present a new metric to estimate the perceived difference in contrast between an original image and a reproduction. This metric, named weighted-level framework Δ E E (WLF-DEE), implements a multilevel filtering based on the difference of Gaussians model proposed by Tadmor and Tolhurst (2000) and the new Euclidean color difference formula in log-compressed OSA-UCS space proposed by Oleari et al. (2009). Extensive tests and analysis are presented on four different categories belonging to the well-known Tampere Image Database and on two databases developed at our institution, providing different distortions directly related to color and contrast. Comparisons in performance wi…

Difference of GaussiansColor differenceBiometricsbusiness.industryComputer scienceContrast (statistics)Pattern recognitionImage (mathematics)Metric (mathematics)Pattern recognition (psychology)Euclidean geometrySignal ProcessingArtificial intelligenceElectrical and Electronic EngineeringbusinessInformation SystemsEURASIP Journal on Image and Video Processing
researchProduct

Generalized finite difference schemes with higher order Whitney forms

2021

Finite difference kind of schemes are popular in approximating wave propagation problems in finite dimensional spaces. While Yee’s original paper on the finite difference method is already from the sixties, mathematically there still remains questions which are not yet satisfactorily covered. In this paper, we address two issues of this kind. Firstly, in the literature Yee’s scheme is constructed separately for each particular type of wave problem. Here, we explicitly generalize the Yee scheme to a class of wave problems that covers at large physics field theories. For this we introduce Yee’s scheme for all problems of a class characterised on a Minkowski manifold by (i) a pair of first ord…

Differential equationDifferential formsähkömagnetismiFirst-order partial differential equationdifferential formselectromagnetism010103 numerical & computational mathematics01 natural sciencesdifferentiaaligeometriaMinkowski spaceApplied mathematicsdifferential geometry0101 mathematicsFinite setfinite difference methodMathematicsNumerical AnalysisSpacetimeApplied MathematicsFinite difference methodFinite differencevector-valued formswhitney forms010101 applied mathematicsComputational MathematicsModeling and Simulationelasticityco-vector valued formsAnalysisESAIM: Mathematical Modelling and Numerical Analysis
researchProduct

On Sturmian Graphs

2007

AbstractIn this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conjectures, by Moser and by Zaremba, on the continued fraction expansion of real numbers. These graphs turn out to be the underlying graphs of compact directed acyclic word graphs of central Sturmian words. In order to prove this result, we give a characterization of the maximal repeats of central Sturmian words. We show also that, in analogy with the case of Sturmian words, these graphs converge to infinite ones.

Discrete mathematicsApplied MathematicsCDAWGsContinued fractionsSturmian wordSturmian wordsCharacterization (mathematics)RepeatsDirected acyclic graphCombinatoricsIndifference graphSturmian words CDAWGs Continued fractions RepeatsChordal graphComputer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsContinued fractionWord (group theory)Computer Science::Formal Languages and Automata TheoryReal numberMathematics
researchProduct

An approximate Rolle's theorem for polynomials of degree four in a Hilbert space

2005

We show that the fourth degree polynomials that satisfy Rolle’s Theorem in the unit ball of a real Hilbert space are dense in the space of polynomials that vanish in the unit sphere. As a consequence, we obtain a sort of approximate Rolle’s Theorem for those polynomials.

Discrete mathematicsClassical orthogonal polynomialsPure mathematicsMacdonald polynomialsRolle's theoremDifference polynomialsGeneral MathematicsDiscrete orthogonal polynomialsOrthogonal polynomialsWilson polynomialsMathematicsMean value theoremPublications of the Research Institute for Mathematical Sciences
researchProduct

Some properties of vertex-oblique graphs

2016

The type t G ( v ) of a vertex v ? V ( G ) is the ordered degree-sequence ( d 1 , ? , d d G ( v ) ) of the vertices adjacent with v , where d 1 ? ? ? d d G ( v ) . A graph G is called vertex-oblique if it contains no two vertices of the same type. In this paper we show that for reals a , b the class of vertex-oblique graphs G for which | E ( G ) | ? a | V ( G ) | + b holds is finite when a ? 1 and infinite when a ? 2 . Apart from one missing interval, it solves the following problem posed by Schreyer et?al. (2007): How many graphs of bounded average degree are vertex-oblique? Furthermore we obtain the tight upper bound on the independence and clique numbers of vertex-oblique graphs as a fun…

Discrete mathematicsClique-sumNeighbourhood (graph theory)020206 networking & telecommunications0102 computer and information sciences02 engineering and technology01 natural sciencesTheoretical Computer ScienceMetric dimensionCombinatoricsIndifference graphNew digraph reconstruction conjecture010201 computation theory & mathematicsChordal graphIndependent set0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsBound graphirregular graphsindependence numbervertex-oblique graphslexicographic productMathematicsDiscrete Mathematics
researchProduct

Weighted Extrapolation Techniques for Finite Difference Methods on Complex Domains with Cartesian Meshes

2016

The design of numerical boundary conditions in high order schemes is a challenging problem that has been tackled in different ways depending on the nature of the problem and the scheme used to solve it numerically. In this paper we propose a technique to extrapolate the information from the computational domain to ghost cells for schemes with structured Cartesian Meshes on complex domains. This technique is based on the application of Lagrange interpolation with weighted filters for the detection of discontinuities that permits a data dependent extrapolation, with high order at smooth regions and essentially non oscillatory properties near discontinuities. This paper is a sequel of Baeza et…

Discrete mathematicsComputer scienceMathematicsofComputing_NUMERICALANALYSISExtrapolationFinite difference methodLagrange polynomialBoundary (topology)Classification of discontinuitieslaw.inventionsymbols.namesakelawsymbolsApplied mathematicsPolygon meshCartesian coordinate systemBoundary value problem
researchProduct

The Alternating BWT: an algorithmic perspective

2020

Abstract The Burrows-Wheeler Transform (BWT) is a word transformation introduced in 1994 for Data Compression. It has become a fundamental tool for designing self-indexing data structures, with important applications in several areas in science and engineering. The Alternating Burrows-Wheeler Transform (ABWT) is another transformation recently introduced in Gessel et al. (2012) [21] and studied in the field of Combinatorics on Words. It is analogous to the BWT, except that it uses an alternating lexicographical order instead of the usual one. Building on results in Giancarlo et al. (2018) [23] , where we have shown that BWT and ABWT are part of a larger class of reversible transformations, …

Discrete mathematicsFOS: Computer and information sciencesSettore INF/01 - InformaticaGeneral Computer ScienceBasis (linear algebra)Computer scienceAlternating Burrows-Wheeler TransformGalois wordRank-invertibilityField (mathematics)Data structureTheoretical Computer ScienceTransformation (function)Difference cover algorithmComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)Time complexityAlternating Burrows-Wheeler Transform; Difference cover algorithm; Galois word; Rank-invertibilityWord (computer architecture)Data compression
researchProduct