Loading...
Search for:
tahaee--abdoreza
0.033 seconds
Damage Detection and Evaluation of Repair Materials and Techniques for Concrete Bridges
, M.Sc. Thesis Sharif University of Technology ; Joghataie, Abdoreza (Supervisor)
Abstract
Poor maintenance of concrete bridges in the past years in Iran, caused serious damages, so most of them need rehabilitation. The majority of repaired members are exposed to repeated damage because compatibility of repair material to substrate concrete not considered as well as weather and loading conditions. This study attempts to improve the repair achievement and durability of concrete bridges. This investigation contains two phases: preliminary study and experimental phase. Preliminary study attends to detect different types of damages of concrete bridges and their causes along with their propagation. The next part of this study discusses about various types of repair materials. In...
Synthesis and Characterization of ATPEG-PMDA Hydrogels Conjugated with Thermo-Responsive Coated Magnetic Nanoparticles for Cartilage Tissue Engineering
, M.Sc. Thesis Sharif University of Technology ; Simchi, Abdoreza (Supervisor)
Abstract
A novel thermo responsive decorated system is designed by coating Fe3O4 magnetic nanoparticles with conjugated Pluronic-ATPEG copolymer incorporated into the PEG-PMDA Hydrogel for drug delivery to the cartilage tissue. Grafted copolymer was synthesized by reaction between carboxylated Pluronic and amino terminated Poly ethylene glycol (ATPEG) and confirmed by FTIR and NMR analysis. The magnetic nanoparticles were modified with the produced copolymer and characterized by TEM, HRTEM, XRD, DLS, and VSM. A typical product has 13 nm magnetic core and 105 nm hydrodynamic diameter with narrow size distribution. DLS results showed that there was an increase in size by increasing temperature from 25℃...
A New Algorithm for Partitioning Problem in Hardware/Software Codesign
, M.Sc. Thesis Sharif University of Technology ; Jahangir, Amir Hossein (Supervisor)
Abstract
We use an abstract model to perform hardware/software partitioning for embedded systems. The complexity of partitioning problem in the model is studied and we use a scheme to overcome its NP-Hardness. Partitioning problem can be considered as the main phase of high level synthesis. As it suffers from complexity, heuristic search methods are generally used to overcome its complexity. In this thesis we present a heuristic method (named Tendency algorithm) to increase the performance of heuristic searches, and use it in parallel with other tuning methods. We defind suitable initial point(s) for heuristic searches instead of tuning heuristic parameters. The thesis justifies the logic behind...
A polynomial algorithm for partitioning problems
, Article Transactions on Embedded Computing Systems ; Volume 9, Issue 4 , 2010 ; 15399087 (ISSN) ; Jahangir, A. H ; Sharif University of Technology
2010
Abstract
This article takes a theoretical approach to focus on the algorithmic properties of hardware/software partitioning. It proposes a method with polynomial complexity to find the global optimum of an NP-hard model partitioning problem for 75% of occurrences under some practical conditions. The global optimum is approached with a lower bound distance for the remaining 25%. Furthermore, this approach ensures finding the 2-approximate of the global optimum partition in 97% of instances where technical assumptions exist. The strategy is based on intelligently changing the parameters of the polynomial model of the partitioning problem to force it to produce (or approach) the exact solution to the...
Improving the performance of heuristic searches with judicious initial point selection
, Article Proceedings of The 5th IEEE International Symposium on Embedded Computing, SEC 2008, 6 October 2008 through 8 October 2008, Beijing ; 2008 , Pages 14-19 ; 9780769533483 (ISBN) ; Jahangir, A. H ; Habibi Masouleh, H ; Sharif University of Technology
2008
Abstract
In this paper we claim that local optimization can produce proper start point for genetic search. We completely test this claim on partitioning problem and on the performance of genetic search in a real problem that is finding aggregation tree in the sensor networks. The presented method (named Tendency algorithm) increases the performance of heuristic searches, and can be used in parallel with other tuning methods. The paper justifies the logic behind tendency algorithm by measuring the "entropy" of solution (in regard to optimal solution), and by numerous empirical tests. © 2008 IEEE