414 research outputs found

    含柴胡的草藥對人類淋巴細胞的影響

    Get PDF
    Bupleurum-containing compounds, such as KY88 Liver Livo are thought to have immunomodulatory effects. This study investigated the effects of KY88 Liver Livo on the mitogenic induction of lymphocytes in vitro. Fifteen healthy human adult volunteers, aged between 20 and 50 years, provided peripheral blood samples from which lymphocytes were obtained by Ficoll-Hypaque centrifugation. The separated lymphocytes were stimulated by phytohaemagglutinin and KY88 Liver Livo in varying concentrations for 72 hours, with greater cluster and colony formation evident compared with lymphocytes in a control preparation. KY88 Liver Livo was also found to induce the secretion of granulocyte-macrophage colony-stimulating factor in a dose-dependent fashion. These preliminary in vitro studies suggest that KY88 Liver Livo may have potential clinical value in the treatment of chronic viral infection and in the management of immunocompromised patients.published_or_final_versio

    Efficient color face detection algorithm under different lighting conditions

    Get PDF
    Author name used in this publication: Kin-Man Lam2005-2006 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

    Binary pattern tile set synthesis is NP-hard

    Full text link
    In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The kk-PATS problem is that of designing a tile assembly system with the smallest number of tile types which will self-assemble an input pattern of kk colors. Of both theoretical and practical significance, kk-PATS has been studied in a series of papers which have shown kk-PATS to be NP-hard for k=60k = 60, k=29k = 29, and then k=11k = 11. In this paper, we close the fundamental conjecture that 2-PATS is NP-hard, concluding this line of study. While most of our proof relies on standard mathematical proof techniques, one crucial lemma makes use of a computer-assisted proof, which is a relatively novel but increasingly utilized paradigm for deriving proofs for complex mathematical problems. This tool is especially powerful for attacking combinatorial problems, as exemplified by the proof of the four color theorem by Appel and Haken (simplified later by Robertson, Sanders, Seymour, and Thomas) or the recent important advance on the Erd\H{o}s discrepancy problem by Konev and Lisitsa using computer programs. We utilize a massively parallel algorithm and thus turn an otherwise intractable portion of our proof into a program which requires approximately a year of computation time, bringing the use of computer-assisted proofs to a new scale. We fully detail the algorithm employed by our code, and make the code freely available online

    Metabolomic Profiling of Plasma from Melioidosis Patients Using UHPLC-QTOF MS Reveals Novel Biomarkers for Diagnosis

    Get PDF
    © 2016 by the authors; licensee MDPI, Basel, Switzerland.To identify potential biomarkers for improving diagnosis of melioidosis, we compared plasma metabolome profiles of melioidosis patients compared to patients with other bacteremia and controls without active infection, using ultra-high-performance liquid chromatography-electrospray ionization-quadruple time-of-flight mass spectrometry. Principal component analysis (PCA) showed that the metabolomic profiles of melioidosis patients are distinguishable from bacteremia patients and controls. Using multivariate and univariate analysis, 12 significant metabolites from four lipid classes, acylcarnitine (n = 6), lysophosphatidylethanolamine (LysoPE) (n = 3), sphingomyelins (SM) (n = 2) and phosphatidylcholine (PC) (n = 1), with significantly higher levels in melioidosis patients than bacteremia patients and controls, were identified. Ten of the 12 metabolites showed area-under-receiver operating characteristic curve (AUC) >0.80 when compared both between melioidosis and bacteremia patients, and between melioidosis patients and controls. SM(d18:2/16:0) possessed the largest AUC when compared, both between melioidosis and bacteremia patients (AUC 0.998, sensitivity 100% and specificity 91.7%), and between melioidosis patients and controls (AUC 1.000, sensitivity 96.7% and specificity 100%). Our results indicate that metabolome profiling might serve as a promising approach for diagnosis of melioidosis using patient plasma, with SM(d18:2/16:0) representing a potential biomarker. Since the 12 metabolites were related to various pathways for energy and lipid metabolism, further studies may reveal their possible role in the pathogenesis and host response in melioidosis.published_or_final_versio

    Galileons as Wess-Zumino Terms

    Full text link
    We show that the galileons can be thought of as Wess-Zumino terms for the spontaneous breaking of space-time symmetries. Wess-Zumino terms are terms which are not captured by the coset construction for phenomenological Lagrangians with broken symmetries. Rather they are, in d space-time dimensions, d-form potentials for (d+1)-forms which are non-trivial co-cycles in Lie algebra cohomology of the full symmetry group relative to the unbroken symmetry group. We introduce the galileon algebras and construct the non-trivial (d+1)-form co-cycles, showing that the presence of galileons and multi-galileons in all dimensions is counted by the dimensions of particular Lie algebra cohomology groups. We also discuss the DBI and conformal galileons from this point of view, showing that they are not Wess-Zumino terms, with one exception in each case.Comment: 49 pages. v2 minor changes, version appearing in JHE

    Stronger Security and Constructions of Multi-Designated Verifier Signatures

    Get PDF
    Off-the-Record (OTR) messaging is a two-party message authentication protocol that also provides plausible deniability: there is no record that can later convince a third party what messages were actually sent. To extend OTR to group messaging we need to consider issues that are not present in the 2-party case. In group OTR (as in two-party OTR), the sender should be able to authenticate (or sign) his messages so that group members can verify who sent a message (that is, signatures should be unforgeable, even by group members). Also as in the two-party case, we want the off-the-record property: even if some verifiers are corrupt and collude, they should not be able to prove the authenticity of a message to any outsider. Finally, we need consistency, meaning that a corrupt sender cannot create confusion in the group as to what he said: if any group member accepts a signature, then all of them do. To achieve these properties it is natural to consider Multi-Designated Verifier Signatures (MDVS), which intuitively seem to target exactly the properties we require. However, existing literature defines and builds only limited notions of MDVS, where (a) the off-the-record property (referred to as source hiding) only holds when all verifiers could conceivably collude, and (b) the consistency property is not considered. The contributions of this paper are two-fold: stronger definitions for MDVS, and new constructions meeting those definitions. We strengthen source-hiding to support any subset of corrupt verifiers, and give the first formal definition of consistency. We give several constructions of our stronger notion of MDVS: one from generic standard primitives such as pseudorandom functions, pseudorandom generators, key agreement and NIZKs; one from specific instances of these primitives (for concrete efficiency); and one from functional encryption. The third construction requires an involved trusted setup step — including verification keys derived from a master secret — but this trusted setup buys us verifier-identity-based signing, for which such trusted setup is unavoidable. Additionally, in the third construction, the signature size can be made smaller by assuming a bound on colluding verifiers

    Genetic Isolation between the Western and Eastern Pacific Populations of Pronghorn Spiny Lobster Panulirus penicillatus

    Get PDF
    The pronghorn spiny lobster, Panulirus penicillatus, is a circumtropical species which has the widest global distribution among all the species of spiny lobster, ranging throughout the entire Indo-Pacific region. Partial nucleotide sequences of mitochondrial DNA COI (1,142–1,207 bp) and 16S rDNA (535–546 bp) regions were determined for adult and phyllosoma larval samples collected from the Eastern Pacific (EP)(Galápagos Islands and its adjacent water), Central Pacific (CP)(Hawaii and Tuamotu) and the Western Pacific (WP)(Japan, Indonesia, Fiji, New Caledonia and Australia). Phylogenetic analyses revealed two distinct large clades corresponding to the geographic origin of samples (EP and CP+WP). No haplotype was shared between the two regional samples, and average nucleotide sequence divergence (Kimura's two parameter distance) between EP and CP+WP samples was 3.8±0.5% for COI and 1.0±0.4% for 16S rDNA, both of which were much larger than those within samples. The present results indicate that the Pacific population of the pronghorn spiny lobster is subdivided into two distinct populations (Eastern Pacific and Central to Western Pacific), with no gene flow between them. Although the pronghorn spiny lobster have long-lived teleplanic larvae, the vast expanse of Pacific Ocean with no islands and no shallow substrate which is known as the East Pacific Barrier appears to have isolated these two populations for a long time (c.a. 1MY)
    corecore