Lightweight metallic matrix composites. Development of new composites material reinforced with carbon structures

Carbon nano/micro-structures used as fillers in metallic lightweight alloys matrix composites are receiving considerable attention in scientific research and industrial applications. Aluminum and magnesium are the most studied light metals used as matrices in metal composites materials principally for their low density (respectively 2.7 g/cm3 and 1.7 g/cm3) and low melting temperature (around 660 °C for both metals). A good interaction between matrix and fillers is the first step to obtain an increase in bulk properties; furthermore, the manufacturing procedure of the composite is fundamental in terms of quality of fillers dispersion. In this work the influence of surface modifications for three classes of carbon fillers for aluminum and magnesium alloy (AZ63) as matrices is studied. In particular, the selected fillers are short carbon micro fibres (SCMFs), carbon woven fabrics (CWF) and unidirectional yarn carbon fibres (UYFs). The surface modification was carried out by a direct coating of pure nickel on fibres. The electroless pure nickel plating was chosen as coating technique and the use of hydrazine as reducing agent has prevented the co-deposition of other elements (such as P or B). SEM and EDS analyses were performed to study the effect of surface modifications. The mechanical properties of manufactured composites were evaluated by four point flexural tests according to ASTM C1161 (room temperature). Results confirm improved interactions between matrix and fillers, and the specific interaction was studied for any chosen reinforcement

Clinical management of endoscopically resected pT1 colorectal cancer

Background Implementation of colorectal cancer (CRC) screening programs increases endoscopic resection of polyps with early invasive CRC (pT1). Risk of lymph node metastasis often leads to additional surgery, but despite guidelines, correct management remains unclear. Our aim that are diagnosed and treated endoscopically and this number is expected to increase [1,2].Methods We retrospectively reviewed patients undergoing endoscopic resection of pT1 CRC from 2006 to 2016. Clinical, endoscopic, surgical treatment, and follow-up data were collected and analyzed. Lesions were categorized according to endoscopic/histological risk-factors into low and high risk groups. Comorbidities were classified according to the Charlson comorbidity index (CCI). Surgical referral for each group was computed, and dissociation from current European CRC screening guidelines recorded. Multivariate analysis for factors affecting the post-endoscopic surgery referral was performed.Results Seventy-two patients with endoscopically resected pT1-CRC were included. Overall, 20 (27.7%) and 52 (72.3%) were classified as low and high risk, respectively. In the low risk group, 11 (55%) were referred to surgery, representing over-treatment compared with current guidelines. In the high risk group, nonsurgical endoscopic surveillance was performed in 20 (38.5%) cases, representing potential under-treatment. After a median follow-up of 30 (6-130) months, no patients developed tumor recurrence. At multivariate analysis, age (OR 1.21, 95 %CI 1.02 -1.42; P = 0.02) and CCI (OR 1.67, 95 %CI 1.12 -3.14; P= 0.04) were independent predictors for subsequent surgery.Conclusions A substantial rate of inappropriate post-endoscopic treatment of pT1-CRC was observed when compared with current guidelines. This was apparently related to an overestimation of patient-related factors rather than endoscopically or histologically related factors

Atrophy, oxidative switching and ultrastructural defects in skeletal muscle of the ataxia telangiectasia mouse model

Ataxia telangiectasia is a rare, multi system disease caused by ATM kinase deficiency. Atm-knockout mice recapitulate premature aging, immunodeficiency, cancer predisposition, growth retardation and motor defects, but not cerebellar neurodegeneration and ataxia. We explored whether Atm loss is responsible for skeletal muscle defects by investigating myofiber morphology, oxidative/glycolytic activity, myocyte ultrastructural architecture and neuromuscular junctions. Atm-knockout mice showed reduced muscle and fiber size. Atrophy, protein synthesis impairment and a switch from glycolytic to oxidative fibers were detected, along with an increase of in expression of slow and fast myosin types (Myh7, and Myh2 and Myh4, respectively) in tibialis anterior and solei muscles isolated from Atm-knockout mice. Transmission electron microscopy of tibialis anterior revealed misalignments of Z-lines and sarcomeres and mitochondria abnormalities that were associated with an increase in reactive oxygen species. Moreover, neuromuscular junctions appeared larger and more complex than those in Atm wild-type mice, but with preserved presynaptic terminals. In conclusion, we report for the first time that Atm-knockout mice have clear morphological skeletal muscle defects that will be relevant for the investigation of the oxidative stress response, motor alteration and the interplay with peripheral nervous system in ataxia telangiectasia

Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program

In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximised, that is, the largest possible global worth is achieved. When goods are indivisible, it is possible to use money compensation to perform a fair allocation taking into account the actual contribution of all agents to the social welfare. Coalitional games provide a formal mathematical framework to model such problems, in particular the Shapley value is a solution concept widely used for assigning worths to agents in a fair way. Unfortunately, computing this value is a #P-hard problem, so that applying this good theoretical notion is often quite difficult in real-world problems. We describe useful properties that allow us to greatly simplify the instances of allocation problems, without affecting the Shapley value of any player. Moreover, we propose algorithms for computing lower bounds and upper bounds of the Shapley value, which in some cases provide the exact result and that can be combined with approximation algorithms. The proposed techniques have been implemented and tested on a real-world application of allocation problems, namely, the Italian research assessment program known as VQR (Verifica della Qualità della Ricerca, or Research Quality Assessment)1. For the large university considered in the experiments, the problem involves thousands of agents and goods (here, researchers and their research products). The algorithms described in the paper are able to compute the Shapley value for most of those agents, and to get a good approximation of the Shapley value for all of the