Showing 1 - 20 results of 64 for search 'The L.A. Complex', query time: 0.15s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12

    DNA Cleavage, Cytotoxic Activities, and Antimicrobial Studies of Ternary Copper(II) Complexes of Isoxazole Schiff Base and Heterocyclic Compounds by Vijay Kumar Chityala, K. Sathish Kumar, Ramesh Macha, Parthasarathy Tigulla, Shivaraj

    Published 2014-01-01
    “…Novel mixed ligand bivalent copper complexes [Cu. L. A. ClO4] and [Cu. L. A] where “L” is Schiff bases, namely 2-((3,4-dimethylisoxazol-5-ylimino)methyl)-4-bromophenol (DMIIMBP)/2-((3,4-dimethylisoxazol-5-ylimino)methyl)-4-chlorophenol (DMIIMCP), and “A” is heterocyclic compound, such as 1,10-phenanthroline (phen)/2,21-bipyridyl (bipy)/8-hydroxyquinoline (oxine)/5-chloro-8-hydroxyquinoline (5-Cl-oxine), have been synthesized. …”
    Get full text
    Article
  13. 13
  14. 14

    The enigmatic diploid Chenopodium ucrainicum (Chenopodiaceae / Amaranthaceae s. l.): geographical, ecological, and phytosociological patterns as clues to its origin by Shynder O.I., Pashkevych N.A., Kharytonova I.P., Holovko O.V., Mandák B., Mosyakin S.L.

    Published 2024-12-01
    “…Chenopodium ucrainicum Mosyakin & Mandák (Chenopodiaceae / Amaranthaceae s. l.), a newly described diploid species currently known only from Ukraine, is a distinctive yet still enigmatic element of the Ukrainian flora. …”
    Get full text
    Article
  15. 15

    Trojan message attack on the concatenated hash functions by Shi-Wei CHEN, INChen-Hui J

    Published 2016-08-01
    “…The Trojan message attack was proposed by Andreeva,et al.aiming at the hash functions with MD structure.First it was applied on the hash function beyond MD structure,that was,concatenated hash.Utilizing the property of the concatenated hash,and combining the Joux's multicollision and the “diamond” structure with the depth of n−l,a Trojan message of the length n 2<sup>k</sup>· blocks for the 2n-bit concatenated hash was constructed,based on which a chosen-prefix Trojan message attack was first proposed.And the memory complexity of proposed attack is about 2l+2<sup>n−l+1</sup>+n·2<sup>k+1</sup>blocks and the time complexity is about O (n·2<sup>n+k</sup>+l·2<sup>l</sup>)computations of the compression function,much less than the ideal value O(n·2<sup>2n+k</sup>).…”
    Get full text
    Article
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20