Long-term oscillations in the sleep/wake cycle of infants

The development of circadian sleep-wakefulness rhythm was investigated by a longitudinal study of six normal infants. We propose an entropy based measure for the sleep/wake cycle fragmentation. Our results confirm that the sleep/wake cycle fragmentation and the sleep/wake ratio decrease, while the circadian power increases during the maturation process of infants. In addition to these expected linear trends in the variables devised to quantify sleep consolidation, circadian power and sleep/wake ratio, we found that they present infradian rhythms in the monthly range. (C) 2009 Elsevier B.V. All rights reserved.

Dispersion and uncertainty in multislit matter wave diffraction

We show that single and multislit experiments involving matter waves may be constructed to assess dispersively generated correlations between the position and momentum of a single free particle. These correlations give rise to position dependent phases which develop dynamically as a result of dispersion and may play an important role in the interference patterns. To the extent that initial transverse coherence is preserved throughout the proposed diffraction setup, such interference patterns are noticeably different from those of a classical dispersion free wave. (c) 2007 Published by Elsevier B.V.

Reentrant quantum Hall effect in bilayer system at high filling factors

We report on the measurements of the quantum Hall effect states in double quantum well structures at the filling factors v = 4N + 1 and 4N + 3, where N is the Landau index number, in the presence of the in-plane magnetic field. The quantum Hall states at these filling factors vanish and reappear several times. Repeated reentrance of the transport gap occurs due to the periodic vanishing of the tunneling amplitude in the presence of the in-plane field. When the gap vanishes, the transport becomes anisotropic. The anisotropy persist at half-odd filling factors, when bilayer quantum Hall states are recovered with increase of the tilt angle. (C) 2007 Elsevier B.V. All rights reserved.

Quantum spin tunneling of magnetization in small ferromagnetic particles

An approach is presented that can also account for the description of small ferromagnetic particle magnetization tunneling. An estimate of the saturation value of an external applied magnetic field along the easy axis is obtained. An analytic expression for the tunneling factor in the absence of an external magnetic field is deduced from the present approach that also allows one to obtain the crossover temperature characterizing the regime where tunneling is dominated by quantum effects. (C) 2009 Published by Elsevier B.V.

Thermoelectric transport properties through a T-shaped single quantum dot

We study the thermopower, thermal conductance, electric conductance and the thermoelectric figure of merit for a gate-defined T-shaped single quantum dot (QD). The QD is solved in the limit of strong Coulombian repulsion U -> infinity, inside the dot, and the quantum wire is modeled on a tight-binding linear chain. We employ the X-boson approach for the Anderson impurity model to describe the localized level within the quantum dot. Our results are in qualitative agreement with recent experimental reports and other theoretical researches for the case of a quantum dot embedded into a conduction channel, employing analogies between the two systems. The results for the thermopower sign as a function of the gate voltage (associated with the quantum dot energy) are in agreement with a recent experimental result obtained for a suspended quantum dot. The thermoelectric figure of merit times temperature results indicates that, at low temperatures and in the crossover between the intermediate valence and Kondo regimes, the system might have practical applicability in the development of thermoelectric devices. (c) 2010 Elsevier B.V. All rights reserved.

The web of connections between tourism companies: Structure and dynamics

Tourism destination networks are amongst the most complex dynamical systems, involving a myriad of human-made and natural resources. In this work we report a complex network-based systematic analysis of the Elba (Italy) tourism destination network, including the characterization of its structure in terms of several traditional measurements, the investigation of its modularity, as well as its comprehensive study in terms of the recently reported superedges approach. In particular, structural (the number of paths of distinct lengths between pairs of nodes, as well as the number of reachable companies) and dynamical features (transition probabilities and the inward/outward activations and accessibilities) are measured and analyzed, leading to a series of important findings related to the interactions between tourism companies. Among the several reported results, it is shown that the type and size of the Companies influence strongly their respective activations and accessibilities, while their geographical position does not seem to matter. It is also shown that the Elba tourism network is largely fragmented and heterogeneous, so that it could benefit from increased integration. (C) 2009 Elsevier B.V. All rights reserved.

On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance. (C) 2011 Elsevier B.V. All rights reserved.

Concentric characterization and classification of complex network nodes: Application to an institutional collaboration network

Differently from theoretical scale-free networks, most real networks present multi-scale behavior, with nodes structured in different types of functional groups and communities. While the majority of approaches for classification of nodes in a complex network has relied on local measurements of the topology/connectivity around each node, valuable information about node functionality can be obtained by concentric (or hierarchical) measurements. This paper extends previous methodologies based on concentric measurements, by studying the possibility of using agglomerative clustering methods, in order to obtain a set of functional groups of nodes, considering particular institutional collaboration network nodes, including various known communities (departments of the University of Sao Paulo). Among the interesting obtained findings, we emphasize the scale-free nature of the network obtained, as well as identification of different patterns of authorship emerging from different areas (e.g. human and exact sciences). Another interesting result concerns the relatively uniform distribution of hubs along concentric levels, contrariwise to the non-uniform pattern found in theoretical scale-free networks such as the BA model. (C) 2008 Elsevier B.V. All rights reserved.

Using metrics from complex networks to evaluate machine translation

Establishing metrics to assess machine translation (MT) systems automatically is now crucial owing to the widespread use of MT over the web. In this study we show that such evaluation can be done by modeling text as complex networks. Specifically, we extend our previous work by employing additional metrics of complex networks, whose results were used as input for machine learning methods and allowed MT texts of distinct qualities to be distinguished. Also shown is that the node-to-node mapping between source and target texts (English-Portuguese and Spanish-Portuguese pairs) can be improved by adding further hierarchical levels for the metrics out-degree, in-degree, hierarchical common degree, cluster coefficient, inter-ring degree, intra-ring degree and convergence ratio. The results presented here amount to a proof-of-principle that the possible capturing of a wider context with the hierarchical levels may be combined with machine learning methods to yield an approach for assessing the quality of MT systems. (C) 2010 Elsevier B.V. All rights reserved.

Estimating complex cortical networks via surface recordings-A critical note

We discuss potential caveats when estimating topologies of 3D brain networks from surface recordings. It is virtually impossible to record activity from all single neurons in the brain and one has to rely on techniques that measure average activity at sparsely located (non-invasive) recording sites Effects of this spatial sampling in relation to structural network measures like centrality and assortativity were analyzed using multivariate classifiers A simplified model of 3D brain connectivity incorporating both short- and long-range connections served for testing. To mimic M/EEG recordings we sampled this model via non-overlapping regions and weighted nodes and connections according to their proximity to the recording sites We used various complex network models for reference and tried to classify sampled versions of the ""brain-like"" network as one of these archetypes It was found that sampled networks may substantially deviate in topology from the respective original networks for small sample sizes For experimental studies this may imply that surface recordings can yield network structures that might not agree with its generating 3D network. (C) 2010 Elsevier Inc All rights reserved

The double Caldeira-Leggett model: Derivation and solutions of the master equations, reservoir-induced interactions and decoherence

In this paper we analyze the double Caldeira-Leggett model: the path integral approach to two interacting dissipative harmonic oscillators. Assuming a general form of the interaction between the oscillators, we consider two different situations: (i) when each oscillator is coupled to its own reservoir, and (ii) when both oscillators are coupled to a common reservoir. After deriving and solving the master equation for each case, we analyze the decoherence process of particular entanglements in the positional space of both oscillators. To analyze the decoherence mechanism we have derived a general decay function, for the off-diagonal peaks of the density matrix, which applies both to common and separate reservoirs. We have also identified the expected interaction between the two dissipative oscillators induced by their common reservoir. Such a reservoir-induced interaction, which gives rise to interesting collective damping effects, such as the emergence of relaxation- and decoherence-free subspaces, is shown to be blurred by the high-temperature regime considered in this study. However, we find that different interactions between the dissipative oscillators, described by rotating or counter-rotating terms, result in different decay rates for the interference terms of the density matrix. (C) 2010 Elsevier B.V. All rights reserved.

Characterizing topological and dynamical properties of complex networks without border effects

The properties of complex networks are highly Influenced by border effects frequently found as a consequence of the finite nature of real-world networks as well as network Sampling Therefore, it becomes critical to devise effective means for sound estimation of net work topological and dynamical properties will le avoiding these types of artifacts. In the current work, an algorithm for minimization of border effects is proposed and discussed, and its potential IS Illustrated with respect to two real-world networks. namely bone canals and air transportation (C) 2009 Elsevier B.V. All rights reserved.

Tunneling among rotation tori

We consider an integrable Hamiltonian system generated by the resonant normal form in order to study a particular mechanism of tunneling. We isolated near doublets of energy corresponding to rotation tori of the classical dynamics counterpart and the degeneracies breakdown is attributed to rotation-rotation tunneling. (C) 2008 Elsevier B.V. All rights reserved.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.

Geodesics and Almost Geodesic Cycles in Random Regular Graphs

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d(G)(u, v) is at least d(C)(u, v) - e(n). Let omega(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= log(d-1)log(d-1) n+omega(n) and vertical bar C vertical bar =2 log(d-1) n+O(omega(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distribution of the number of geodesics between two random vertices in this random graph. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 66: 115-136, 2011