Parties of reputation systems rate each other and use ratings to compute reputation scores that drive their interactions. When deciding which reputation model to deploy in a network environment, it is important to find the most suitable model and to determine its right initial configuration. This calls for an engineering approach for describing, implementing and evaluating reputation systems while taking into account specific aspects of both the reputation systems and the networked environment where they will run.

Network-based ranking methods (e.g. centrality analysis) have found extensive use in systems medicine for the prediction of essential proteins, for the prioritization of drug targets candidates in the treatment of several pathologies and in biomarker discovery, and for human disease genes identification. Here we propose to use critical nodes as defined by the Critical Node Problem for the analysis of key physiological and pathophysiological signaling pathways, as target candidates for treatment and management of several cancer types, neurologic and inflammatory dysfunctions, among others.

Background. Type 2 diabetes (T2D) is a chronic metabolic disease potentially leading to serious widespread tissue damage. Human organism develops T2D when the glucose-insulin control is broken for reasons that are not fully understood but have been demonstrated to be linked to the emergence of a chronic inflammation. Indeed such low-level chronic inflammation affects the pancreatic production of insulin and triggers the development of insulin resistance, eventually leading to an impaired control of the blood glucose concentration.

In this paper we describe how to swap two 2 × 2 blocks in a real Schur form and a generalized real Schur form. We pay special attention to the numerical stability of the method. We also illustrate the stability of our approach by a series of numerical tests.

Tor hidden services allow offering and accessing various Internet resources while guaranteeing a high degree of provider and user anonymity. So far, most research work on the Tor network aimed at discovering protocol vulnerabilities to de-anonymize users and services. Other work aimed at estimating the number of available hidden services and classifying them. Something that still remains largely unknown is the structure of the graph defined by the network of Tor services.

In transportation networks with limited capacities and travel times on the arcs, a class of problems attracting a growing scientific interest is represented by the optimal routing and scheduling of given amounts of flow to be transshipped from the origin points to the specific destinations in minimum time. Such problems are of particular concern to emergency transportation where evacuation plans seek to minimize the time evacuees need to clear the affected area and reach the safe zones.

The popularity of the cloud computing paradigm is opening new opportunities for collaborative computing. In this paper we tackle a fundamental problem in open-ended cloud-based distributed computing platforms, i.e., the quest for potential collaborators. We assume that cloud participants are willing to share their computational resources for shared distributed computing problems, but they are not willing to disclose the details of their resources. Lacking such information, we advocate to rely on reputation scores obtained by evaluating the interactions among participants.