199,081 research outputs found
Sequential decision fusion for controlled detection errors
No full textInformation fusion in biometrics has received considerable attention. The architecture proposed here is based on the sequential integration of multi-instance and multi-sample fusion schemes. This method is analytically shown to improve the performance and allow a controlled trade-off between false alarms and false rejects when the classifier decisions are statistically independent. Equations developed for detection error rates are experimentally evaluated by considering the proposed architecture for text dependent speaker verification using HMM based digit dependent speaker models. The tuning of parameters, n classifiers and m attempts/samples, is investigated and the resultant detection error trade-off performance is evaluated on individual digits. Results show that performance improvement can be achieved even for weaker classifiers (FRR-19.6%, FAR-16.7%). The architectures investigated apply to speaker verification from spoken digit strings such as credit card numbers in telephone or VOIP or internet based applications
Qualifying unmet needs and improving standards of care in psoriatic arthritis
No full textCelgeneHelliwell, P., Coates, L., Chandran, V., Gladman, D., Wit, M.D., Fitzgerald, O., Kavanaugh, A., Strand, V., Mease, P.J., Boehncke, W.H., Langley, R.G., Lubrano, E., Maccarone, M., Schulze-Koops, H., Miceli-Richard, C., Queiro, R
NFAT and CREB Regulate Kaposi's Sarcoma-Associated Herpesvirus-Induced Cyclooxygenase 2 (COX-2)
No full textABSTRACT
COX-2 has been implicated in Kaposi's sarcoma-associated herpesvirus (KSHV) latency and pathogenesis (A. George Paul, N. Sharma-Walia, N. Kerur, C. White, and B. Chandran, Cancer Res. 70:3697-3708, 2010; P. P. Naranatt, H. H. Krishnan, S. R. Svojanovsky, C. Bloomer, S. Mathur, and B. Chandran, Cancer Res. 64:72-84, 2004; N. Sharma-Walia, A. G. Paul, V. Bottero, S. Sadagopan, M. V. Veettil, N. Kerur, and B. Chandran, PLoS Pathog. 6:e1000777, 2010; N. Sharma-Walia, H. Raghu, S. Sadagopan, R. Sivakumar, M. V. Veettil, P. P. Naranatt, M. M. Smith, and B. Chandran, J. Virol. 80:6534-6552, 2006). However, the precise regulatory mechanisms involved in COX-2 induction during KSHV infection have never been explored. Here, we identified
cis
-acting elements involved in the transcriptional regulation of COX-2 upon KSHV
de
novo
infection. Promoter analysis using human COX-2 promoter deletion and mutation reporter constructs revealed that nuclear factor of activated T cells (NFAT) and the cyclic AMP (cAMP) response element (CRE) modulate KSHV-mediated transcriptional regulation of COX-2. Along with multiple KSHV-induced signaling pathways, infection-induced prostaglandin E
2
(PGE
2
) also augmented COX-2 transcription. Infection of endothelial cells markedly induced COX-2 expression via a cyclosporine A-sensitive, calcineurin/NFAT-dependent pathway. KSHV infection increased intracellular cAMP levels and activated protein kinase A (PKA), which phosphorylated the CRE-binding protein (CREB) at serine 133, which probably led to interaction with CRE in the COX-2 promoter, thereby enhancing COX-2 transcription. PKA selective inhibitor H-89 pretreatment strongly inhibited CREB serine 133, indicating the involvement of a cAMP-PKA-CREB-CRE loop in COX-2 transcriptional regulation. In contrast to phosphatidylinositol 3-kinase and protein kinase C, inhibition of FAK and Src effectively reduced KSHV infection-induced COX-2 transcription and protein levels. Collectively, our study indicates that mediation of COX-2 transcription upon KSHV infection is a paradigm of a complex regulatory milieu involving the interplay of multiple signal cascades and transcription factors. Intervention at each step of COX-2/PGE
2
induction can be used as a potential therapeutic target to treat KSHV-associated neoplasm and control inflammatory sequels of KSHV infection.
</jats:p
Dr. Duane M. Jackson, Morehouse College, July 2011
No full textThis video is a conversation with Dr. Duane M. Jackson. Dr. Jackson talks about his paper, "Recall and the Serial Position Effect: The Role of Primacy and Recency on Accounting Students' Performance." Jackie Daniel, AUC Woodruff Library, is the interviewer
"Reflections on the subject of Emigration from Europe with a view to Settlement in the United States" By M. Carey.
No full text"Reflections on the subject of Emigration from Europe with a view to Settlement in the United States: containing bried sketches of the moral and political character of those states.
By M. Carey, member of the American philosophical, and of the American Antiquarian Society, and author of The Olive Branch, Cindiciae Hibernicae, essays on banking, on political economy, and on internal improvement.
To which are now added the English editor's comments on the subject; together with Important Advice to Emigrants, and Cautions Against Impositions Practiced in the Outports
Bipartite Powers of k-chordal Graphs
No full textLet k be an integer and k ≥ 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive integer m, if Gm is chordal then so is Gm+2. Brandstädt et al. in [Andreas Brandstädt, Van Bang Le, and Thomas Szymczak. Duchet-type theorems for powers of HHD-free graphs. Discrete Mathematics, 177(1-3):9-16, 1997.] showed that if Gm is k-chordal, then so is Gm+2. Powering a bipartite graph does not preserve its bipartitedness. In order to preserve the bipartitedness of a bipartite graph while powering Chandran et al. introduced the notion of bipartite powering. This notion was introduced to aid their study of boxicity of chordal bipartite graphs. The m-th bipartite power G[m] of a bipartite graph G is the bipartite graph obtained from G by adding edges (u, v) where dG(u, v) is odd and less than or equal to m. Note that G[m] = G[m+1] for each odd m. In this paper we show that, given a bipartite graph G, if G is k-chordal then so is G[m], where k, m are positive integers with k ≥ 4
Dispelling the Myths Behind First-author Citation Counts
No full textWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Dr. Glendon Swarthout
No full textHosted by Roger M. Busfield, MSU Assistant Professor of Speech and Theater, Meet the Author is designed to introduce a general audience to a contemporary author and their work through in-depth interviews. This episode features a conversation between Dr. Glendon Swarthout, prolific author and English professor at MSU, and assistant professors Sam S. Baskett and Theodore B. Strandness
A modified peridynamic method to model the fracture behaviour of nanocomposites
No full textIn the present work, a numerical investigation based on a modified peridynamic method of fracture properties of epoxy resin reinforced by nanoparticles, more specifically hyperbranched polyester (HBP), was conducted. Due to the specific features of HBP, certain material nodes in the numerical model were constrained to accurately replicate the effect of HBP in pure epoxy resin, and a Monte Carlo method was used to simulate the random distribution of HBP. The numerical model was validated by fracture tests with single-edge-notched bending (SENB) samples. Moreover, the effect of the HBP weight fraction on the fracture properties was analysed. With increaseing HBP weight fraction, a three-stage increase of mode-I fracture toughness in a rapid-slow-rapid manner was obtained. Overall, the proposed modified peridynamic method provided a macroscale analysis of the fracture behaviour of nanocomposites reinforced by HBP in a simulation framework
Krenn-Gu Conjecture for Sparse Graphs
No full textGreenberger–Horne–Zeilinger (GHZ) states are quantum states involving at least three entangled particles. They are of fundamental interest in quantum information theory, and the construction of such states of high dimension has various applications in quantum communication and cryptography. Krenn, Gu and Zeilinger discovered a correspondence between a large class of quantum optical experiments which produce GHZ states and edge-weighted edge-coloured multi-graphs with some special properties called the GHZ graphs. On such GHZ graphs, a graph parameter called dimension can be defined, which is the same as the dimension of the GHZ state produced by the corresponding experiment. Krenn and Gu conjectured that the dimension of any GHZ graph with more than 4 vertices is at most 2. An affirmative resolution of the Krenn-Gu conjecture has implications for quantum resource theory. Moreover, this would save huge computational resources used for finding experiments which lead to higher dimensional GHZ states. On the other hand, the construction of a GHZ graph on a large number of vertices with a high dimension would lead to breakthrough results.
In this paper, we study the existence of GHZ graphs from the perspective of the Krenn-Gu conjecture and show that the conjecture is true for graphs of vertex connectivity at most 2 and for cubic graphs. We also show that the minimal counterexample to the conjecture should be 4-connected. Such information could be of great help in the search for GHZ graphs using existing tools like PyTheus. While the impact of the work is in quantum physics, the techniques in this paper are purely combinatorial, and no background in quantum physics is required to understand them
- …
