Sharif Digital Repository

This thesis is a research corresponding to Super-Hydrophobic condensation substrates with Nanometer texture. In this study, the foresaid surfaces are fabricated by two methods that are Nano-composite paint and Electrophoretic coating. As a summary for the first method (the Super-Hydrophobic Nano-composite paint), the hybrid coating contains two mineral and organic phases; The organic phase is a two-part clear-coat polyurethane and plays the role as a polymer matrix in Nano-composite structure. Silica Nano-particles are the mineral phase and the two phases of Nano-composite have made connection with silane compounds. Also, surface-modification in Nano-particles for giving hydrophobicity... 

Wireless Sensor Networks (WSNs) are prone to faults due to battery depletion of nodes, where a node failure can disturb routing, as it plays a key role in transferring sensed data to the end users. A WSN may be partitioned into groups of nodes called clusters; for every cluster, there is a node, called Cluster Head (CH) that is responsible for collecting and transferring data from all nodes in that cluster. This means that the CH is a single point of failure; i.e., once a CH fails, the whole cluster will fail, which leads to inability of its members for transferring data outside the cluster. This thesis presents a Fault-Tolerant and Energy-Aware algorithm (FTEA), which prolongs the lifetime... 

In this study a new SPH model for solving free surface and fluid-fluid interaction problems is presented. The numerical model is capable of simulating two dimensional hydraulic problems with arbitrary boundary and initial conditions and large number of particles. It has the ability to model multi-fluids domain with different densities and viscosities. Several corrections are implemented in SPH formulation such as treatment of free surface and correction of viscous term in order to conserve the angular momentum. Several examples are conducted in fluid-fluid domains to measure the capability of model in this area of study. This new model use Incompressible SPH method for more accurate... 

The goal of this research is the probabilistic estimation of time and cost of the process of seismic retrofitting of structural elements of buildings. In the past, many models have been proposed for estimating the cost of retrofitting buildings, especially masonry buildings. Most of these models have been developed using data from a limited number of retrofitting projects and employing methods such as fitting or regression. A review of the technical literature shows that previous research has not modeled the execution of building retrofitting operations and their complexities, which significantly affect the cost of these projects. Furthermore, the duration of building retrofitting operations... 

Cable-driven robots are referred to as parallel robots actuated with cables. In fact,in such robots rigid links are replaced by cables, which may be extended to desired lengths without making mechanism much heavy. This robot possesses a number of unique properties that makes it suitable for many industrial applications. The main factor which makes cable robots analysis different from other parallel robots is the incapability of cables to push objects. Hence, obtaining the workspace of a cable robot is one of the most important subjects associated with this type of robot.The goal of this thesis is to design a spatial translational cable driven robot, which may be used for object handling. For... 

Uncertain fuel prices and also global climate changes are accompanied by some state initiatives such as renewable portfolio standards (RPS). This has caused a fast growth in the amount of renewable energy installed worldwide especially wind energy over last decades. However, the intrinsic characteristics of wind farms output power, i.e. intermittency and volatility of wind speed along with being non-dispatchable in output generation of wind turbine raises many new technical and financial challenges for power system operators and planners. Up to these issues, large level of wind power penetration causes a growing concern in wind energy curtailment issue which the wind farm’s operator may be... 

In recent decades the use of FRP materials for strengthening structures has been developed extensively, thanks to their high strength, sufficient stiffness, high durablity, and ease of use. A great deal of research has been conducted on strengthening reinforced concrete beams and columns with FRP composites. By contrast, not many researches are performed on slabs, especially two-way slabs. In these few researches, the loading and boundary conditions are limited to simplest ones. Therefore, in this thesis, the focus of attention is on strengthening reinforced concrete slabs under various loads and boundary conditions using FRP composites.
In this thesis, first, FRP composites and their... 

Access to global memory is one of the bottlenecks in performance and energy in GPUs. Graphical processors uses multi-thread in streaming multiprocessors to reduce memory access latency. However, due to the high number of concurrent memory requests, the memory bandwidth of low level memorties and the interconnection network are quickly saturated. Recent research suggests that adjacent thread blocks share a significant amount of data blocks. If the adjacent thread blocks are assigned to specific streaming multiprocessor, shared data block can be rused by these thread blocks. However the thread block scheduler assigns adjacent thread blocks to different streaming multiprocessors that increase... 

One of the key subjects in the area of mathematical optimization is a class of problems known as combinatorial optimization. We can find the optimal solution of continuous optimization problems feasible in time. But, in combinatorial optimization, we aim to obtain the optimal solution of the problem over a finite set. These problems are NP-hard and no polynomial-time solution has been proposed for this class of problems so far. Thus, in practical scenarios, we often use heuristic methods for solving NP-hard problems. There are lots of heuristic methods and choosing the best one in different situations might be challenging. In recent years, with the advances in deep neural networks,... 

Let D be an F-central division algebra of index n. In this thesis a criterion for the triviality of the group G(D) = D^*/Nrd_(D/F) (D^*)D^' is presented and thus generalizing various related results published recently. To be more precise, it is shown that G(D) = 1 if and only if SK〗_1 (D) = 1 and (F^* )^2=(F^* )^2n. By using this, the role of some particular subgroups of D* in the algebraic structure of D is investigated. In this direction, it is proved that a division algebra D of prime index is a symbol algebra if and only if D* contains a non-abelian nilpotent subgroup  

Design of complex systems requires different challenges to be met simultaneously. Yet the current methods lack a sound theoretic framework and thus designers normally rely on heuristic or empirical methods; based on available experiences. Such approaches to the system design entail both technical and business risks and subsequently increase the probability of long-term problems. In this research, along with the theoretical framework of the systems design concepts, we discuss number of important models. The main concentration of the work, however, is to; somehow, correlate Axiomatic Design Matrix (ADM) with Design Structure Matrix (DSM). Here we exploit mathematical model based on sets and by... 

Nowadays, thanks to improvement of processing hardware and plenty of data available, artificial intelligence and specifically Deep Learning are being one of the powerful tools for solving different problems. Also graph is one of the powerful tools for modeling different data structures. Graph matching is one of the problems in the field of graph problems.In this thesis we consider the problem of graph matching in Erdos-Renyi graphs. The graph matching problem refers to recovering the node-to-node correspondence between two correlated graphs. Previous works theoretically showed that recovering is feasible in sparse Erdos-R´enyi graphs if and only if the probability of having an edge between a...