A quantum protocol to win the graph colouring game on all Hadamard graphs

This paper deals with graph colouring games, an example of pseudo-telepathy, in which two provers can convince a verifier that a graph $G$ is $c$-colourable where $c$ is less than the chromatic number of the graph. They win the game if they convince the verifier. It is known that the players cannot win if they share only classical information, but they can win in some cases by sharing entanglement. The smallest known graph where the players win in the quantum setting, but not in the classical setting, was found by Galliard, Tapp and Wolf and has 32,768 vertices. It is a connected component of the Hadamard graph $G_N$ with $N=c=16$. Their protocol applies only to Hadamard graphs where $N$ is a power of 2. We propose a protocol that applies to all Hadamard graphs. Combined with a result of Frankl, this shows that the players can win on any induced subgraph of $G_{12}$ having 1609 vertices, with $c=12$. Combined with a result of Frankl and Rodl, our result shows that all sufficiently large Hadamard graphs yield pseudo-telepathy games.Comment: 5pag

Cervical Cancer Treatment using AI

In cervical cancer treatment, radiation therapy is selected based on the degree of tumor progression, and radiation oncologists are required to delineate tumor contours. To reduce the burden on radiation oncologists, an automatic segmentation of the tumor contours would prove useful. To the best of our knowledge, automatic tumor contour segmentation has rarely been applied to cervical cancer treatment. In this study, diffusion-weighted images (DWI) of 98 patients with cervical cancer were acquired. We trained an automatic tumor contour segmentation model using 2D U-Net and 3D U-Net to investigate the possibility of applying such a model to clinical practice. A total of 98 cases were employed for the training, and they were then predicted by swapping the training and test images. To predict tumor contours, six prediction images were obtained after six training sessions for one case. The six images were then summed and binarized to output a final image through automatic contour segmentation. For the evaluation, the Dice similarity coefficient (DSC) and Hausdorff distance (HD) was applied to analyze the difference between tumor contour delineation by radiation oncologists and the output image. The DSC ranged from 0.13 to 0.93 (median 0.83, mean 0.77). The cases with DSC <0.65 included tumors with a maximum diameter < 40 mm and heterogeneous intracavitary concentration due to necrosis. The HD ranged from 2.7 to 9.6 mm (median 4.7 mm). Thus, the study confirmed that the tumor contours of cervical cancer can be automatically segmented with high accuracy

Response of a stretched cylindrical diffusion flame to a sinusoidal velocity oscillation of air stream

n/

New Impossible Differential Search Tool from Design and Cryptanalysis Aspects

In this paper, a new tool searching for impossible differentials against symmetric-key primitives is presented. Compared to the previous tools, our tool can detect any contradiction between input and output differences, and it can take into account the property inside the S-box when its size is small e.g. 4 bits. In addition, several techniques are proposed to evaluate 8-bit S-box. With this tool, the number of rounds of impossible differentials are improved from the previous best results by 1 round for Midori128, Lilliput, and Minalpher. The tool also finds new impossible differentials of ARIA and MIBS. We manually verify the impossibility of the searched results, which reveals new structural properties of those designs. Our tool can be implemented only by slightly modifying the previous differential search tool using Mixed Integer Linear Programming (MILP), while the previous tools need to be implemented independently of the differential search tools. This motivates us to discuss the usage of our tool particular for the design process. With this tool, the maximum number of rounds of impossible differentials can be proven under reasonable assumptions and the tool is applied to various concrete designs

Suboccipital Approach for Primitive Trigeminal Artery Obliteration Associated with Cavernous Aneurysm

OBJECTIVE: A 63-year-old woman presented with diplopia resulting from abducens paralysis. Examination revealed a giant cavernous aneurysm supplied by the internal carotid artery (ICA) and primitive trigeminal artery (PTA) via the vertebrobasilar system. METHODS: After evaluation of balloon test occlusion (BTO) at the distal side of the PTA origin, the aneurysm was treated with PTA obliteration through the suboccipital route in the lateral position followed by cervical carotid ligation with superficial temporal artery-to-middle cerebral artery anastomosis in the supine position. RESULTS: The aneurysm showed marked shrinkage after the surgery. CONCLUSION: PTA obliteration through the retrosigmoid opening is a therapeutic surgical option in a patient with a cavernous aneurysm supplied by the PTA.ArticleWORLD NEUROSURGERY. 74(4-5):494-496 (2010)journal articl