Deterministic Dense Coding and Faithful Teleportation with Multipartite Graph States

We proposed novel schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed scheme. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.Comment: 10 pages, 1 figure;v2. discussions improve

The Irrelevant Values Problem of Decision Tree in Medical Examination

[[abstract]]Data mining technique is extensively used in medical application. One of key tools is the decision tree. When a decision tree is represented by a collection of rules, the antecedents of individual rules may contain irrelevant values problem. When we use this complete set of rules to medical examinations, the irrelevant values problem may cause unnecessary economic burden both to the patient and the society. We used a hypothyroid disease as an example for the study of irrelevant values problem of decision tree in medical examination. Hypothyroid disease is used to associate to the mechanism of thyroid-stimulating hormone (TSH). Physicians will combine lots of information; such as patient's clinical records, medical images, and symptoms, prior to the final diagnosis and treatment, especially surgical operation. Therefore, to avoid generating rules with irrelevant values problem, we propose a new algorithm to remove irrelevant values problem of rules in the process of converting the decision tree to rules utilizing information already present in the decision tree. Our algorithm is able to handle both discrete and continuous values.[[notice]]補正完畢[[journaltype]]國際[[incitationindex]]EI[[ispeerreviewed]]Y[[booktype]]紙本[[countrycodes]]TW

r-Hint: A message-efficient random access response for mMTC in 5G networks

Massive Machine Type Communication (mMTC) has attracted increasing attention due to the explosive growth of IoT devices. Random Access (RA) for a large number of mMTC devices is especially difficult since the high signaling overhead between User Equipments (UEs) and an eNB may overwhelm the available spectrum resources. To address this issue, we propose “respond by hint” (r-Hint), an ID-free handshaking protocol for contention-based RA in mMTC. The core idea of r-Hint is to avoid sequentially notifying contending UEs of their IDs by broadcasting a hint in the RA Response (RAR). To do so, we exploit the concept of prime factorization and hashing to encode the hint such that UEs can extract their required information accordingly. Our simulation results show that r-Hint reduces the RAR message size by 20%–40%. Such reduction can be translated to around 50% improvement of spectrum efficiency in LTE-M

Genetic Polymorphisms of the Glycine N-Methyltransferase and Prostate Cancer Risk in the Health Professionals Follow-Up Study

Purpose Glycine N-methyltransferase (GNMT) affects genetic stability by regulating the ratio of S-adenosylmethionine to S-adenosylhomocysteine, by binding to folate, and by interacting with environmental carcinogens. In Taiwanese men, GNMT was found to be a tumor susceptibility gene for prostate cancer. However, the association of GNMT with prostate cancer risk in other ethnicities has not been studied. It was recently reported that sarcosine, which is regulated by GNMT, increased markedly in metastatic prostate cancer. We hereby explored the association of GNMT polymorphisms with prostate cancer risk in individuals of European descent from the Health Professionals Follow-up Study (HPFS). Methods: A total of 661 incident prostate cancer cases and 656 controls were identified from HPFS. The GNMT short tandem repeat polymorphism 1 (STRP1), 4-bp insertion/deletion polymorphisms (INS/DEL) and the single nucleotide polymorphism rs10948059 were genotyped to test for their association with prostate cancer risk. Results: The rs10948059 T/T genotype was associated with a 1.62-fold increase in prostate cancer risk (95% confidence interval (CI): 1.18, 2.22) when compared with the C/C genotype. The STRP1 ≥16GAs/≥16GAs genotype was associated with decreased risk of prostate cancer when compared with the <16GAs/<16GAs genotype (odds ratio (OR) = 0.68; 95% CI: 0.46, 1.01). INS/DEL was not associated with prostate cancer risk. Haplotypes containing the rs10948059 T allele were significantly associated with increased prostate cancer risk. Conclusion: In men of European descent, the GNMT rs10948059 and STRP1 were associated with prostate cancer risk. Compared to the study conducted in Taiwanese men, the susceptibility GNMT alleles for prostate cancer had a reverse relationship. This study highlights the differences in allelic frequencies and prostate cancer susceptibility in different ethnicities

On Scalable Service Function Chaining with O(1) Flowtable Entries

The emergence of Network Function Virtualization (NFV) enables flexible and agile service function chaining in a Software Defined Network (SDN). While this virtualization technology efficiently offers customization capability, it however comes with a cost of consuming precious TCAM resources. Due to this, the number of service chains that an SDN can support is limited by the flowtable size of a switch. To break this limitation, this paper presents CRT-Chain, a service chain forwarding protocol that requires only constant flowtable entries, regardless of the number of service chain requests. The core of CRT-Chain is an encoding mechanism that leverages Chinese Remainder Theorem (CRT) to compress the forwarding information into small labels. A switch does not need to insert forwarding rules for every service chain request, but only needs to conduct very simple modular arithmetic to extract the forwarding rules directly from CRT-Chain's labels attached in the header. We further incorporate prime reuse and path segmentation in CRT-Chain to reduce the header size and, hence, save bandwidth consumption. Our evaluation results show that, when a chain consists of no more than 5 functions, CRT-Chain actually generates a header smaller than the legacy 32-bit header defined in IETF. By enabling prime reuse and segmentation, CRT-Chain further reduces the total signaling overhead to a level lower than the conventional scheme, showing that CRT-Chain not only enables scalable flowtable-free chaining but also improves network efficiency