Search results for "SPAN"

showing 10 items of 2556 documents

International positioning of the Spanish psychology journals

2020

[ES]: Se presentan los resultados del análisis de la difusión y circulación del número de revistas españolas en diferentes bases de datos, nacionales e internacionales. Para ello se realiza un estudio de las revistas que contienen las principales bases de datos bibliográficas hasta el año 2017. El aumento de la presencia de revistas españolas de psicología en las diferentes bases de datos es un indicador que determina el crecimiento y la madurez de esta disciplina y aporta una visión interesante de la actividad científica en psicología y su situación en el contexto internacional. Se muestra que las políticas de estado y las campañas de posicionamiento de universidades, asociaciones y colegi…

Difusio&#769educationSpanish psychologyDifusiónScientific journalsDocumentationnDifusiónRevistas científicasDocumentaciónBF1-990Historia de la cienciaInternacionalizaciónDifusionHistory of scienceInternationalizationPsychologyhealth care economics and organizationsPsicología española
researchProduct

Chemosensory assessment of rival competitive ability and scent-mark function in a lizard, Podarcis hispanica

2007

Recent studies have stressed the role of scent marks as signals potentially mediating competitor assessment. According to this view, receivers may use scent marks to derive information about the costs of exploiting a given area, but few studies have directly addressed this hypothesis. One of its main predictions is that scent marks should reflect a signaller's competitive ability. We simulated the situation faced by an intruding male when entering the scent-marked territories of rival males of varying competitive ability to test predictions about the role of scent marks in a lizard, Podarcis hispanica. We report that males were attracted to areas marked by males of similar or higher competi…

Direct assessmentEcologyLizardResource qualityBiologyChemical communicationbiology.organism_classificationPodarcis hispanicabiology.animalSeasonal breederAnimal Science and ZoologySauriaResource holding potentialEcology Evolution Behavior and SystematicsAnimal Behaviour
researchProduct

Combinations of discourse markers with repairs and repetitions in English, French and Spanish

2020

Abstract Discourse markers have a central role in planning and repairing processes of speech production. They relate with fluency and disfluency phenomena such as pauses, repetitions and reformulations. Their polyfunctionality is challenging and few form-function mappings are stable cross-linguistically. This study combines a functional and a structural approach to discourse markers and their combination with and within repetitions and self-repairs in native English, French and Spanish, in order to establish the inter-relation between these three fluency-related devices and to find potentially universal patterns of use. Qualitative coding and quantitative analyses of categories of markers a…

Discourse markers050101 languages & linguisticsSpeech productionLinguistics and LanguageFrenchComputer scienceSpanish050105 experimental psychologyLanguage and LinguisticsLanguages and LiteraturesFluencyNative english/dk/atira/pure/subjectarea/asjc/3300/3310Artificial IntelligencePRAGMATIC MARKERSEnglishRepetitions0501 psychology and cognitive sciencesStructural approach/dk/atira/pure/subjectarea/asjc/1200/120305 social sciencesWELLLinguisticsDisfluency/dk/atira/pure/subjectarea/asjc/1700/1702WORDSDiscourse markerRepairCoding (social sciences)
researchProduct

On the low-dimensional Steiner minimum tree problem in Hamming metric

2013

While it is known that the d-dimensional Steiner minimum tree problem in Hamming metric is NP-complete if d is part of the input, it is an open question whether this also holds for fixed dimensions. In this paper, this question is answered by showing that the Steiner minimum tree problem in Hamming metric is already NP-complete in 3 dimensions. Furthermore, we show that, the minimum spanning tree gives a 2-2d approximation on the Steiner minimum tree for d>=2. Using this result, we analyse the so-called k-LCA and A"k approximation algorithms and show improved approximation guarantees for low dimensions.

Discrete mathematicsK-ary treeGeneral Computer ScienceMinimum spanning treek-minimum spanning treeSteiner tree problemTheoretical Computer ScienceCombinatoricssymbols.namesakeHamming graphsymbolsMetric treeGomory–Hu treeMathematicsVantage-point treeTheoretical Computer Science
researchProduct

Tree automata, tree decomposition and hyperedge replacement

2005

Recent results concerning efficient solvability of graph problems on graphs with bounded tree-width and decidability of graph properties for hyperedge-replacement graph grammars are systematised by showing how they can be derived from recognisability of corresponding tree classes by finite tree automata, using only well-known techniques from tree-automata theory.

Discrete mathematicsSPQR treeSpanning treeK-ary treeComputer scienceTree decompositionCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTree structureGomory–Hu treeTree automatonGraph propertyComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Estimating the length of minimal spanning trees in compression of files

1984

Compression of a formatted file by a minimal spanning tree (MST) is studied. Here the records of the file are considered as the nodes of a weighted undirected graph. Each record pair is connected in the graph and the corresponding arc is weighted by the sum of field lengths of those fields which differ in the two records. The actual compression is made by constructing an MST of the graph and by storing it in an economic way to preserve the information of the file. The length of the MST is a useful measure in the estimation of the power of the compression. In the paper we study upper bounds of this length, especially in the case where the field lengths of the different fields may vary. The u…

Discrete mathematicsSpanning treeComputer Networks and CommunicationsApplied MathematicsShortest-path treeMinimum spanning treeConnected dominating setCombinatoricsComputational MathematicsGraph (abstract data type)Undirected graphSoftwareMathematicsofComputing_DISCRETEMATHEMATICSMathematicsMinimum degree spanning treeBIT
researchProduct

Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks

2017

A minimum node weight spanning tree in a weighted, directed graph is a tree whose node with maximum out-weight is minimal among all spanning trees. This type of trees are important because they appear in the solutions of the maximum lifetime broadcasting problem in wireless sensor networks. In a complete graph build of N nodes there are NN-2 spanning trees and to find such trees it is necessary to perform more than O(NN-2) operations. In this paper we propose an algorithm for searching the minimum node weight spanning trees in the graph. In the proposed algorithm, instead of calculating the symbolic determinant of the generalized Laplacian matrix, numerical operations on its exponents are p…

Discrete mathematicsSpanning treeComputer sciencegraph theory010401 analytical chemistryDecision treeComplete graph020206 networking & telecommunications02 engineering and technologyDirected graphspanning trees01 natural sciences0104 chemical sciencessensor networksSearch algorithm0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)Algorithm designLaplacian matrixdata broadcasting2017 Twelfth International Conference on Digital Information Management (ICDIM)
researchProduct

The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs

2016

Nowadays there are many social media sites with a very large number of users. Users of social media sites and relationships between them can be modelled as a graph. Such graphs can be analysed using methods from social network analysis (SNA). Many measures used in SNA rely on computation of shortest paths between nodes of a graph. There are many shortest path algorithms, but the majority of them suits only for small graphs, or work only with road network graphs that are fundamentally different from social graphs. This paper describes an efficient shortest path searching algorithm suitable for large social graphs. The described algorithm extends the Atlas algorithm. The proposed algorithm so…

Discrete mathematicsta113Mathematical optimizationSpanning treesocial network analysisComputer scienceAtlas algorithm020206 networking & telecommunications02 engineering and technologyLongest path problemverkostoanalyysiWidest path problemOdnoklassnikiEuclidean shortest pathShortest Path Faster Algorithmsocial graph020204 information systemsShortest path problem0202 electrical engineering electronic engineering information engineeringK shortest path routingCanadian traveller problemshortest path problemMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

More on the Dimensionality of the GHQ-12: Competitive Confirmatory Models

2019

The General Health Questionnaire (GHQ) was designed to measure minor psychiatric morbidity by assessing normal ‘healthy’ functioning and the appearance of new, distressing symptoms. Among its versions, the 12-item is one of the most used. GHQ-12’s validity and reliability have been extensively tested in samples from different populations. In the Spanish version, studies have come to different conclusions, of one, two, and three-factor structures. This research aims to present additional evidence on the factorial validity of the Spanish version of the GHQ-12, using competitive confirmatory models. Three samples of workers (N= 525, 414 and 540) were used to test a set of substantive models pr…

Discriminant validityValiditySpanish version030227 psychiatryTest (assessment)03 medical and health sciences0302 clinical medicineInternational literature030212 general & internal medicineGeneral Health QuestionnaireSet (psychology)PsychologyGeneral PsychologyClinical psychologyCurse of dimensionalityUniversitas Psychologica
researchProduct

Las líderes silenciadas: el debate parlamentario sobre el sufragio femenino

2023

Durante los años de la II República, la mujer española experimenta una incipiente emancipación, sancionada por la Constitución de 1931, en la que se reconocía el voto de la mujer en condiciones de igualdad con el hombre (art. 36), aprobado el 1 de octubre. En el debate participaron dos de las tres diputadas de la Primera Legislatura de la República: Clara Campoamor (Partido Republicano Radical) y Victoria Kent (Partido Republicano Radical Socialista). Sus intervenciones, a favor y en contra respectivamente, constituyen el objeto de este trabajo. Para mi análisis, me he basado en el modelo de la lingüística pragmática de Fuentes Rodríguez y la organización en niveles de su análisis. Asimismo…

Discurso político discurso femenino estrategias persuasivas Segunda República Campoamor KentPolitical discourse feminine discourse persuasive strategies Spanish Second Republic Campoamor KentSettore L-LIN/07 - Lingua E Traduzione - Lingua Spagnola
researchProduct