315 research outputs found

    sj-docx-1-mso-10.1177_20552173231165196 - Supplemental material for Preserved T cell but attenuated antibody response in MS patients on fingolimod and ocrelizumab following 2nd and 3rd SARS-CoV-2 mRNA vaccine

    No full text
    Supplemental material, sj-docx-1-mso-10.1177_20552173231165196 for Preserved T cell but attenuated antibody response in MS patients on fingolimod and ocrelizumab following 2nd and 3rd SARS-CoV-2 mRNA vaccine by Sarah Conway, Shrishti Saxena, Clare Baecher-Allan, Rajesh Krishnan, Maria Houtchens, Bonnie Glanz, Taylor J Saraceno, Mariann Polgar-Turcsanyi, Gauruv Bose, Rohit Bakshi, Shamik Bhattacharyya, Kristin Galetta, Tamara Kaplan, Christopher Severson, Tarun Singhal, Lynn Stazzone, Jonathan Zurawski, Anu Paul, Howard L Weiner, Brian C Healy and Tanuja Chitnis in Multiple Sclerosis Journal – Experimental, Translational and Clinical</p

    sj-docx-2-mso-10.1177_20552173231165196 - Supplemental material for Preserved T cell but attenuated antibody response in MS patients on fingolimod and ocrelizumab following 2nd and 3rd SARS-CoV-2 mRNA vaccine

    No full text
    Supplemental material, sj-docx-2-mso-10.1177_20552173231165196 for Preserved T cell but attenuated antibody response in MS patients on fingolimod and ocrelizumab following 2nd and 3rd SARS-CoV-2 mRNA vaccine by Sarah Conway, Shrishti Saxena, Clare Baecher-Allan, Rajesh Krishnan, Maria Houtchens, Bonnie Glanz, Taylor J Saraceno, Mariann Polgar-Turcsanyi, Gauruv Bose, Rohit Bakshi, Shamik Bhattacharyya, Kristin Galetta, Tamara Kaplan, Christopher Severson, Tarun Singhal, Lynn Stazzone, Jonathan Zurawski, Anu Paul, Howard L Weiner, Brian C Healy and Tanuja Chitnis in Multiple Sclerosis Journal – Experimental, Translational and Clinical</p

    Understanding the importance of side information in graph matching problem

    No full text
    Graph matching algorithms rely on the availability of seed vertex pairs as side information to deanonymize users across networks. Although such algorithms work well in practice, there are other types of side information available which are potentially useful to an attacker. In this thesis, we consider the problem of matching two correlated graphs when an attacker has access to side information either in the form of community labels or an imperfect initial matching. First, we propose a naive graph matching algorithm by introducing the community degree vectors which harness the information from community labels in an e cient manner. Next, we analyze the basic percolation algorithm for graphs with community structure. Finally, we propose a novel percolation algorithm with two thresholds which uses an imperfect matching as input to match correlated graphs. We also analyze these algorithms and provide theoretical guarantees for matching graphs generated using the Stochastic Block Model. We evaluate the proposed algorithms on synthetic as well as real world datasets using various experiments. The experimental results demonstrate the importance of communities as side information especially when the number of seeds is small and the networks are weakly correlated. These results motivate the study of other types of potential side information available to the attacker. Such studies could assist in devising mechanisms to counter the effects of side information in network deanonymization.Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2018-12-01The student, Kushagra Singhal, accepted the attached license on 2016-11-22 at 11:10.The student, Kushagra Singhal, submitted this Thesis for approval on 2016-11-22 at 11:16.This Thesis was approved for publication on 2016-11-22 at 12:00.DSpace SAF Submission Ingestion Package generated from Vireo submission #10224 on 2017-02-28 at 14:36:15Made available in DSpace on 2017-03-01T16:36:46Z (GMT). No. of bitstreams: 2 SINGHAL-THESIS-2016.pdf: 390320 bytes, checksum: 96d12f05add1e7756426924faa9c6f2d (MD5) LICENSE.txt: 4213 bytes, checksum: b67b10643e59abee994c756430c3217e (MD5) Previous issue date: 2016-11-22Embargo set by: Seth Robbins for item 98583 Lift date: 2019-03-01T16:37:19Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemU of I Only Restriction Lifted for Item 98583 on 2019-03-02T10:15:33Z

    A new framework of optimizing keyword weights in text categorization and record querying

    No full text
    In text mining research, the Vector Space Model (VSM) has been commonly used to represent text documents as a vector where each component is associated with a particular word in the documents. Assigning appropriate keyword weights in VSM has been critical in Information Retrieval (IR) and Text Categorization (TC). Traditionally keyword weighting processes are unsupervised; that is, the knowledge of document's category is not leveraged to label the documents. Typically, each keyword weight is assigned using the term frequency -- inverse document frequency (TFIDF) measure. Although the TFIDF measure has been proven effective in several text mining problems, it might not give the optimal classification power for IR and TC. In this thesis, we propose a new optimization framework to find the best keyword weights based on the proposed inter-class and intra-class similarity concept. The optimal keyword weight can be viewed as the feature space projection where documents from the same category are best clustered together and separated from other categories. Subsequently, the category average (centroid) classification is employed to categorize text documents. The proposed approach is tested on two practical applications: record query and text categorization. The record query application is slightly different from traditional IR problems as the goal is to find correlated (duplicate and master) text records. This problem was initiated by a telecommunication company where service engineers attempt to look for associations of the current defect problem in previously recorded problems in the database. Extensive experiments demonstrate that the proposed framework significantly improves the classification accuracy and provides balanced performance as measured on all text categories when compared to the standard TFIDF search. The text categorization application is tested on the Reuters news data set which is a gold-standard benchmark data set. The results show that our framework improves performance for the two applications considered, namely Information Retrieval and Text Categorization.M.S.Includes bibliographical references (p. 80-83)

    Evaluation of UML based wireless network virtualization

    No full text
    Virtualization of wireless networks is recognized to be a difficult problem due to the fact that radios interact with their neighbors at various layers of the protocol stack, making strict isolation of virtual networks ("or slices") quite challenging. The goal of virtualization is to support concurrent experiments, both long-running services as well as short-term experiments on shared wireless network. In a wireless network, the radio resources that can be shared and hence virtualized are in time, space and frequency. Efforts have been going on to modify the ORBIT control structure to accommodate different forms of virtualization including VMAC, SDMA, FDMA and TDMA. Among different possible wireless virtualization techniques, this work is focused on allowing a node to run more than one experiment simultaneously using different frequencies i.e. Frequency Division Multiplexing (FDM). Each node in the ORBIT test bed is provided with two physical wireless cards. FDMA virtualization is achieved by running two concurrent User Level Operating Systems (ULOS) on each node and providing each operating system access to a radio card. Thus an experimental end user would view a single node as two virtual nodes, each equipped with one wireless card. Experimental results are provided to compare the performance of a virtualized radio node with the non virtualized one for basic point-to-point experiments using TCP and UDP. Bounds on performance metrics of throughput, delay and jitter are determined and cross-coupling effects between two virtualized experiments are examined. We also look at transient behavior associated with sudden changes in traffic on one of the virtual networks. Finally, the uncertainty in performance measurements for a few typical usage scenarios is investigated, leading to guidelines for use of virtualized radio nodes for simultaneous ORBIT experiments.M.S.Includes bibliographical references (p. 44-45)

    A case of postkidney transplant patient with gastric tuberculosis mimicking gastric malignancy

    No full text
    A 60-year-old male patient, who is a known case of end-stage kidney disease postliving donor renal transplantation on triple maintenance immunosuppression, presented with persistent dyspeptic symptoms 8 months posttransplant, not relieved with prolonged proton-pump inhibitor therapy. On endoscopy, found to have large ulcerated nodular lesion in the body of stomach suggestive of malignancy. On biopsy, it was diagnosed with primary gastric tuberculosis (TB). Complete clinical and endoscopic resolution was achieved following anti-TB treatment

    Construct Delineation of Samatvam (Equanimity): A Pathway to Holistic Well-Being

    No full text
    Construct Delineation of Samatvam (Equanimity): A Pathway to Holistic Well-Being Urmi Gupta &amp; Rekha Singhal PhD Scholar &amp; Professor Faculty of Contemplative and Behavioural Sciences, Sri Sri University Author Note We have no conflicts of interest to disclose. Correspondence concerning this article should be addressed to Urmi Gupta, Research Scholar, Faculty of Contemplative and Behavioural Sciences, Sri Sri university, Ward No - 3, Sandhapur, Godi Sahi, Cuttack Bidhayadharpur, Odisha 754006. Email: [email protected] Construct Delineation of Samatvam (Equanimity): A Pathway to Holistic Well-Being Abstract The Bhagavad Gita, an ancient Indian scripture and a spiritual guide to millions across diverse populations and cultures, addresses existential dilemmas that remain relevant across time and context. Its teachings extend beyond the spiritual domain, offering practical philosophical, psychological, and spiritual insights that promote well-being. The objective of this research was to explore Samatvam (equanimity) as a pathway to holistic well-being (HWB). Thematic analysis of the principle of Samatvam, as advocated in the Bhagavad Gita, was carried out to conceptualize holistic well-being through the lens of equanimity. The study illustrates key principles of Samatvam and how they foster HWB through its psychological, philosophical, and spiritual dimensions. Future empirical research is recommended to validate and operationalize these insights across diverse populations and cultural contexts. Keywords: Samatvam, equanimity and well-being, holistic well-being, cultivation of equanimity, equanimity and mental health, spirituality and well bein

    Creativity and competitive excellence

    No full text
    Treball final de Grau en Administració d’Empreses. Codi: AE1049. Curs acadèmic 2014-201

    Multiple symbol decoding of differential space-time codes

    No full text
    Multiple-symbol detection of space-time differential codes (MS-STDC) decodes N consecutive space-time symbols using maximum likelihood (ML) sequence detection to gain in performance over the conventional differential detection scheme. However its computational complexity is exponential in N . A fast algorithm for implementing the MD-STDC in block-fading channels with complexity O(N 4) is developed. Its performance in both block-fading and symbol-by-symbol fading channels is demonstrated through simulations. Set partitioning in hierarchical trees (SPIHT) coupled with rate compatible punctured convolution code (RCPC) and cyclic redundancy check (CRC) is employed as a generalized multiple description source coder with robustness to channel errors. We propose a serial concatenation of the above with a differential space-time code (STDC) and invoke an iterative joint source channel decoding procedure for decoding differentially space-time coded multiple descriptions. Experiments show a gain of up to 5 dB in PSNR with four iterations for image transmission in the absence of channel state information (CSI) at the receiver. A serial concatenation of SPIHT + RCPC/CRC is also considered with space-time codes (STC) instead of STDC. Experiments show a gain of up to 7 dB with four iterations in the absence of CS
    corecore