Wyniki wyszukiwania dla: ALLIANCE - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: ALLIANCE
Przykład wyników znalezionych w innych katalogach

Wyniki wyszukiwania dla: ALLIANCE

  • Life Science Alliance

    Czasopisma

    eISSN: 2575-1077

  • Mission impossible for cellular internalization: When porphyrin alliance with UiO-66-NH2 MOF gives the cell lines a ride

    Publikacja
    • S. Ahmadi
    • V. Jajarmi
    • M. Ashrafizadeh
    • A. Zarrabi
    • J. Haponiuk
    • M. Saeb
    • E. C. Lima
    • M. Rabiee
    • N. Rabiee

    - JOURNAL OF HAZARDOUS MATERIALS - Rok 2022

    Is it possible to accelerate cell internalization by hybridization of nanomaterials? Herein we support the realization of using metal-organic frameworks (MOFs) with the assistance of rigid porphyrin structure (H2TMP) aimed at drug loading, drug release, relative cell viability, and targeted in vitro drug delivery. There are several MOFs, i.e., UiO-66-NH2 (125 ± 12.5 nm), UiO-66-NH2 @H2TMP (160 ± 14 nm), UiO-66-NH2 @H2TMP@DOX, and...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The Strategic Partnership Between India and the United States of America and How China’s Influence Challenges the India-Us Alliance in the Indo-Pacific Region

    Publikacja

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Global edge alliances in graphs

    In the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...

    Pełny tekst do pobrania w portalu

  • Tight bounds on global edge and complete alliances in trees

    In the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Global defensive secure structures

    Publikacja

    Let S ⊂ V (G) for a given simple non-empty graph G. We define for any nonempty subset X of S the predicate SECG,S(X) = true iff |NG[X]∩S| ≥ |NG[X]\S|. Let H be a non-empty family of graphs such that for each vertex v ∈ V (G) there is a subgraph H of G containing v and isomorphic to a member of H. We introduce the concept of H-alliance extending the concept of global defensive secure structures. By an H-alliance in a graph G we...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Global defensive sets in graphs

    In the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...

    Pełny tekst do pobrania w portalu

  • Strategic balance in graphs

    For a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...

    Pełny tekst do pobrania w portalu

  • Magdalena Popowska dr

    Absolwentka Uniwersytetu im Adama Mickiewicza w Poznaniu oraz Ecole Supérieure de Commerce w Rouen. Pracownik badawczo dydaktyczny, autorka i recenzentka wielu artykułów publikowanych w czasopismach krajowych i międzynarodowych. Przez wiele lat odpowiedzialna za procesy internacjonalizacji, w latach 2008-2016 jako prodziekan ds. międzynarodowych i publicznych, a 2016-2020 jako pełnomocnik dziekana ds. współpracy międzynarodowej....

  • Ireneusz Czarnowski Prof.

    Osoby

    IRENEUSZ CZARNOWSKI is a graduate of the Faculty of Electrical Engineering at Gdynia Maritime University. He gained a doctoral degree in the field of computer science at Poznan University of Technology and a postdoctoral degree in the field of computer science at Wroclaw University of Science and Technology. Since 1998 is associated with Gdynia Maritime University, currently is a professor of computer science in the Department...