| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Spatial rotation and recognizing emotions : gender related differences in brain activity
Norbert Jaušovec, Ksenija Jaušovec, 2008, izvirni znanstveni članek

Opis: In three experiments, gender and ability (performance and emotional intelligence) related differences in brain activity - assessed with EEG methodology - while respondents were solving a spatial rotation tasks and identifying emotions in faces were investigated. The most robust gender related difference in brain activity was observed in the lower-2 alpha band. Males and females displayed an inverse IQ-activation relationship in just that domain in which they usually perform better: females in the emotional intelligence domain, and males in the visuospatial ability domain. A similar pattern of brain activity could also be observed for the male/female respondents with different levels of performance and emotional IQ. It was suggested that high ability representatives of both genders to some extent compensate for their inferior problem solving skills (males in emotional tasks and females in spatial rotation tasks) by increasing their level of attention.
Ključne besede: psychology, cognitive processes, emotional intelligence, EEG activities, problem complexity, brain, memory, spatial rotation, gender, event-related desynchronization
Objavljeno: 07.06.2012; Ogledov: 1147; Prenosov: 19
URL Povezava na celotno besedilo

2.
Strong edge geodetic problem in networks
Paul Manuel, Sandi Klavžar, Antony Xavier, Andrew Arokiaraj, Elizabeth Thomas, 2017, izvirni znanstveni članek

Opis: Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. Here we introduce a variation of the geodetic problem and call it strong edge geodetic problem. We illustrate how this problem is evolved from social transport networks. It is shown that the strong edge geodetic problem is NP-complete. We derive lower and upper bounds for the strong edge geodetic number and demonstrate that these bounds are sharp. We produce exact solutions for trees, block graphs, silicate networks and glued binary trees without randomization.
Ključne besede: geodetic problem, strong edge geodetic problem, computational complexity, transport networks
Objavljeno: 03.11.2017; Ogledov: 230; Prenosov: 91
.pdf Celotno besedilo (657,86 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.06 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici