Molecular targeted therapies are commonly used in patients with metastatic renal cell carcinoma (RCC). However, the efficacy and safety of these therapeutic interventions require enhancement to improve prognosis in these patients. Royal jelly (RJ) has anti-cancer effects and adverse events across a variety of types of malignancy. The present study investigated the detailed mechanism underlying the effects of oral administration of RJ in patients with advanced RCC that were treated with molecular targeted agents in a randomized clinical trial. The study cohort comprised 16 patients treated with RJ and 17 patients treated with a placebo. Serum levels of tumor necrosis factor (TNF)-α and transforming growth factor (TGF)-β were measured using enzyme-linked immunosorbent assays. The results of the present study demonstrated a larger decrease in tumor size upon supplementing patients with RJ following molecular targeted therapy compared with that in patients administered with the placebo. Patients exhibited reduced anorexia and fatigue in the RJ group compared with the placebo group. The relative dose intensity for patients in the RJ group was higher than that in patients in the placebo group. Post-and pre-treatment ratios of the serum levels of TNF-α and TGF-β in patients in the RJ group were lower than those in patients in the placebo group, and these ratios correlated with decreasing tumor size and frequency of anorexia or fatigue in patients. In conclusion, the results of the present study indicated that oral intake of RJ improved the efficacy and safety of molecular targeted therapy in patients with RCC and changed the levels of TNF-α and TGF-β in the serum of patients, which is speculated to serve an important role in RJ-induced biological activities.

No abstract

No abstract

SUMMARYWe study the computational complexity of the following two-player game. The instance is a graph G = (V, E), an initial vertex s ∈ V, and a target set T ⊆ V. A "cat" is initially placed on s. Player 1 chooses a vertex in the graph and removes it and its incident edges from the graph. Player 2 moves the cat from the current vertex to one of the adjacent vertices. Players 1 and 2 alternate removing a vertex and moving the cat, respectively. The game continues until either the cat reaches a vertex of T or the cat cannot be moved. Player 1 wins if and only if the cat cannot be moved before it reaches a vertex of T . It is shown that deciding whether player 1 has a forced win on the game on G is PSPACE-complete.

HUPD-2108We present results on the world's first over 100 PFLOPS single precision lattice QCD quark solver on the japanese new supercomputer Fugaku. We achieve a factor 38 time speedup from the supercomputer K on the same problem size, 192 4 , with 102 PFLOPS, 10% floating-point operation efficiency against single precision floating-point operation peak. The evaluation region is the single precision BiCGStab for a Clover-Wilson Dirac matrix with Schwarz Alternating Procedure domain decomposition preconditioning using Jacobi iteration for the local domain matrix inversion.