The Chinese University of Hong Kong

About: The Chinese University of Hong Kong is a education organization based out in Hong Kong, China. It is known for research contribution in the topics: Population & Computer science. The organization has 43411 authors who have published 93672 publications receiving 3066651 citations.

Celecoxib versus diclofenac and omeprazole in reducing the risk of recurrent ulcer bleeding in patients with arthritis.

Abstract: Background Current guidelines recommend that patients at risk for ulcer disease who require treatment for arthritis receive nonsteroidal antiinflammatory drugs (NSAIDs) that are selective for cyclooxygenase-2 or the combination of a nonselective NSAID with a proton-pump inhibitor. We assessed whether celecoxib would be similar to diclofenac plus omeprazole in reducing the risk of recurrent ulcer bleeding in patients at high risk for bleeding. Methods We studied patients who used NSAIDs for arthritis and who presented with ulcer bleeding. After their ulcers had healed, we randomly assigned patients who were negative for Helicobacter pylori to receive either 200 mg of celecoxib twice daily plus daily placebo or 75 mg of diclofenac twice daily plus 20 mg of omeprazole daily for six months. The end point was recurrent ulcer bleeding. Results In the intention-to-treat analysis, which included 287 patients (144 receiving celecoxib and 143 receiving diclofenac plus omeprazole), recurrent ulcer bleeding occurred ...

Theaflavins in Black Tea and Catechins in Green Tea Are Equally Effective Antioxidants

Abstract: Green tea catechins, including (-)-epicatechin (EC), (-)-epicatechin gallate (ECG), (-)-epigallocatechin (EGC) and (-)-epigallocatechin gallate (EGCG), are oxidized and dimerized during the manufacture of black tea and oolong tea to form orange-red pigments, theaflavins (TF), a mixture of theaflavin (TF1), theaflavin-3-gallate (TF2A), theaflavin-3'-gallate (TF2B) and theaflavin-3,3'-digallate (TF3). The present study was designed to compare the antioxidant activities of individual TF with that of each catechin using human LDL oxidation as a model. All catechins and TF tested inhibited Cu(+2)-mediated LDL oxidation. Analysis of the thiobarbituric acid-reactive substances (TBARS) and conjugated dienes produced during LDL oxidation revealed that the antioxidant activity was in the order: TF3 > ECG > EGCG > or = TF2B > or = TF2A > TF1 > or = EC > EGC. Four TF derivatives also demonstrated a dose-dependent antioxidant activity in Cu(+2)-mediated LDL oxidation at concentrations of 5-40 micromol/L. These results demonstrate that the TF present in black tea possess at least the same antioxidant potency as catechins present in green tea, and that the conversion of catechins to TF during fermentation in making black tea does not alter significantly their free radical-scavenging activity.

Resilient Network Coding in the Presence of Byzantine Adversaries

Abstract: Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a malicious node can end up contaminating all the information reaching a destination, preventing decoding. This paper introduces distributed polynomial-time rate-optimal network codes that work in the presence of Byzantine nodes. We present algorithms that target adversaries with different attacking capabilities. When the adversary can eavesdrop on all links and jam links, our first algorithm achieves a rate of , where is the network capacity. In contrast, when the adversary has limited eavesdropping capabilities, we provide algorithms that achieve the higher rate of . Our algorithms attain the optimal rate given the strength of the adversary. They are information-theoretically secure. They operate in a distributed manner, assume no knowledge of the topology, and can be designed and implemented in polynomial time. Furthermore, only the source and destination need to be modified; nonmalicious nodes inside the network are oblivious to the presence of adversaries and implement a classical distributed network code. Finally, our algorithms work over wired and wireless networks.