A multidisciplinary consensus on the morphological and functional responses to immunotherapy treatment

The implementation of immunotherapy has radically changed the treatment of oncological patients. Currently, immunotherapy is indicated in the treatment of patients with head and neck tumors, melanoma, lung cancer, bladder tumors, colon cancer, cervical cancer, breast cancer, Merkel cell carcinoma, liver cancer, leukemia and lymphomas. However, its efficacy is restricted to a limited number of cases. The challenge is, therefore, to identify which subset of patients would benefit from immunotherapy. To this end, the establishment of immunotherapy response criteria and predictive and prognostic biomarkers is of paramount interest. In this report, a group of experts of the Spanish Society of Medical Oncology (SEOM), the Spanish Society of Medical Radiology (SERAM), and Spanish Society of Nuclear Medicine and Molecular Imaging (SEMNIM) provide an up-to-date review and a consensus guide on these issues

A Low-Cost Easy-Operation Hexapod Walking Machine

This paper presents the mechanical design of an hybrid hexapod walking machine that has been designed and built at LARM: Laboratory of Robotics and Mechatronics in Cassino. Basic characteristics are investigated in order to design a leg system with suitable low-cost modular components. Moreover, special care has been addressed in proposing an architecture that can be easily operated by a PLC with on-off logic. Experimental tests are reported in order to show feasibility and operational capability of proposed design

The Complexity of the Nucleolus in Compact Games

The nucleolus is a well-known solution concept for coalitional games to fairly distribute the total available worth among the players. The nucleolus is known to be NP-hard to compute over compact coalitional games, that is, over games whose functions specifying the worth associated with each coalition are encoded in terms of polynomially computable functions over combinatorial structures. In particular, hardness results have been exhibited over minimum spanning tree games, threshold games, and flow games. However, due to its intricate definition involving reasoning over exponentially many coalitions, a nontrivial upper bound on its complexity was missing in the literature and looked for. This article faces this question and precisely characterizes the complexity of the nucleolus, by exhibiting an upper bound that holds on any class of compact games, and by showing that this bound is tight even on the (structurally simple) class of graph games. The upper bound is established by proposing a variant of the standard linear-programming based algorithm for nucleolus computation and by studying a framework for reasoning about succinctly specified linear programs, which are contributions of interest in their own. The hardness result is based on an elaborate combinatorial reduction, which is conceptually relevant for it provides a "measure" of the computational cost to be paid for guaranteeing voluntary participation to the distribution process. In fact, the pre-nucleolus is known to be efficiently computable over graph games, with this solution concept being defined as the nucleolus but without guaranteeing that each player is granted with it at least the worth she can get alone, that is, without collaborating with the other players. Finally, this article identifies relevant tractable classes of coalitional games, based on the notion of type of a player. Indeed, in most applications where many players are involved, it is often the case that such players do belong in fact to a limited number of classes, which is known in advance and may be exploited for computing the nucleolus in a fast way.</p