Galerkin finite element method for incompressible thermofluid flows framed within the bond graph theory

In this paper a bond graph methodology is used to model incompressible fluid flows with viscous and thermal effects. The distinctive characteristic of these flows is the role of pressure, which does not behave as a state variable but as a function that must act in such a way that the resulting velocity field has divergence zero. Velocity and entropy per unit volume are used as independent variables for a single-phase, single-component flow. Time-dependent nodal values and interpolation functions are introduced to represent the flow field, from which nodal vectors of velocity and entropy are defined as state variables. The system for momentum and continuity equations is coincident with the one obtained by using the Galerkin method for the weak formulation of the problem in finite elements. The integral incompressibility constraint is derived based on the integral conservation of mechanical energy. The weak formulation for thermal energy equation is modeled with true bond graph elements in terms of nodal vectors of temperature and entropy rates, resulting a Petrov-Galerkin method. The resulting bond graph shows the coupling between mechanical and thermal energy domains through the viscous dissipation term. All kind of boundary conditions are handled consistently and can be represented as generalized effort or flow sources. A procedure for causality assignment is derived for the resulting graph, satisfying the Second principle of Thermodynamics. (C) 2007 Elsevier B.V. All rights reserved.

Skewness, splitting number and vertex deletion of some toroidal meshes

The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph can be obtained from G by the removal of sk(C) edges. The splitting number sp(G) of C is the smallest integer sp(G) >= 0 such that a planar graph can be obtained from G by sp(G) vertex splitting operations. The vertex deletion vd(G) of G is the smallest integer vd(G) >= 0 such that a planar graph can be obtained from G by the removal of vd(G) vertices. Regular toroidal meshes are popular topologies for the connection networks of SIMD parallel machines. The best known of these meshes is the rectangular toroidal mesh C(m) x C(n) for which is known the skewness, the splitting number and the vertex deletion. In this work we consider two related families: a triangulation Tc(m) x c(n) of C(m) x C(n) in the torus, and an hexagonal mesh Hc(m) x c(n), the dual of Tc(m) x c(n) in the torus. It is established that sp(Tc(m) x c(n)) = vd(Tc(m) x c(n) = sk(Hc(m) x c(n)) = sp(Hc(m) x c(n)) = vd(Hc(m) x c(n)) = min{m, n} and that sk(Tc(m) x c(n)) = 2 min {m, n}.

Puzzling challenges in contemporary neuroscience: Insights from complexity and emergence in epileptogenic circuits

The brain is a complex system that, in the normal condition, has emergent properties like those associated with activity-dependent plasticity in learning and memory, and in pathological situations, manifests abnormal long-term phenomena like the epilepsies. Data from our laboratory and from the literature were classified qualitatively as sources of complexity and emergent properties from behavior to electrophysiological, cellular, molecular, and computational levels. We used such models as brainstem-dependent acute audiogenic seizures and forebrain-dependent kindled audiogenic seizures. Additionally we used chemical OF electrical experimental models of temporal lobe epilepsy that induce status epilepticus with behavioral, anatomical, and molecular sequelae such as spontaneous recurrent seizures and long-term plastic changes. Current Computational neuroscience tools will help the interpretation. storage, and sharing of the exponential growth of information derived from those studies. These strategies are considered solutions to deal with the complexity of brain pathologies such as the epilepsies. (C) 2008 Elsevier Inc. All rights reserved.

Study of the relationship between roads, relief, land use, and natural vegetation in the Ibiuna Plateau - SP, focusing on landscape ecology

Roads facilitate access by deforestation agents, being relevant in studies approaching conservationist matters in rainforests. It is important to understand the relationship between road distribution, relief, land use, and forest coverage in order to evaluate where forests are more vulnerable. This study aimed at: 1) understanding the relationship between relief and density and road connectivity in three moments in time; and 2) evaluating the relationship between distance from roads and forest coverage, farmlands and rural and urban facilities in a fragmented Atlantic Forest landscape in three moments in time. Maps of roads, altitude, and land use and coverage were used. Chi-square tests showed that: 1) density and road connectivity did not present significant relationship with the relief; and 2) forest areas occupy areas distant from the roads, while farmlands and rural and urban facilities occupy areas nearer the roads. Roads and land use, regardless of relief, influence forest coverage distribution. Thus, we suggest that roads are taken into account in conservationist strategies and environmental planning.

Using gap-crossing capacity to evaluate functional connectivity of two Atlantic rainforest birds and their response to fragmentation

One of the main consequences of habitat loss and fragmentation is the increase in patch isolation and the consequent decrease in landscape connectivity. In this context, species persistence depends on their responses to this new landscape configuration, particularly on their capacity to move through the interhabitat matrix. Here, we aimed first to determine gap-crossing probabilities related to different gap widths for two forest birds (Thamnophilus caerulescens, Thamnophilidae, and Basileuterus culicivorus, Parulidae) from the Brazilian Atlantic rainforest. These values were defined with a playback technique and then used in analyses based on graph theory to determine functional connections among forest patches. Both species were capable of crossing forest gaps between patches, and these movements were related to gap width. The probability of crossing 40 m gaps was 50% for both species. This probability falls to 10% when the gaps are 60 m (for B. culicivorus) or 80 m (for T caerulescens). Actually, birds responded to stimulation about two times more distant inside forest trials (control) than in gap-crossing trials. Models that included gap-crossing capacity improved the explanatory power of species abundance variation in comparison to strictly structural models based merely on patch area and distance measurements. These results highlighted that even very simple functional connectivity measurements related to gap-crossing capacity can improve the understanding of the effect of habitat fragmentation on bird occurrence and abundance.

Texture analysis using graphs generated by deterministic partially self-avoiding walks

Texture is one of the most important visual attributes for image analysis. It has been widely used in image analysis and pattern recognition. A partially self-avoiding deterministic walk has recently been proposed as an approach for texture analysis with promising results. This approach uses walkers (called tourists) to exploit the gray scale image contexts in several levels. Here, we present an approach to generate graphs out of the trajectories produced by the tourist walks. The generated graphs embody important characteristics related to tourist transitivity in the image. Computed from these graphs, the statistical position (degree mean) and dispersion (entropy of two vertices with the same degree) measures are used as texture descriptors. A comparison with traditional texture analysis methods is performed to illustrate the high performance of this novel approach. (C) 2011 Elsevier Ltd. All rights reserved.

Multiple Pathways Analysis of Brain Functional Networks from EEG Signals: An Application to Real Data

In the present study, we propose a theoretical graph procedure to investigate multiple pathways in brain functional networks. By taking into account all the possible paths consisting of h links between the nodes pairs of the network, we measured the global network redundancy R (h) as the number of parallel paths and the global network permeability P (h) as the probability to get connected. We used this procedure to investigate the structural and dynamical changes in the cortical networks estimated from a dataset of high-resolution EEG signals in a group of spinal cord injured (SCI) patients during the attempt of foot movement. In the light of a statistical contrast with a healthy population, the permeability index P (h) of the SCI networks increased significantly (P < 0.01) in the Theta frequency band (3-6 Hz) for distances h ranging from 2 to 4. On the contrary, no significant differences were found between the two populations for the redundancy index R (h) . The most significant changes in the brain functional network of SCI patients occurred mainly in the lower spectral contents. These changes were related to an improved propagation of communication between the closest cortical areas rather than to a different level of redundancy. This evidence strengthens the hypothesis of the need for a higher functional interaction among the closest ROIs as a mechanism to compensate the lack of feedback from the peripheral nerves to the sensomotor areas.

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

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

ALGEBRAIC AND GEOMETRIC THEORY OF THE TOPOLOGICAL RING OF COLOMBEAU GENERALIZED FUNCTIONS

We continue the investigation of the algebraic and topological structure of the algebra of Colombeau generalized functions with the aim of building up the algebraic basis for the theory of these functions. This was started in a previous work of Aragona and Juriaans, where the algebraic and topological structure of the Colombeau generalized numbers were studied. Here, among other important things, we determine completely the minimal primes of (K) over bar and introduce several invariants of the ideals of 9(Q). The main tools we use are the algebraic results obtained by Aragona and Juriaans and the theory of differential calculus on generalized manifolds developed by Aragona and co-workers. The main achievement of the differential calculus is that all classical objects, such as distributions, become Cl-functions. Our purpose is to build an independent and intrinsic theory for Colombeau generalized functions and place them in a wider context.

Topological triangle characterization with application to object detection from images

A novel mathematical framework inspired on Morse Theory for topological triangle characterization in 2D meshes is introduced that is useful for applications involving the creation of mesh models of objects whose geometry is not known a priori. The framework guarantees a precise control of topological changes introduced as a result of triangle insertion/removal operations and enables the definition of intuitive high-level operators for managing the mesh while keeping its topological integrity. An application is described in the implementation of an innovative approach for the detection of 2D objects from images that integrates the topological control enabled by geometric modeling with traditional image processing techniques. (C) 2008 Published by Elsevier B.V.

Weak antilocalization in HgTe quantum wells near a topological transition

The anomalous alternating magnetoresistivity in HgTe quantum wells with thicknesses of 5.8 and 8.3 nm, i.e., near the transition from the direct band spectrum to an inverted spectrum, has been revealed and analyzed. It has been shown that the revealed anomalous alternating magnetoresistivity in wells with an inverted spectrum is well described by the theory developed by S.V. Iordanskii et al. [JETP Lett. 60, 206 (1994)] and W. Knap et al. [Phys. Rev. B 53, 3912 (1996)]. A detailed comparison of the experimental data with the theory indicates the presence of only the cubic term in the spin splitting of the electronic spectrum. The applicability conditions of the mentioned theory are not satisfied in a well with a direct gap and, for this reason, such a certain conclusion is impossible. The results indicate the existence of a strong spin-orbit interaction in symmetric HgTe quantum wells near the topological transition.

NIELSEN COINCIDENCE THEORY OF FIBRE-PRESERVING MAPS AND DOLD`S FIXED POINT INDEX

Let M -> B, N -> B be fibrations and f(1), f(2): M -> N be a pair of fibre-preserving maps. Using normal bordism techniques we define an invariant which is an obstruction to deforming the pair f(1), f(2) over B to a coincidence free pair of maps. In the special case where the two fibrations axe the same and one of the maps is the identity, a weak version of our omega-invariant turns out to equal Dold`s fixed point index of fibre-preserving maps. The concepts of Reidemeister classes and Nielsen coincidence classes over B are developed. As an illustration we compute e.g. the minimal number of coincidence components for all homotopy classes of maps between S(1)-bundles over S(1) as well as their Nielsen and Reidemeister numbers.

Equivariant Nielsen root theory for G-maps

Let X be a compact Hausdorff space, Y be a connected topological manifold, f : X -> Y be a map between closed manifolds and a is an element of Y. The vanishing of the Nielsen root number N(f; a) implies that f is homotopic to a root free map h, i.e., h similar to f and h(-1) (a) = empty set. In this paper, we prove an equivariant analog of this result for G-maps between G-spaces where G is a finite group. (C) 2010 Elsevier B.V. All rights reserved.