Humor in Slogans: Van Helsing Effect in Second Language Learning

The present paper further extends the studies of Eisend (2009), Takahashi and Inoue (2009), and Kohn, et al. (2011), and applies Krishnan & Chakravarti’s (2003) experiment design to examine: 1) whether humor in slogans enhances L2 learners’ memory of the promoted items in advertisements; 2) will Vampire Effect occur in humorous slogans and distract L2 learners’ focus so much that they cannot pay attention to the importance of the promoted item itself? And, 3) is gender a distinguishing feature in terms of the acceptance and sensitivity to the humor in slogans? One pretest, two experiments and one post-test were conducted in this study. In the experiments, the participants’ immediate responses to the questions and their memory of the promoted products and candidates were vital. A follow up face-to-face interview was then conducted. It was found that L2 learners’ familiarity with the promoted items was more important than the level of humor in the slogans. That is, instead of the Vampire Effect, in which the degree of funniness is so high that it overwhelms the significance of the item promoted, the Van Helsing Effect, in which L2 learners’ previous experience is more influential in the process of recognizing the slogans and the promoted items, appears

Quantum state tomography via non-convex Riemannian gradient descent

The recovery of an unknown density matrix of large size requires huge computational resources. The recent Factored Gradient Descent (FGD) algorithm and its variants achieved state-of-the-art performance since they could mitigate the dimensionality barrier by utilizing some of the underlying structures of the density matrix. Despite their theoretical guarantee of a linear convergence rate, the convergence in practical scenarios is still slow because the contracting factor of the FGD algorithms depends on the condition number $\kappa$ of the ground truth state. Consequently, the total number of iterations can be as large as $O(\sqrt{\kappa}\ln(\frac{1}{\varepsilon}))$ to achieve the estimation error $\varepsilon$. In this work, we derive a quantum state tomography scheme that improves the dependence on $\kappa$ to the logarithmic scale; namely, our algorithm could achieve the approximation error $\varepsilon$ in $O(\ln(\frac{1}{\kappa\varepsilon}))$ steps. The improvement comes from the application of the non-convex Riemannian gradient descent (RGD). The contracting factor in our approach is thus a universal constant that is independent of the given state. Our theoretical results of extremely fast convergence and nearly optimal error bounds are corroborated by numerical results.Comment: Comments are welcome

The Effectiveness of Traditional Chinese Medicine in Treating Patients with Leukemia

Leukemia is the most common malignancy among all childhood cancers and is associated with a low survival rate in adult patients. Since 1995, the National Health Insurance (NHI) program in Taiwan has been offering insurance coverage for Traditional Chinese Medicine (TCM), along with conventional Western medicine (WM). This study analyzes the status of TCM utilization in Taiwan, in both pediatric and adult patients with leukemia. A retrospective cohort study was conducted using population-based National Health Insurance Research Database of Registry of Catastrophic Illness, involving patient data from 2001 to 2010 and follow-up data through 2011. The effectiveness of TCM use was evaluated. Relevant sociodemographic data showed that both pediatric and adult patients who were TCM users one year prior to leukemia diagnosis were more likely to utilize TCM services for cancer therapy. A greater part of medical expenditure of TCM users was lower than that of TCM nonusers, except little discrepancy in drug fee of adult patients. The survival rate is also higher in TCM users. Altogether, these data show that TCM has the potential to serve as an adjuvant therapy when combined with conventional WM in the treatment of patients with leukemia

Group Signatures and Accountable Ring Signatures from Isogeny-based Assumptions

Group signatures are an important cryptographic primitive providing both anonymity and accountability to signatures. Accountable ring signatures combine features from both ring signatures and group signatures, and can be directly transformed to group signatures. While there exists extensive work on constructing group signatures from various post-quantum assumptions, there has not been any using isogeny-based assumptions. In this work, we propose the first construction of isogeny-based group signatures, which is a direct result of our isogeny-based accountable ring signature. This is also the first construction of accountable ring signatures based on post-quantum assumptions. Our schemes are based on the decisional CSIDH assumption (D-CSIDH) and are proven secure under the random oracle model (ROM)

Survival Outcomes of Patients with Esophageal Cancer Who Did Not Proceed to Surgery after Neoadjuvant Treatment

Background: This retrospective study examined outcomes in esophageal squamous cell carcinoma (ESCC) patients who did not undergo surgical resection after neoadjuvant chemoradiotherapy (nCRT). Methods: Patients receiving nCRT between 2012 and 2020 were divided into two groups: group 1 (scheduled surgery) and group 2 (no surgery). Group 2 was further categorized into subgroups based on reasons for not proceeding to surgery: group 2a (disease progression), group 2b (poor general conditions), and group 2c (patient refusal). Overall survival (OS) was the primary outcome. Results: Group 1 comprised 145 patients, while subgroups 2a, 2b, and 2c comprised 24, 16, and 31 patients, respectively. The 3-year OS rate was significantly lower in group 2 compared with group 1 (34% versus 56%, p &lt; 0.001). A subgroup analysis showed varying 3-year OS rates: 13% for group 2a, 25% for group 2b, and 58% for group 2c (p &lt; 0.001). Propensity score matching for group 2c and group 1 revealed no significant difference in 3-year OS rates (p = 0.91). Conclusion: One-third of ESCC patients receiving nCRT did not undergo surgical resection. Overall survival in this group was generally poorer, except for those who refused surgery (group 2c).</p

On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation

Hamiltonian simulation is one of the most important problems in the field of quantum computing. There have been extended efforts on designing algorithms for faster simulation, and the evolution time T for the simulation greatly affect algorithm runtime as expected. While there are some specific types of Hamiltonians that can be fast-forwarded, i.e., simulated within time o(T), for some large classes of Hamiltonians (e.g., all local/sparse Hamiltonians), existing simulation algorithms require running time at least linear in the evolution time T. On the other hand, while there exist lower bounds of ?(T) circuit size for some large classes of Hamiltonian, these lower bounds do not rule out the possibilities of Hamiltonian simulation with large but "low-depth" circuits by running things in parallel. As a result, physical systems with system size scaling with T can potentially do a fast-forwarding simulation. Therefore, it is intriguing whether we can achieve fast Hamiltonian simulation with the power of parallelism. In this work, we give a negative result for the above open problem in various settings. In the oracle model, we prove that there are time-independent sparse Hamiltonians that cannot be simulated via an oracle circuit of depth o(T). In the plain model, relying on the random oracle heuristic, we show that there exist time-independent local Hamiltonians and time-dependent geometrically local Hamiltonians on n qubits that cannot be simulated via an oracle circuit of depth o(T/n^c), where the Hamiltonians act on n qubits, and c is a constant. Lastly, we generalize the above results and show that any simulators that are geometrically local Hamiltonians cannot do the simulation much faster than parallel quantum algorithms