894 resultados para Iconic visibility
Resumo:
Se analizan los patrones de publicación y citación en ciencias humanas y sociales en Scopus en el período 2003-2012, según el alcance geográfico de la investigación. Los resultados muestran que los temas de alcance nacional tienen un predominio del español como lengua de publicación y una marcada preferencia por la autoría única frente a los patrones observados en el grupo de otros temas, no situados geográficamente, donde el inglés y la colaboración institucional es más fuerte y está más consolidada. La citación no parece estar determinada solo por el alcance geográfico de las investigaciones, sino también por el idioma de publicación, la coautoría y los perfiles de las revistas donde se publica. Se espera que los resultados den lugar a una reflexión constructiva sobre la cultura investigadora y editorial y que sean útiles como referencia para establecer criterios de evaluación en las comisiones evaluadoras y las políticas editoriales a nivel nacional
Resumo:
Se analizan los patrones de publicación y citación en ciencias humanas y sociales en Scopus en el período 2003-2012, según el alcance geográfico de la investigación. Los resultados muestran que los temas de alcance nacional tienen un predominio del español como lengua de publicación y una marcada preferencia por la autoría única frente a los patrones observados en el grupo de otros temas, no situados geográficamente, donde el inglés y la colaboración institucional es más fuerte y está más consolidada. La citación no parece estar determinada solo por el alcance geográfico de las investigaciones, sino también por el idioma de publicación, la coautoría y los perfiles de las revistas donde se publica. Se espera que los resultados den lugar a una reflexión constructiva sobre la cultura investigadora y editorial y que sean útiles como referencia para establecer criterios de evaluación en las comisiones evaluadoras y las políticas editoriales a nivel nacional
Resumo:
Se analizan los patrones de publicación y citación en ciencias humanas y sociales en Scopus en el período 2003-2012, según el alcance geográfico de la investigación. Los resultados muestran que los temas de alcance nacional tienen un predominio del español como lengua de publicación y una marcada preferencia por la autoría única frente a los patrones observados en el grupo de otros temas, no situados geográficamente, donde el inglés y la colaboración institucional es más fuerte y está más consolidada. La citación no parece estar determinada solo por el alcance geográfico de las investigaciones, sino también por el idioma de publicación, la coautoría y los perfiles de las revistas donde se publica. Se espera que los resultados den lugar a una reflexión constructiva sobre la cultura investigadora y editorial y que sean útiles como referencia para establecer criterios de evaluación en las comisiones evaluadoras y las políticas editoriales a nivel nacional
Resumo:
Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown [B. Luque et al., PLoS ONE 6, 9 (2011)] that dynamical systems can be studied from a novel perspective via the use of this method. Specifically, the period-doubling and band-splitting attractor cascades that characterize unimodal maps transform into families of graphs that turn out to be independent of map nonlinearity or other particulars. Here, we provide an in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree distributions, mean distances, clustering coefficients, etc., associated to the bifurcation cascades and their accumulation points. We describe how the resultant families of graphs can be framed into a renormalization group scheme in which fixed-point graphs reveal their scaling properties. These fixed points are then re-derived from an entropy optimization process defined for the graph sets, confirming a suggested connection between renormalization group and entropy optimization. Finally, we provide analytical and numerical results for the graph entropy and show that it emulates the Lyapunov exponent of the map independently of its sign.
Resumo:
We propose a method to measure real-valued time series irreversibility which combines two different tools: the horizontal visibility algorithm and the Kullback-Leibler divergence. This method maps a time series to a directed network according to a geometric criterion. The degree of irreversibility of the series is then estimated by the Kullback-Leibler divergence (i.e. the distinguishability) between the in and out degree distributions of the associated graph. The method is computationally efficient and does not require any ad hoc symbolization process. We find that the method correctly distinguishes between reversible and irreversible stationary time series, including analytical and numerical studies of its performance for: (i) reversible stochastic processes (uncorrelated and Gaussian linearly correlated), (ii) irreversible stochastic processes (a discrete flashing ratchet in an asymmetric potential), (iii) reversible (conservative) and irreversible (dissipative) chaotic maps, and (iv) dissipative chaotic maps in the presence of noise. Two alternative graph functionals, the degree and the degree-degree distributions, can be used as the Kullback-Leibler divergence argument. The former is simpler and more intuitive and can be used as a benchmark, but in the case of an irreversible process with null net current, the degree-degree distribution has to be considered to identify the irreversible nature of the series
Resumo:
The horizontal visibility algorithm was recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore such graph theoretical characterization is in principle possible. However, both the mathematical grounding of this promising theory and its applications are in its infancy. Following this line, here we address the question of detecting hidden periodicity in series polluted with a certain amount of noise. We first put forward some generic properties of horizontal visibility graphs which allow us to define a (graph theoretical) noise reduction filter. Accordingly, we evaluate its performance for the task of calculating the period of noisy periodic signals, and compare our results with standard time domain (autocorrelation) methods. Finally, potentials, limitations and applications are discussed.
Resumo:
The type-I intermittency route to (or out of) chaos is investigated within the horizontal visibility (HV) graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct their associatedHVgraphs.We showhowthe alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure. Accordingly, we derive a phenomenological theory that predicts quantitative values for several network parameters. In particular, we predict that the characteristic power-law scaling of the mean length of laminar trend sizes is fully inherited by the variance of the graph degree distribution, in good agreement with the numerics. We also report numerical evidence on how the characteristic power-law scaling of the Lyapunov exponent as a function of the distance to the tangent bifurcation is inherited in the graph by an analogous scaling of block entropy functionals defined on the graph. Furthermore, we are able to recast the full set of HV graphs generated by intermittent dynamics into a renormalization-group framework, where the fixed points of its graph-theoretical renormalization-group flow account for the different types of dynamics.We also establish that the nontrivial fixed point of this flow coincides with the tangency condition and that the corresponding invariant graph exhibits extremal entropic properties.
Resumo:
When I lncluded the then very young Emilio Tunon ln the book Young Spanish Architecture twenty years ago, he had just built a beautlful chapel in Alcala. Some people criticized this vote of confidence, as they saw it as a bit premature.
Resumo:
Si no tenemos en cuenta posibles procesos subyacentes con significado físico, químico, económico, etc., podemos considerar una serie temporal como un mero conjunto ordenado de valores y jugar con él algún inocente juego matemático como transformar dicho conjunto en otro objeto con la ayuda de una operación matemática para ver qué sucede: qué propiedades del conjunto original se conservan, cuáles se transforman y cómo, qué podemos decir de alguna de las dos representaciones matemáticas del objeto con sólo atender a la otra... Este ejercicio sería de cierto interés matemático por sí solo. Ocurre, además, que las series temporales son un método universal de extraer información de sistemas dinámicos en cualquier campo de la ciencia. Esto hace ganar un inesperado interés práctico al juego matemático anteriormente descrito, ya que abre la posibilidad de analizar las series temporales (vistas ahora como evolución temporal de procesos dinámicos) desde una nueva perspectiva. Hemos para esto de asumir la hipótesis de que la información codificada en la serie original se conserva de algún modo en la transformación (al menos una parte de ella). El interés resulta completo cuando la nueva representación del objeto pertencece a un campo de la matemáticas relativamente maduro, en el cual la información codificada en dicha representación puede ser descodificada y procesada de manera efectiva. ABSTRACT Disregarding any underlying process (and therefore any physical, chemical, economical or whichever meaning of its mere numeric values), we can consider a time series just as an ordered set of values and play the naive mathematical game of turning this set into a different mathematical object with the aids of an abstract mapping, and see what happens: which properties of the original set are conserved, which are transformed and how, what can we say about one of the mathematical representations just by looking at the other... This exercise is of mathematical interest by itself. In addition, it turns out that time series or signals is a universal method of extracting information from dynamical systems in any field of science. Therefore, the preceding mathematical game gains some unexpected practical interest as it opens the possibility of analyzing a time series (i.e. the outcome of a dynamical process) from an alternative angle. Of course, the information stored in the original time series should be somehow conserved in the mapping. The motivation is completed when the new representation belongs to a relatively mature mathematical field, where information encoded in such a representation can be effectively disentangled and processed. This is, in a nutshell, a first motivation to map time series into networks.
Resumo:
For suitable illumination and observation conditions, sparkles may be observed in metallic coatings. The visibility of these sparkles depends critically on their intensity, and on the paint medium surrounding the metallic flakes. Based on previous perception studies from other disciplines, we derive equations for the threshold for sparkles to be visible. The resulting equations show how the visibility of sparkles varies with the luminosity and distance of the light source, the diameter of the metallic flakes, and the reflection properties of the paint medium. The predictions are confirmed by common observations on metallic sparkle. For example, under appropriate conditions even metallic flakes as small as 1 μm diameter may be visible as sparkle, whereas under intense spot light the finer grades of metallic coatings do not show sparkle. We show that in direct sunlight, dark coarse metallic coatings show sparkles that are brighter than the brightest stars and planets in the night sky. Finally, we give equations to predict the number of visually distinguishable flake intensities, depending on local conditions. These equations are confirmed by previous results. Several practical examples for applying the equations derived in this article are provided.
Resumo:
This study investigates decision making in mental health care. Specifically, it compares the diagnostic decision outcomes (i.e., the qualityof diagnoses) and the diagnostic decision process (i.e., pre-decisional information acquisition patterns) of novice and experienced clinicalpsychologists. Participants’ eye movements were recorded while they completed diagnostic tasks, classifying mental disorders. In line withprevious research, our findings indicate that diagnosticians’ performance is not related to their clinical experience. Eye-tracking data pro-vide corroborative evidence for this result from the process perspective: experience does not predict changes in cue inspection patterns. Forfuture research into expertise in this domain, it is advisable to track individual differences between clinicians rather than study differenceson the group level.
Resumo:
National Highway Traffic Safety Administration, Washington, D.C.
Resumo:
Texas Department of Transportation, Austin