Critical Nodes In Directed Networks

Critical nodes—or “middlemen”—have an essential place in both social and economic networks when considering the flow of information and trade. This paper extends the concept of critical nodes to directed networks and in doing so identify strong and weak middlemen.
Node contestability is introduced as a form of competition in networks; a duality between uncontested intermediaries and middlemen is established. The brokerage power of middlemen is formally expressed and a general algorithm is constructed to measure the brokerage power of each node from the networks adjacency matrix. Augmentations of the brokerage power measure are discussed to encapsulate relevant centrality measures. Furthermore, we extend these notions and provide measures of the competitiveness of a network.
We use these concepts to identify and measure middlemen in two empirical socio-economic networks, the elite marriage network of Renaissance Florence and Krackhardt’s advice net- work.

Carbon Sink Conservation and Global Justice: Benefiting, Free Riding and Non-Compliance

It is often assumed that in order to avoid the most severe consequences of global anthropogenic climate change we have to preserve our existing carbon sinks, such as for instance tropical forests. Global carbon sink conservation raises a host of normative issues, though, since it is debatable who should pay the costs of carbon sink conservation, who has the duty to protect which sinks, and how far the duty to conserve one’s carbon sinks actually extends, especially if it conflicts with other duties one might have. According to some, forested states like Ecuador have a duty to preserve their tropical forests while the rich states of the global North have a duty of fairness to compensate states like Ecuador for the costs they incur. My aim in this paper is to critically analyse this standard line of argument and to criticise its validity both internally (i.e. with regard to its normative conclusion based on its premises) and externally (i.e. with regard to the argument’s underlying assumptions and its lack of contextualisation). As I will argue, the duty to conserve one’s forests is only a particular instantiation of a wider, more general duty to contribute towards global climate justice for which the context in which one operates (e.g. whether other agents are complying with their duties of global climate justice or not) matters significantly.

Communication between nodes for autonomic and distributed management

Over the last decade, the most widespread approaches for traditional management were based on the Simple Network Management Protocol (SNMP) or Common Management Information Protocol (CMIP). However, they both have several problems in terms of scalability, due to their centralization characteristics. Although the distributed management approaches exhibit better performance in terms of scalability, they still underperform regarding communication costs, autonomy, extensibility, exibility, robustness, and cooperation between network nodes. The cooperation between network nodes normally requires excessive overheads for synchronization and dissemination of management information in the network. For emerging dynamic and large-scale networking environments, as envisioned in Next Generation Networks (NGNs), exponential growth in the number of network devices and mobile communications and application demands is expected. Thus, a high degree of management automation is an important requirement, along with new mechanisms that promote it optimally and e ciently, taking into account the need for high cooperation between the nodes. Current approaches for self and autonomic management allow the network administrator to manage large areas, performing fast reaction and e ciently facing unexpected problems. The management functionalities should be delegated to a self-organized plane operating within the network, that decrease the network complexity and the control information ow, as opposed to centralized or external servers. This Thesis aims to propose and develop a communication framework for distributed network management which integrates a set of mechanisms for initial communication, exchange of management information, network (re) organization and data dissemination, attempting to meet the autonomic and distributed management requirements posed by NGNs. The mechanisms are lightweight and portable, and they can operate in di erent hardware architectures and include all the requirements to maintain the basis for an e cient communication between nodes in order to ensure autonomic network management. Moreover, those mechanisms were explored in diverse network conditions and events, such as device and link errors, di erent tra c/network loads and requirements. The results obtained through simulation and real experimentation show that the proposed mechanisms provide a lower convergence time, smaller overhead impact in the network, faster dissemination of management information, increase stability and quality of the nodes associations, and enable the support for e cient data information delivery in comparison to the base mechanisms analyzed. Finally, all mechanisms for communication between nodes proposed in this Thesis, that support and distribute the management information and network control functionalities, were devised and developed to operate in completely decentralized scenarios.

Real-time communications over cluster-tree sensor networks with mobile sink behaviour

Modelling the fundamental performance limits of wireless sensor networks (WSNs) is of paramount importance to understand the behaviour of WSN under worst case conditions and to make the appropriate design choices. In that direction, this paper contributes with a methodology for modelling cluster tree WSNs with a mobile sink. We propose closed form recurrent expressions for computing the worst case end to end delays, buffering and bandwidth requirements across any source-destination path in the cluster tree assuming error free channel. We show how to apply our theoretical results to the specific case of IEEE 802.15.4/ZigBee WSNs. Finally, we demonstrate the validity and analyze the accuracy of our methodology through a comprehensive experimental study, therefore validating the theoretical results through experimentation.

Trapping of naive lymphocytes triggers rapid growth and remodeling of the fibroblast network in reactive murine lymph nodes.

Adaptive immunity is initiated in T-cell zones of secondary lymphoid organs. These zones are organized in a rigid 3D network of fibroblastic reticular cells (FRCs) that are a rich cytokine source. In response to lymph-borne antigens, draining lymph nodes (LNs) expand several folds in size, but the fate and role of the FRC network during immune response is not fully understood. Here we show that T-cell responses are accompanied by the rapid activation and growth of FRCs, leading to an expanded but similarly organized network of T-zone FRCs that maintains its vital function for lymphocyte trafficking and survival. In addition, new FRC-rich environments were observed in the expanded medullary cords. FRCs are activated within hours after the onset of inflammation in the periphery. Surprisingly, FRC expansion depends mainly on trapping of naïve lymphocytes that is induced by both migratory and resident dendritic cells. Inflammatory signals are not required as homeostatic T-cell proliferation was sufficient to trigger FRC expansion. Activated lymphocytes are also dispensable for this process, but can enhance the later growth phase. Thus, this study documents the surprising plasticity as well as the complex regulation of FRC networks allowing the rapid LN hyperplasia that is critical for mounting efficient adaptive immunity.

Sentinel nodes and and non sentinel nodes evaluation in T1 melanoma patients

Objective: Because increasing incidence of melanoma and dermatologicsystematic screening, more early superficial melanoma are discovered in Switzerland. Patients with Breslow index more than 1 mm. (T2) represent the classical indication to sentinel node (SN). It has been shown that some ''risky'' T1 patients may have micrometastatic SNs. T1b melanoma are defined by presence of ulceration,Clark IV (ormore) level, signs of melanoma regression (old classification) and high mitotic index (new TNM). The objective of the present study was to review the incidence and risk for metastatic SN in T1 patients and if radical lymph node dissection is justified (evaluation of non sentinel node [NSN]) compared with T2-4 patients.Methods: Retrospective review of a cohort of all patients operated for T1-4 clinically N0 and radiological M0 melanoma patients between 1997 and 2010 in a reference melanoma centre.Results: 599 melanoma patients have been operated with SNdissection. There were 98 T1 patients. Metastatic SN were observed in 2 out of 24 T1a patients and in 5 out of 74 T1b patients. This means overall 7% T1 patients were at least N1a. None of SN+ T1a or T1b patients had metastatic NSN after radical lymph node dissections (RLND). During the follow-up (1998-2010), no patients presented with locoregional disease and only one T1a N1a patient died of metastatic melanoma. These results contrast with the other 591 T2-4 patients: 150 were SN+ (25%) and among them 23 had metastatic NSN after RLND. Overall 23/136 (17%) had metastatic NSN.Conclusion: T1 melanoma patients are at significant risk (7%) for metastatic lymph node in the corresponding drainage basin. T1a and T1b did not differ regarding this risk. However, the benefit for a RLND must be reevaluated regarding surgical morbidity, because none of T1 patients had metastatic NSN.

Detection of micrometastases in sentinel lymph nodes from melanoma patients: direct comparison of multimarker molecular and immunopathological methods.

The technique of sentinel lymph node (SLN) dissection is a reliable predictor of metastatic disease in the lymphatic basin draining the primary melanoma. Reverse transcription-polymerase chain reaction (RT-PCR) is emerging as a highly sensitive technique to detect micrometastases in SLNs, but its specificity has been questioned. A prospective SLN study in melanoma patients was undertaken to compare in detail immunopathological versus molecular detection methods. Sentinel lymphadenectomy was performed on 57 patients, with a total of 71 SLNs analysed. SLNs were cut in slices, which were alternatively subjected to parallel multimarker analysis by microscopy (haematoxylin and eosin and immunohistochemistry for HMB-45, S100, tyrosinase and Melan-A/MART-1) and RT-PCR (for tyrosinase and Melan-A/MART-1). Metastases were detected by both methods in 23% of the SLNs (28% of the patients). The combined use of Melan-A/MART-1 and tyrosinase amplification increased the sensitivity of PCR detection of microscopically proven micrometastases. Of the 55 immunopathologically negative SLNs, 25 were found to be positive on RT-PCR. Notably, eight of these SLNs contained naevi, all of which were positive for tyrosinase and/or Melan-A/MART-1, as detected at both mRNA and protein level. The remaining 41% of the SLNs were negative on both immunohistochemistry and RT-PCR. Analysis of a series of adjacent non-SLNs by RT-PCR confirmed the concept of orderly progression of metastasis. Clinical follow-up showed disease recurrence in 12% of the RT-PCR-positive immunopathology-negative SLNs, indicating that even an extensive immunohistochemical analysis may underestimate the presence of micrometastases. However, molecular analyses, albeit more sensitive, need to be further improved in order to attain acceptable specificity before they can be applied diagnostically.

Patterns of care in recurrent glioblastoma in Switzerland: a multicentre national approach based on diagnostic nodes.

Despite moderate improvements in outcome of glioblastoma after first-line treatment with chemoradiation recent clinical trials failed to improve the prognosis of recurrent glioblastoma. In the absence of a standard of care we aimed to investigate institutional treatment strategies to identify similarities and differences in the pattern of care for recurrent glioblastoma. We investigated re-treatment criteria and therapeutic pathways for recurrent glioblastoma of eight neuro-oncology centres in Switzerland having an established multidisciplinary tumour-board conference. Decision algorithms, differences and consensus were analysed using the objective consensus methodology. A total of 16 different treatment recommendations were identified based on combinations of eight different decision criteria. The set of criteria implemented as well as the set of treatments offered was different in each centre. For specific situations, up to 6 different treatment recommendations were provided by the eight centres. The only wide-range consensus identified was to offer best supportive care to unfit patients. A majority recommendation was identified for non-operable large early recurrence with unmethylated MGMT promoter status in the fit patients: here bevacizumab was offered. In fit patients with late recurrent non-operable MGMT promoter methylated glioblastoma temozolomide was recommended by most. No other majority recommendations were present. In the absence of strong evidence we identified few consensus recommendations in the treatment of recurrent glioblastoma. This contrasts the limited availability of single drugs and treatment modalities. Clinical situations of greatest heterogeneity may be suitable to be addressed in clinical trials and second opinion referrals are likely to yield diverging recommendations.

RMAC-M: Extending the R-MAC Protocol for an Energy Efficient, Delay Tolerant Underwater Acoustic Sensor Network application with a mobile data mule node

One of the major applications of underwater acoustic sensor networks (UWASN) is ocean environment monitoring. Employing data mules is an energy efficient way of data collection from the underwater sensor nodes in such a network. A data mule node such as an autonomous underwater vehicle (AUV) periodically visits the stationary nodes to download data. By conserving the power required for data transmission over long distances to a remote data sink, this approach extends the network life time. In this paper we propose a new MAC protocol to support a single mobile data mule node to collect the data sensed by the sensor nodes in periodic runs through the network. In this approach, the nodes need to perform only short distance, single hop transmission to the data mule. The protocol design discussed in this paper is motivated to support such an application. The proposed protocol is a hybrid protocol, which employs a combination of schedule based access among the stationary nodes along with handshake based access to support mobile data mules. The new protocol, RMAC-M is developed as an extension to the energy efficient MAC protocol R-MAC by extending the slot time of R-MAC to include a contention part for a hand shake based data transfer. The mobile node makes use of a beacon to signal its presence to all the nearby nodes, which can then hand-shake with the mobile node for data transfer. Simulation results show that the new protocol provides efficient support for a mobile data mule node while preserving the advantages of R-MAC such as energy efficiency and fairness.

Distributed space-time block coding for 3 and 4 relay nodes: Imperfect synchronisation and a solution

Most research on distributed space time block coding (STBC) has so far focused on the case of 2 relay nodes and assumed that the relay nodes are perfectly synchronised at the symbol level. By applying STBC to 3-or 4-relay node systems, this paper shows that imperfect synchronisation causes significant performance degradation to the conventional detector. To this end, we propose a new STBC detection solution based on the principle of parallel interference cancellation (PIC). The PIC detector is moderate in computational complexity but is very effective in suppressing the impact of imperfect synchronisation.

Orthogonal forward selection for constructing the radial basis function network with tunable nodes

An orthogonal forward selection (OFS) algorithm based on the leave-one-out (LOO) criterion is proposed for the construction of radial basis function (RBF) networks with tunable nodes. This OFS-LOO algorithm is computationally efficient and is capable of identifying parsimonious RBF networks that generalise well. Moreover, the proposed algorithm is fully automatic and the user does not need to specify a termination criterion for the construction process.

Pancyclicity of Mobius cubes with faulty nodes

An interconnection network with n nodes is four-pancyclic if it contains a cycle of length l for each integer l with 4 <= l <= n. An interconnection network is fault-tolerant four-pancyclic if the surviving network is four-pancyclic in the presence of faults. The fault-tolerant four-pancyclicity of interconnection networks is a desired property because many classical parallel algorithms can be mapped onto such networks in a communication-efficient fashion, even in the presence of failing nodes or edges. Due to some attractive properties as compared with its hypercube counterpart of the same size, the Mobius cube has been proposed as a promising candidate for interconnection topology. Hsieh and Chen [S.Y. Hsieh, C.H. Chen, Pancyclicity on Mobius cubes with maximal edge faults, Parallel Computing, 30(3) (2004) 407-421.] showed that an n-dimensional Mobius cube is four-pancyclic in the presence of up to n-2 faulty edges. In this paper, we show that an n-dimensional Mobius cube is four-pancyclic in the presence of up to n-2 faulty nodes. The obtained result is optimal in that, if n-1 nodes are removed, the surviving network may not be four-pancyclic. (C) 2005 Elsevier B.V. All rights reserved.