Loading...
Search for: rahmati--z
0.01 seconds

    PH-Responsive chitosan-adorned niosome nanocarriers for co-delivery of drugs for breast cancer therapy

    , Article ACS Applied Nano Materials ; Volume 5, Issue 7 , 2022 , Pages 8811-8825 ; 25740970 (ISSN) Karimifard, S ; Rezaei, N ; Jamshidifar, E ; Moradi Falah Langeroodi, S ; Abdihaji, M ; Mansouri, A ; Hosseini, M ; Ahmadkhani, N ; Rahmati, Z ; Heydari, M ; Vosough, M ; Akbarzadeh, I ; Mostafavi, E ; Sharif University of Technology
    American Chemical Society  2022
    Abstract
    Breast cancer incidence has increased in recent decades. In the present study, an optimum formulation of chitosan (CS)-adorned niosome-based nanocarriers for co-delivery of doxorubicin (DOX) and vincristine (VIN) was developed for the treatment of breast cancer to reduce drug doses and overcome multidrug resistance. The three-level Box-Behnken method was utilized to optimize the particles in terms of size, polydispersity index (PDI), entrapment efficacy (EE (%)), and percent of drug release (%). The release rate of two drugs from CS-adorned nanoparticles (DOX+VIN/Nio/CS) in acidic and physiological pH is less than uncoated niosome (DOX+VIN/Nio). In addition, acidic pH increases the release... 

    Kinetic pie delaunay graph and its applications

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 7357 LNCS , 2012 , Pages 48-58 ; 03029743 (ISSN) ; 9783642311543 (ISBN) Abam, M. A ; Rahmati, Z ; Zarei, A ; Sharif University of Technology
    2012
    Abstract
    We construct a new proximity graph, called the Pie Delaunay graph, on a set of n points which is a super graph of Yao graph and Euclidean minimum spanning tree (EMST). We efficiently maintain the Pie Delaunay graph where the points are moving in the plane. We use the kinetic Pie Delaunay graph to create a kinetic data structure (KDS) for maintenance of the Yao graph and the EMST on a set of n moving points in 2-dimensional space. Assuming x and y coordinates of the points are defined by algebraic functions of at most degree s, the structure uses O(n) space, O(nlogn) preprocessing time, and processes O(n 2 λ 2s∈+∈2(n)β s + 2(n)) events for the Yao graph and O(n 2 λ 2s + 2(n)) events for the...