BackgroundThe prognostic value of preoperative controlling nutritional status (CONUT) has been reported in many malignancies. In present study, we aimed to clarify the prognostic impact of CONUT in gastric cancer (GC) receiving curative resection and adjuvant chemotherapy.MethodsWe retrospectively reviewed 697 consecutive patients undergoing curative surgery followed by adjuvant chemotherapy for Stage II-III GC between November 2000 and September 2012. Patients were classified into high (≥3) and low (≤2) CONUT groups according to the receiver operating characteristic (ROC) analysis.ResultsOf the included patients, 217 (31.1%) belonged to the high CONUT group. The high CONUT group had a significantly lower 5-year cancer-specific survival (CSS) rate than the low CONUT group (39.3 vs. 55.5%, P < 0.001). High CONUT score was significantly associated with larger tumor size, more lymph node metastasis, and poorer nutritional status, including lower body mass index (BMI), higher prognostic nutritional index (PNI) and the presence of preoperative anemia (all P < 0.05). Multivariate analysis revealed that CONUT score was an independent prognostic factor (HR: 1.553; 95% CI: 1.080–2.232; P = 0.017). Of note, in the low PNI group, CONUT score still effectively stratified CSS (P = 0.016). Furthermore, the prognostic significance of CONUT score was also maintained when stratified by TNM stage (all P < 0.05).ConclusionsCONUT score is considered a useful nutritional marker for predicting prognosis in stage II-III GC patients undergoing curative resection and adjuvant chemotherapy, and may help to facilitate the planning of preoperative nutritional interventions.Electronic supplementary materialThe online version of this article (10.1186/s12885-018-4616-y) contains supplementary material, which is available to authorized users.

No abstract

No abstract

Centralized coded caching problem is studied for the two-user scenario, considering heterogeneous cache capacities at the users and private channels from the server to the users, in addition to a shared channel. Optimal caching and delivery strategies that minimize the worst-case delivery latency are presented for an arbitrary number of files. The converse proof follows from the sufficiency of file-index-symmetric caching and delivery codes, while the achievability is obtained through memory-sharing among a number of special memory-capacity pairs. The optimal scheme is shown to exploit the private link capacities by transmitting part of the corresponding user's request in an uncoded fashion. When there are no private links, the results presented here improve upon the two known results in the literature, namely, i) equal cache capacities and arbitrary number of files; and ii) unequal cache capacities and two files. The results are then extended to the caching problem with heterogeneous distortion requirements.

Centralized coded caching problem is studied for the two-user scenario, considering heterogeneous cache capacities at the users and private channels from the server to the users, in addition to a shared channel. Optimal caching and delivery strategies that minimize the worst-case delivery latency are presented for an arbitrary number of files. The converse proof follows from the sufficiency of fileindex-symmetric caching and delivery codes, while the achievability is obtained through memory-sharing among a number of special memory capacity pairs. The optimal scheme is shown to exploit the private link capacities by transmitting part of the corresponding user's request in an uncoded fashion. When there are no private links, the results presented here improve upon the two known results in the literature, namely, i) equal cache capacities and arbitrary number of files; and ii) unequal cache capacities and N = 2 files. The results are then extended to the caching problem with heterogeneous distortion requirements.