Using siting algorithms in the design of marine reserve networks

Using benthic habitat data from the Florida Keys (USA), we demonstrate how siting algorithms can help identify potential networks of marine reserves that comprehensively represent target habitat types. We applied a flexible optimization tool-simulated annealing-to represent a fixed proportion of different marine habitat types within a geographic area. We investigated the relative influence of spatial information, planning-unit size, detail of habitat classification, and magnitude of the overall conservation goal on the resulting network scenarios. With this method, we were able to identify many adequate reserve systems that met the conservation goals, e.g., representing at least 20% of each conservation target (i.e., habitat type) while fulfilling the overall aim of minimizing the system area and perimeter. One of the most useful types of information provided by this siting algorithm comes from an irreplaceability analysis, which is a count of the number of, times unique planning units were included in reserve system scenarios. This analysis indicated that many different combinations of sites produced networks that met the conservation goals. While individual 1-km(2) areas were fairly interchangeable, the irreplaceability analysis highlighted larger areas within the planning region that were chosen consistently to meet the goals incorporated into the algorithm. Additionally, we found that reserve systems designed with a high degree of spatial clustering tended to have considerably less perimeter and larger overall areas in reserve-a configuration that may be preferable particularly for sociopolitical reasons. This exercise illustrates the value of using the simulated annealing algorithm to help site marine reserves: the approach makes efficient use of;available resources, can be used interactively by conservation decision makers, and offers biologically suitable alternative networks from which an effective system of marine reserves can be crafted.

A new method for analysing the equilibrium and time-dependent behaviour of Markovian models

Many large-scale stochastic systems, such as telecommunications networks, can be modelled using a continuous-time Markov chain. However, it is frequently the case that a satisfactory analysis of their time-dependent, or even equilibrium, behaviour is impossible. In this paper, we propose a new method of analyzing Markovian models, whereby the existing transition structure is replaced by a more amenable one. Using rates of transition given by the equilibrium expected rates of the corresponding transitions of the original chain, we are able to approximate its behaviour. We present two formulations of the idea of expected rates. The first provides a method for analysing time-dependent behaviour, while the second provides a highly accurate means of analysing equilibrium behaviour. We shall illustrate our approach with reference to a variety of models, giving particular attention to queueing and loss networks. (C) 2003 Elsevier Ltd. All rights reserved.

Product form approximations for highly linear loss networks with trunk reservation

Admission controls, such as trunk reservation, are often used in loss networks to optimise their performance. Since the numerical evaluation of performance measures is complex, much attention has been given to finding approximation methods. The Erlang Fixed-Point (EFP) approximation, which is based on an independent blocking assumption, has been used for networks both with and without controls. Several more elaborate approximation methods which account for dependencies in blocking behaviour have been developed for the uncontrolled setting. This paper is an exploratory investigation of extensions and synthesis of these methods to systems with controls, in particular, trunk reservation. In order to isolate the dependency factor, we restrict our attention to a highly linear network. We will compare the performance of the resulting approximations against the benchmark of the EFP approximation extended to the trunk reservation setting. By doing this, we seek to gain insight into the critical factors in constructing an effective approximation. (C) 2003 Elsevier Ltd. All rights reserved.

An evaluation of active lecturing in a computer networks course

The article describes an attempt to improve student learning outcomes in a computer networks course by making lectures more active learning experiences. Quick quizzes, group and individual exercises, the review of student questions, as well as multiple breaks, were incorporated into the weekly three-hour lectures. Student responses to the modified lectures was overwhelmingly positive: over 85% of respondents agreed that the lectures aided understanding, with large majorities of the respondents finding the individual activities useful to their learning. Although student examination performance improved over the previous year, performance on an examination question that was designed to examine deep understanding remained unchanged.

Towards the design of efficient nonbeacon-enabled ZigBee networks

This paper presents experimental results of the communication performance evaluation of a prototype ZigBee-based patient monitoring system commissioned in an in-patient floor of a Portuguese hospital (HPG – Hospital Privado de Guimar~aes). Besides, it revisits relevant problems that affect the performance of nonbeacon-enabled ZigBee networks. Initially, the presence of hidden-nodes and the impact of sensor node mobility are discussed. It was observed, for instance, that the message delivery ratio in a star network consisting of six wireless electrocardiogram sensor devices may decrease from 100% when no hidden-nodes are present to 83.96% when half of the sensor devices are unable to detect the transmissions made by the other half. An additional aspect which affects the communication reliability is a deadlock condition that can occur if routers are unable to process incoming packets during the backoff part of the CSMA-CA mechanism. A simple approach to increase the message delivery ratio in this case is proposed and its effectiveness is verified. The discussion and results presented in this paper aim to contribute to the design of efficient networks,and are valid to other scenarios and environments rather than hospitals.

Stress affects theta activity in limbic networks and impairs novelty-induced exploration and familiarization

Exposure to a novel environment triggers the response of several brain areas that regulate emotional behaviors. Here, we studied theta oscillations within the hippocampus (HPC)-amygdala (AMY)-medial prefrontal cortex (mPFC) network in exploration of a novel environment and subsequent familiarization through repeated exposures to that same environment; in addition, we assessed how concomitant stress exposure could disrupt this activity and impair both behavioral processes. Local field potentials were simultaneously recorded from dorsal and ventral hippocampus (dHPC and vHPC respectively), basolateral amygdala (BLA) and mPFC in freely behaving rats while they were exposed to a novel environment, then repeatedly re-exposed over the course of 3 weeks to that same environment and, finally, on re-exposure to a novel unfamiliar environment. A longitudinal analysis of theta activity within this circuit revealed a reduction of vHPC and BLA theta power and vHPC-BLA theta coherence through familiarization which was correlated with a return to normal exploratory behavior in control rats. In contrast, a persistent over-activation of the same brain regions was observed in stressed rats that displayed impairments in novel exploration and familiarization processes. Importantly, we show that stress also affected intra-hippocampal synchrony and heightened the coherence between vHPC and BLA. In summary, we demonstrate that modulatory theta activity in the aforementioned circuit, namely in the vHPC and BLA, is correlated with the expression of anxiety in novelty-induced exploration and familiarization in both normal and pathological conditions.

Automatic modeling of pectus excavatum corrective prosthesis using artificial neural networks

Pectus excavatum is the most common deformity of the thorax. Pre-operative diagnosis usually includes Computed Tomography (CT) to successfully employ a thoracic prosthesis for anterior chest wall remodeling. Aiming at the elimination of radiation exposure, this paper presents a novel methodology for the replacement of CT by a 3D laser scanner (radiation-free) for prosthesis modeling. The complete elimination of CT is based on an accurate determination of ribs position and prosthesis placement region through skin surface points. The developed solution resorts to a normalized and combined outcome of an artificial neural network (ANN) set. Each ANN model was trained with data vectors from 165 male patients and using soft tissue thicknesses (STT) comprising information from the skin and rib cage (automatically determined by image processing algorithms). Tests revealed that ribs position for prosthesis placement and modeling can be estimated with an average error of 5.0 ± 3.6 mm. One also showed that the ANN performance can be improved by introducing a manually determined initial STT value in the ANN normalization procedure (average error of 2.82 ± 0.76 mm). Such error range is well below current prosthesis manual modeling (approximately 11 mm), which can provide a valuable and radiation-free procedure for prosthesis personalization.

Automatic modeling of pectus excavatum corrective prosthesis using artificial neural networks

Pectus excavatum is the most common deformity of the thorax. Pre-operative diagnosis usually includes Computed Tomography (CT) to successfully employ a thoracic prosthesis for anterior chest wall remodeling. Aiming at the elimination of radiation exposure, this paper presents a novel methodology for the replacement of CT by a 3D laser scanner (radiation-free) for prosthesis modeling. The complete elimination of CT is based on an accurate determination of ribs position and prosthesis placement region through skin surface points. The developed solution resorts to a normalized and combined outcome of an artificial neural network (ANN) set. Each ANN model was trained with data vectors from 165 male patients and using soft tissue thicknesses (STT) comprising information from the skin and rib cage (automatically determined by image processing algorithms). Tests revealed that ribs position for prosthesis placement and modeling can be estimated with an average error of 5.0 ± 3.6 mm. One also showed that the ANN performance can be improved by introducing a manually determined initial STT value in the ANN normalization procedure (average error of 2.82 ± 0.76 mm). Such error range is well below current prosthesis manual modeling (approximately 11 mm), which can provide a valuable and radiation-free procedure for prosthesis personalization.

Artificial neural networks for automatic modelling of the pectus excavatum corrective prosthesis

Pectus excavatum is the most common deformity of the thorax and usually comprises Computed Tomography (CT) examination for pre-operative diagnosis. Aiming at the elimination of the high amounts of CT radiation exposure, this work presents a new methodology for the replacement of CT by a laser scanner (radiation-free) in the treatment of pectus excavatum using personally modeled prosthesis. The complete elimination of CT involves the determination of ribs external outline, at the maximum sternum depression point for prosthesis placement, based on chest wall skin surface information, acquired by a laser scanner. The developed solution resorts to artificial neural networks trained with data vectors from 165 patients. Scaled Conjugate Gradient, Levenberg-Marquardt, Resilient Back propagation and One Step Secant gradient learning algorithms were used. The training procedure was performed using the soft tissue thicknesses, determined using image processing techniques that automatically segment the skin and rib cage. The developed solution was then used to determine the ribs outline in data from 20 patient scanners. Tests revealed that ribs position can be estimated with an average error of about 6.82±5.7 mm for the left and right side of the patient. Such an error range is well below current prosthesis manual modeling (11.7±4.01 mm) even without CT imagiology, indicating a considerable step forward towards CT replacement by a 3D scanner for prosthesis personalization.

Ensuring dynamic strategic fit of firms that compete globally in alliances and networks: proposing the Global SNA - Strategic Network Analysis - framework

In order to sustain their competitive advantage in the current increasingly globalized and turbulent context, more and more firms are competing globally in alliances and networks that oblige them to adopt new managerial paradigms and tools. However, their strategic analyses rarely take into account the strategic implications of these alliances and networks, considering their global relational characteristics, admittedly because of a lack of adequate tools to do so. This paper contributes to research that seeks to fill this gap by proposing the Global Strategic Network Analysis - SNA - framework. Its purpose is to help firms that compete globally in alliances and networks to carry out their strategic assessments and decision-making with a view to ensuring dynamic strategic fit from both a global and relational perspective.

Albert-László Barabási, Linked – The New Science of Networks, Perseus, Cambridge, 2002. Duncan J. Watts, Six Degrees – The Science of a Connected Age, William Heinemann, Londres, 2003.

Com a criação da teoria das redes, assistiu-se nos últimos anos a uma revolução científica de carácter interdisciplinar Não é uma teoria inteiramente nova, tendo sido precedida pela criação por P. Erdvos, nos anos sessenta, da teoria dos grafos aleatórios. Esta última é uma teoria puramente matemática, donde termos escrito “grafo” em lugar de “rede”. Apenas recentemente podemos falar de uma efectiva teoria das redes reais, e isso devido ao abandono de algumas das ideias essenciais avançadas por Erdvos, em especial a ideia de partir de um conjunto previamente dado de nós, os quais de seguida vão sendo conectados aleatoriamente com probabilidade p. Este quadro geral começou a ser modificado pelo chamado modelo dos “mundo-pequenos” proposto em 1998 por Duncan Watts e Steve Strogatz, modificação que se tornou ainda mais radical quando, em 1999, Albert Barabási e colaboradores propuseram um modelo no qual os nós vão progressivamente nascendo e conectados por uma função de preferência: um nó conecta-se em proporção às ligações que os outros nós já possuem, pelo que quantas mais ligações um nó possui maior a probabilidade de receber ulteriores ligações.