LIVIVO - The Search Portal for Life Sciences

zur deutschen Oberfläche wechseln
Advanced search

Search results

Result 1 - 10 of total 46

Search options

  1. Book ; Online: Perspective on complexity measures targetting read-once branching programs

    Li, Yaqiao / McKenzie, Pierre

    2023  

    Abstract: A model of computation for which reasonable yet still incomplete lower bounds are known is the read-once branching program. Here variants of complexity measures successful in the study of read-once branching programs are defined and studied. Some new or ... ...

    Abstract A model of computation for which reasonable yet still incomplete lower bounds are known is the read-once branching program. Here variants of complexity measures successful in the study of read-once branching programs are defined and studied. Some new or simpler proofs of known bounds are uncovered. Branching program resources and the new measures are compared extensively. The new variants are developed in part in the hope of tackling read-k branching programs for the tree evaluation problem studied in Cook et al. Other computation problems are studied as well. In particular, a common view of a function studied by Gal and a function studied by Bollig and Wegener leads to the general combinatorics of blocking sets. Technical combinatorial results of independent interest are obtained. New leads towards further progress are discussed. An exponential lower bound for non-deterministic read-k branching programs for the GEN function is also derived, independently from the new measures.

    Comment: 38 pages, a version without the appendix is submitted to the journal Information and Computation
    Keywords Computer Science - Computational Complexity ; Mathematics - Combinatorics ; 68Q05 ; 68R05
    Subject code 005
    Publishing date 2023-05-18
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  2. Book ; Online: Online Vector Bin Packing and Hypergraph Coloring Illuminated

    Li, Yaqiao / Pankratov, Denis

    Simpler Proofs and New Connections

    2023  

    Abstract: This paper studies the online vector bin packing (OVBP) problem and the related problem of online hypergraph coloring (OHC). Firstly, we use a double counting argument to prove an upper bound of the competitive ratio of $FirstFit$ for OVBP. Our proof is ... ...

    Abstract This paper studies the online vector bin packing (OVBP) problem and the related problem of online hypergraph coloring (OHC). Firstly, we use a double counting argument to prove an upper bound of the competitive ratio of $FirstFit$ for OVBP. Our proof is conceptually simple, and strengthens the result in Azar et. al. by removing the dependency on the bin size parameter. Secondly, we introduce a notion of an online incidence matrix that is defined for every instance of OHC. Using this notion, we provide a reduction from OHC to OVBP, which allows us to carry known lower bounds of the competitive ratio of algorithms for OHC to OVBP. Our approach significantly simplifies the previous argument from Azar et. al. that relied on using intricate graph structures. In addition, we slightly improve their lower bounds. Lastly, we establish a tight bound of the competitive ratio of algorithms for OHC, where input is restricted to be a hypertree, thus resolving a conjecture in Nagy-Gyorgy et. al. The crux of this proof lies in solving a certain combinatorial partition problem about multi-family of subsets, which might be of independent interest.
    Keywords Computer Science - Data Structures and Algorithms ; Computer Science - Computational Complexity
    Subject code 005
    Publishing date 2023-06-19
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  3. Book ; Online: Conflict complexity is lower bounded by block sensitivity

    Li, Yaqiao

    2018  

    Abstract: We show conflict complexity of every total Boolean function, recently introduced in [Swagato Sanyal. A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to prove a composition theorem of randomized decision tree ... ...

    Abstract We show conflict complexity of every total Boolean function, recently introduced in [Swagato Sanyal. A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to prove a composition theorem of randomized decision tree complexity, is at least a half of its block sensitivity. We propose to compare conflict complexity with certificate complexity, and explain why it could be interesting.

    Comment: a discussion section added
    Keywords Computer Science - Computational Complexity ; Mathematics - Combinatorics
    Publishing date 2018-10-20
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  4. Book ; Online: A note on the tight example in On the randomised query complexity of composition

    Li, Yaqiao

    2018  

    Abstract: We make two observations regarding a recent tight example for a composition theorem for randomized query complexity: (1) it implies general randomized query-to-communication lifting is not always true if one allows relations, (2) it is in a certain sense ...

    Abstract We make two observations regarding a recent tight example for a composition theorem for randomized query complexity: (1) it implies general randomized query-to-communication lifting is not always true if one allows relations, (2) it is in a certain sense essential that a relation is used in constructing the example.

    Comment: This will be merged with another paper
    Keywords Computer Science - Computational Complexity
    Publishing date 2018-09-04
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  5. Book ; Online: Trading information complexity for error II

    Li, Yaqiao

    the case of a large error and external information complexity

    2018  

    Abstract: Two problems are studied in this paper. (1) How much external or internal information cost is required to compute a Boolean-valued function with an error at most $1/2-\epsilon$ for a small $\epsilon$? It is shown that information cost of order $\epsilon^ ... ...

    Abstract Two problems are studied in this paper. (1) How much external or internal information cost is required to compute a Boolean-valued function with an error at most $1/2-\epsilon$ for a small $\epsilon$? It is shown that information cost of order $\epsilon^2$ is necessary and of order $\epsilon$ is sufficient. (2) How much external information cost can be saved to compute a function with a small error $\epsilon>0$ comparing to the case when no error is allowed? It is shown that information cost of order at least $\epsilon$ and at most $h(\sqrt{\epsilon})$ can be saved. Except the $O(h(\sqrt{\epsilon}))$ upper bound, the other three bounds are tight. For distribution $\mu$ that is equally distributed on $(0,0)$ and $(1,1)$, it is shown that $IC^{ext}_\mu(XOR, \epsilon)=1-2\epsilon$ where XOR is the two-bit xor function. This equality seems to be the first example of exact information complexity when an error is allowed.

    Comment: paper rewritten, new results added
    Keywords Computer Science - Computational Complexity ; Computer Science - Information Theory
    Subject code 518
    Publishing date 2018-09-26
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  6. Article ; Online: Probing the Impact of Surface Functionalization Module on the Performance of Mitoxantrone Prodrug Nanoassemblies: Improving the Effectiveness and Safety.

    Zhang, Bowen / Li, Lingxiao / Huang, Minglong / Zhao, Erwei / Li, Yaqiao / Sun, Jin / He, Zhonggui / Fu, Chunwang / Liu, Guojie / Sun, Bingjun

    Nano letters

    2024  Volume 24, Issue 12, Page(s) 3759–3767

    Abstract: Prodrug nanoassemblies are emerging as a novel drug delivery system for chemotherapy, comprising four fundamental modules: a drug module, a modification module, a response module, and a surface functionalization module. Among these modules, surface ... ...

    Abstract Prodrug nanoassemblies are emerging as a novel drug delivery system for chemotherapy, comprising four fundamental modules: a drug module, a modification module, a response module, and a surface functionalization module. Among these modules, surface functionalization is an essential process to enhance the biocompatibility and stability of the nanoassemblies. Here, we selected mitoxantrone (MTO) as the drug module and DSPE-PEG
    MeSH term(s) Prodrugs ; Mitoxantrone ; Cell Line, Tumor ; Drug Delivery Systems/methods ; Nanoparticles ; Antineoplastic Agents
    Chemical Substances Prodrugs ; Mitoxantrone (BZ114NVM5P) ; Antineoplastic Agents
    Language English
    Publishing date 2024-03-13
    Publishing country United States
    Document type Journal Article
    ISSN 1530-6992
    ISSN (online) 1530-6992
    DOI 10.1021/acs.nanolett.4c00300
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

    Order via subito

    This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  7. Article: Sex-stratified phenotyping of comorbidities associated with an inpatient delirium diagnosis using real world data.

    Kodama, Lay / Woldemariam, Sarah / Tang, Alice / Li, Yaqiao / Oskotsky, Tomiko / Raphael, Eva / Sirota, Marina

    medRxiv : the preprint server for health sciences

    2023  

    Abstract: Delirium is a heterogeneous and detrimental mental condition often seen in older, hospitalized patients and is currently hard to predict. In this study, we leverage large-scale, real- world data using the electronic health records (EHR) to identify two ... ...

    Abstract Delirium is a heterogeneous and detrimental mental condition often seen in older, hospitalized patients and is currently hard to predict. In this study, we leverage large-scale, real- world data using the electronic health records (EHR) to identify two cohorts comprised of 7,492 UCSF patients and 19,417 UC health system patients (excluding UCSF patients) with an inpatient delirium diagnosis and the same number of propensity score-matched control patients without delirium. We found significant associations between comorbidities or laboratory test values and an inpatient delirium diagnosis which were validated independently. Most of these associations were those previously-identified as risk factors for delirium, including metabolic abnormalities, mental health diagnoses, and infections. Some of the associations were sex- specific, including those related to dementia subtypes and infections. We further explored the diagnostic associations with anemia and bipolar disorder by conducting longitudinal analyses from the time of first diagnosis of the risk factor to development of delirium demonstrating a significant relationship across time. Finally, we show that an inpatient delirium diagnosis leads to dramatic increases in mortality outcome across both cohorts. These results demonstrate the powerful application of leveraging EHR data to shed insights into prior diagnoses and laboratory test values that could help predict development of inpatient delirium and emphasize the importance of considering patient demographic characteristics including documented sex when making these assessments.
    One sentence summary: Longitudinal analysis of electronic health record data reveals associations between inpatient delirium, comorbidities, and mortality.
    Language English
    Publishing date 2023-11-04
    Publishing country United States
    Document type Preprint
    DOI 10.1101/2023.11.02.23297925
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  8. Book ; Online: Lifting query complexity to time-space complexity for two-way finite automata

    Zheng, Shenggen / Li, Yaqiao / Pan, Minghua / Gruska, Jozef / Li, Lvzhou

    2023  

    Abstract: Time-space tradeoff has been studied in a variety of models, such as Turing machines, branching programs, and finite automata, etc. While communication complexity as a technique has been applied to study finite automata, it seems it has not been used to ... ...

    Abstract Time-space tradeoff has been studied in a variety of models, such as Turing machines, branching programs, and finite automata, etc. While communication complexity as a technique has been applied to study finite automata, it seems it has not been used to study time-space tradeoffs of finite automata. We design a new technique showing that separations of query complexity can be lifted, via communication complexity, to separations of time-space complexity of two-way finite automata. As an application, one of our main results exhibits the first example of a language $L$ such that the time-space complexity of two-way probabilistic finite automata with a bounded error (2PFA) is $\widetilde{\Omega}(n^2)$, while of exact two-way quantum finite automata with classical states (2QCFA) is $\widetilde{O}(n^{5/3})$, that is, we demonstrate for the first time that exact quantum computing has an advantage in time-space complexity comparing to classical computing.
    Keywords Computer Science - Computational Complexity
    Subject code 005 ; 511
    Publishing date 2023-11-29
    Publishing country us
    Document type Book ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  9. Article ; Online: Cholesterol sulfate-mediated ion-pairing facilitates the self-nanoassembly of hydrophilic cationic mitoxantrone.

    Zhang, Jingxuan / Fang, Hongkai / Dai, Yuebin / Li, Yaqiao / Li, Lingxiao / Zuo, Shiyi / Liu, Tian / Sun, Yixin / Shi, Xianbao / He, Zhonggui / Sun, Jin / Sun, Bingjun

    Journal of colloid and interface science

    2024  Volume 669, Page(s) 731–739

    Abstract: Hypothesis: Hydrophilic cationic drugs such as mitoxantrone hydrochloride (MTO) pose a significant delivery challenge to the development of nanodrug systems. Herein, we report the use of a hydrophobic ion-pairing strategy to enhance the nano-assembly of ...

    Abstract Hypothesis: Hydrophilic cationic drugs such as mitoxantrone hydrochloride (MTO) pose a significant delivery challenge to the development of nanodrug systems. Herein, we report the use of a hydrophobic ion-pairing strategy to enhance the nano-assembly of MTO.
    Experiments: We employed biocompatible sodium cholesteryl sulfate (SCS) as a modification module to form stable ion pairs with MTO, which balanced the intermolecular forces and facilitated nano-assembly. PEGylated MTO-SCS nanoassemblies (pMS NAs) were prepared via nanoprecipitation. We systematically evaluated the effect of the ratio of the drug module (MTO) to the modification module (SCS) on the nanoassemblies.
    Findings: The increased lipophilicity of MTO-SCS ion pair could significantly improve the encapsulation efficiency (∼97 %) and cellular uptake efficiency of MTO. The pMS NAs showed prolonged blood circulation, maintained the same level of tumor antiproliferative activity, and exhibited reduced toxicity compared with the free MTO solution. It is noteworthy that the stability, cellular uptake, cytotoxicity, and in vivo pharmacokinetic behavior of the pMS NAs increased in proportion to the molar ratio of SCS to MTO. This study presents a self-assembly strategy mediated by ion pairing to overcome the challenges commonly associated with the poor assembly ability of hydrophilic cationic drugs.
    Language English
    Publishing date 2024-05-08
    Publishing country United States
    Document type Journal Article
    ZDB-ID 241597-5
    ISSN 1095-7103 ; 0021-9797
    ISSN (online) 1095-7103
    ISSN 0021-9797
    DOI 10.1016/j.jcis.2024.05.029
    Database MEDical Literature Analysis and Retrieval System OnLINE

    More links

    Kategorien

    In stock of ZB MED Bonn / Germany

    Z 71/707: Show issues

    Order via subito

    This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  10. Article ; Online: Small-Molecule Prodrug Nanoassemblies: An Emerging Nanoplatform for Anticancer Drug Delivery.

    Li, Guanting / Sun, Bingjun / Li, Yaqiao / Luo, Cong / He, Zhonggui / Sun, Jin

    Small (Weinheim an der Bergstrasse, Germany)

    2021  Volume 17, Issue 52, Page(s) e2101460

    Abstract: The antitumor efficiency and clinical translation of traditional nanomedicines is mainly restricted by low drug loading, complex preparation technology, and potential toxicity caused by the overused carrier materials. In recent decades, small-molecule ... ...

    Abstract The antitumor efficiency and clinical translation of traditional nanomedicines is mainly restricted by low drug loading, complex preparation technology, and potential toxicity caused by the overused carrier materials. In recent decades, small-molecule prodrug nanoassemblies (SMP-NAs), which are formed by the self-assembly of prodrugs themselves, have been widely investigated with distinct advantages of ultrahigh drug-loading and negligible excipients-trigged adverse reaction. Benefited from the simple preparation process, SMP-NAs are widely used for chemotherapy, phototherapy, immunotherapy, and tumor diagnosis. In addition, combination therapy based on the accurate co-delivery behavior of SMP-NAs can effectively address the challenges of tumor heterogeneity and multidrug resistance. Recent trends in SMP-NAs are outlined, and the corresponding self-assembly mechanisms are discussed in detail. Besides, the smart stimuli-responsive SMP-NAs and the combination therapy based on SMP-NAs are summarized, with special emphasis on the structure-function relationships. Finally, the outlooks and potential challenges of SMP-NAs in cancer therapy are highlighted.
    MeSH term(s) Antineoplastic Agents ; Cell Line, Tumor ; Drug Delivery Systems ; Nanomedicine ; Nanoparticles ; Prodrugs
    Chemical Substances Antineoplastic Agents ; Prodrugs
    Language English
    Publishing date 2021-08-03
    Publishing country Germany
    Document type Journal Article ; Research Support, Non-U.S. Gov't ; Review
    ZDB-ID 2168935-0
    ISSN 1613-6829 ; 1613-6810
    ISSN (online) 1613-6829
    ISSN 1613-6810
    DOI 10.1002/smll.202101460
    Database MEDical Literature Analysis and Retrieval System OnLINE

    Full text online

    More links

    Kategorien

    Order via subito

    This service is chargeable due to the Delivery terms set by subito. Orders including an article and supplementary material will be classified as separate orders. In these cases, fees will be demanded for each order.

To top