Loading...
Search for:
boomari--hossein
0.141 seconds
Total 1206 records
3D-Reconstruction Using Static and Mobile Stereo-Camera for 3D-Reconstruction
, M.Sc. Thesis Sharif University of Technology ; Zarei, Alireza (Supervisor)
Abstract
3D-object modeling and its representation in computers are one of the interested fields in computer science and engineering and problems like object and environment modeling, representation, storage and physical interactions are some of the important problems in this field. Increasing the applications of the technologies like localization, machine vision and virtual reality made the 3D-object modeling and its related problems, like 3D-model extraction and reconstruction, a nowadays interested challenges and a variety of solutions such as time of flight sensors,
structured light, sonar sensors and multi-camera reconstruction are presented for it. Multi-camera solutions, just like the...
structured light, sonar sensors and multi-camera reconstruction are presented for it. Multi-camera solutions, just like the...
Visibility graphs of anchor polygons
, Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 26 August 2015 through 28 August 2015 ; Volume 9541 , 2016 , Pages 72-89 ; 03029743 (ISSN) ; 9783319286778 (ISBN) ; Zarei, A ; Sharif University of Technology
Springer Verlag
2016
Abstract
Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge between their corresponding vertices in the graph. Two vertices of a polygon see each other if and only if their connecting line segment completely lies inside the polygon. Recognizing visibility graphs is the problem of deciding whether there is a simple polygon whose visibility graph is isomorphic to a given graph. Another important problem is to reconstruct such a polygon if there is any. These are well-known and well-studied, but yet open problems in...
Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
, Article 3rd IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2020, 1 July 2020 through 2 July 2020 ; Volume 12281 LNCS , 2020 , Pages 61-71 ; Farokhi, S ; Sharif University of Technology
Springer Science and Business Media Deutschland GmbH
2020
Abstract
Visibility graph of a simple polygon is a graph with the same vertex set in which there is an edge between a pair of vertices if and only if the segment through them lies completely inside the polygon. Each pair of adjacent vertices on the boundary of the polygon are assumed to be visible. Therefore, the visibility graph of each polygon always contains its boundary edges. This implies that we have always a Hamiltonian cycle in a visibility graph which determines the order of vertices on the boundary of the corresponding polygon. In this paper, we propose a polynomial time algorithm for determining such a Hamiltonian cycle for a pseudo-triangle polygon from its visibility graph. © 2020, IFIP...
Visibility graphs of anchor polygons
, Article Journal of Graph Algorithms and Applications ; Volume 26, Issue 1 , 2022 , Pages 15-34 ; 15261719 (ISSN) ; Zarei, A ; Sharif University of Technology
Brown University
2022
Abstract
The visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge between their corresponding vertices in the graph. Two vertices of a polygon see each other if and only if their connecting line segment completely lies inside the polygon. Recognizing visibility graphs is the problem of deciding whether there is a simple polygon whose visibility graph is isomorphic to a given graph. Another important problem is to reconstruct such a polygon if there is any. These problems are well known and well-studied, but yet open...
Recognizing visibility graphs of triangulated irregular networks
, Article Fundamenta Informaticae ; Volume 179, Issue 4 , 2021 , Pages 345-360 ; 01692968 (ISSN) ; Ostovari, M ; Zarei, A ; Sharif University of Technology
IOS Press BV
2021
Abstract
A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose projection on the XY-plane is a triangulation. The visibility graph of a TIN is a graph whose vertices correspond to the vertices of the TIN and there is an edge between two vertices if their corresponding vertices on TIN see each other, i.e. the segment that connects these vertices completely lies above the TIN. Computing the visibility graph of a TIN and its properties have been considered thoroughly in the literature. In this paper, we consider this...
Calculation of the Energy Release Rate of Nano-Cracks in FCC Materials Via the Many Body Atomic Scale FEM
, M.Sc. Thesis Sharif University of Technology ; Mohammadi Shodja, Hossein (Supervisor)
Abstract
Since the classical continuum theory fails to deal with the problems associated with defects, stress concentrators, and relevant deformation phenomena in solids, alternative approaches that can detect the atomistic nature of materials' fracture are required. The deficiency of the capture the size effect which yields delusively high values for some components of the stress field right on the edge of the stress concentrators, and its weakness in describing the complex interaction between small inhomogeneities, cracks and the like when they are only a few nanometers apart, are among some of the disadvantages of the classical approach. In recent years, however, atomistic methods are emerging to...
Semisolid Stir Joining of As-Cast Silicon-Aluminum Bronze
, M.Sc. Thesis Sharif University of Technology ; Kokabi, Amir Hossein (Supervisor) ; Ashuri, Hossein (Supervisor)
Abstract
Aluminum Bronzes have many applications in marine environments. These alloys suffer from both hot cracking and cold cracking. In order to overcome the hot cracking and cold cracking, Semisolid Stir Joining method and a proper thermal cycle was used respectively. Effects of temperature, stirring rate, and tool type were investigated in Semisolid Stir joining method. In this method, butt joint design was used in order to place specimens, and the specimens were heated up to specific temperatures (920, 925, 930°C). A stirrer (Cylindrical and Grooved tool) with three rotational speeds (800, 1200, 1600 RPM) was introduced into the stir weld seam. Welded specimens were cooled to the 900°C...
The Study of Eliminating Gender Gap in Iran Labor Market on Participation Rate of Married Urban Women
, M.Sc. Thesis Sharif University of Technology ; Rahmati, Mohammad Hossein (Supervisor) ; Joshaghani, Hossein (Supervisor)
Abstract
The low female labor force participation rate in the Iranian labor market relative to the global average and even to countries that do not differ significantly from the socio-economic characteristics of our country is one of the important questions of the Iranian labor market. In this study, we seek to answer the question of whether the economic participation rate of married women will increase if the gender gaps in wages, job findings and job losses among women and men are eliminated in the Iranian labor market. To answer this question using household expenditure and income data and labor force data, we show that between the two categories of occupations, in terms of the share of women's...
Graph homomorphisms through random walks [electronic resource]
, Article Journal of Graph Theory ; 2003, Volume 44, Issue 1, pages 15–38 ; Hajiabolhassan, Hossein ; Sharif University of Technology
Abstract
In this paper we introduce some general necessary conditions for the existence of graph homomorphisms, which hold in both directed and undirected cases. Our method is a combination of Diaconis and Saloff–Coste comparison technique for Markov chains and a generalization of Haemers interlacing theorem. As some applications, we obtain a necessary condition for the spanning subgraph problem, which also provides a generalization of a theorem of Mohar (1992) as a necessary condition for Hamiltonicity. In particular, in the case that the range is a Cayley graph or an edge-transitive graph, we obtain theorems with a corollary about the existence of homomorphisms to cycles. This, specially, provides...
Unique list-colourability and the fixing chromatic number of graphs [electronic resource]
, Article Discrete Applied Mathematics ; Volume 152, Issues 1–3, 1 November 2005, Pages 123–138 ; Hajiabolhassan, Hossein ; Sharif University of Technology
Abstract
In this paper we introduce a chromatic parameter, called the fixing chromatic number, which is related to unique colourability of graphs, in the sense that it measures how one can embed the given graph G in G∪Kt by adding edges between G and Kt to make the whole graph uniquely t-colourable. We study some basic properties of this parameter as well as its relationships to some other well-known chromatic numbers as the acyclic chromatic number. We compute the fixing chromatic number of some graph products by applying a modified version of the exponential graph construction
Circular colouring and algebraic no-homomorphism theorems
, Article European Journal of Combinatorics ; Volume 28, Issue 6, August 2007, Pages 1843–1853 ; Hajiabolhassan, Hossein ; Sharif University of Technology
Abstract
In this paper, we apply some new algebraic no-homomorphism theorems in conjunction with some new chromatic parameters to estimate the circular chromatic number of graphs. To show the applicability of the general results, as a couple of examples, we generalize a well known inequality for the fractional chromatic number of graphs and we also show that the circular chromatic number of the graph obtained from the Petersen graph by excluding one vertex is equal to 3. Also, we focus on the Johnson–Holroyd–Stahl conjecture about the circular chromatic number of Kneser graphs and we propose an approach to this conjecture. In this regard, we introduce a new related conjecture on Kneser graphs and we...
Density and power graphs in graph homomorphism problem
, Article Discrete Mathematics ; Volume 308, Issue 17, 6 September 2008, Pages 4027–4030 ; Hajiabolhassan, Hossein ; Sharif University of Technology
Abstract
We introduce two necessary conditions for the existence of graph homomorphisms based on the concepts of density and power graph. As corollaries, we obtain a lower bound for the fractional chromatic number, and we set forward elementary proofs of the facts that the circular chromatic number of the Petersen graph is equal to three and the fact that the Coxeter graph is a core
Temperature dependence study of nonocontact AFM images using molecular dynamics simulations [electronic resource]
, Article Int. Journal of Modern Physics ; 2012, Vol. 5, pp. 418-432 ; Meghdar, Ali ; Sharif University of Technology
Abstract
The effect of temperature on the noncontact atomic force microscopy (NC-AFM) surface imaging is investigated with the aid of molecular dynamics (MD) analysis based on the Sutton-Chen (SC) interatomic potential. Particular attention is devoted to the tip and sample flexibility at different temperatures. When a gold coated probe is brought close to the Au (001) surface at high temperatures, the tip and surface atoms are pulled together and their distance becomes smaller. The tip and sample atoms displacement varies in the different environment temperatures and this leads to the different interaction forces. Along this line, to study the effect of temperature on the resulting images, we have...
Developing an Analytical Model for Predicting the Residual Stresses Induced by Shot Peening with Considering the Effect of Initial Surface Treatment
, Ph.D. Dissertation Sharif University of Technology ; Farrahi, Gholam Hossein (Supervisor) ; Mahmoudi, Amir Hossein (Co-Supervisor)
Abstract
Shot peening is a cold-working process commonly used in industry to improve the fatigue performance, stress corrosion resistance and surface nano-crystallization of metallic parts. This process extends fatigue life via two mechanisms: Preventing the crack growth due to compressive residual stresses and, preventing the crack initiation because of increased material hardness. These mechanisms are the results of the bombardment of the component's surface with small spherical particles. In this research, an analytical model is developed for estimating the residual stress distribution induced by shot peening process. The modifications of the developed analytical model are related to...
Combustible organic materials : determination and prediction of combustion properties
, Book
De Gruyter
2018
Evaluating Reliability of SSDs Against Power Outage
, M.Sc. Thesis Sharif University of Technology ; Asadi, Hossein (Supervisor)
Abstract
Solid-State Drives (SSDs) provide high performance, low power consumption, and hence are widely used in the I/O cache of enterprise storage systems and high performance servers. Although employing high performance SSDs in the I/O cache of storage systems significantly improves system performance, it comes with significant reliability threats for write operations upon power failures. In order to provide high level of reliability, storage architectures employ SSDs in I/O cache with RAID-1 configuration, however, such configuration only partially mitigates the reliability issues of the SSDs. In this thesis, we analyze the reliability of SSD-based I/O caches against power outage and high...
On the isoperimetric spectrum of graphs and its approximations [electronic resource]
, Article Journal of Combinatorial Theory, Series B ; Volume 100, Issue 4, July 2010, Pages 390–412 ; Hajiabolhassan, Hossein ; Javadi, Ramin ; Sharif University of Technology
Abstract
In this paper1 we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the nth mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set of n disjoint subsets of the vertex set of the graph. We show that the second mean isoperimetric constant in this general setting, coincides with (the mean version of) the classical Cheeger constant of the graph, while for the rest of the spectrum we show that there is a fundamental difference between the nth isoperimetric constant and the number obtained by taking the minimum over all n-partitions. In this direction, we show that our definition is the...
Optimal Trajectory Planning for Flight through Microburst Wind Shears
,
M.Sc. Thesis
Sharif University of Technology
;
Pourtakdoost, Hossein
(Supervisor)
Abstract
An optimal trajectory for flight through Microburst wind shears is designed which minimizes the maximum deviation from desired trajectory With respect to optimal control methods. The suitable performance of airplane retrieval in abort landing and landing phases at microburst encounter is achieved by influence of mentioned design in worse case of wind fluctuation and variation. 3D Vicroy microburst model is selected to investigate its effects on 6 DOF jet engine aircraft EOMs. Above optimal control problem is solved using gradient method of SD . Furthermore, sensitivity of optimal trajectory to lateral and longitudinal location of microburst, microburst parameters, throttle setting and...
Solving the Bus Rapid Transit Network Design Problem with Ant System Algorithm (in Realistic Urban Network)
, M.Sc. Thesis Sharif University of Technology ; Poorzahedy, Hossein (Supervisor)
Abstract
Network design problem (NDP) is an important problem in transportation planning, in which transit network design is one the most important problems. Public transportation means, however, can not meet urban mobility needs in the developing countries satisfactorily. Bus services are usually unsuitable, insufficient, and unreliable. Bus Rapid Transit (BRT) system, is an emerging public transport alternative designed to provide appropriate, low cost, and effective services, and improve mobility in both developed and developing countries. To design public transportation systems, existing constraints such as resources and budget have to be considered to serve estimated demand properly. Bus Rapid...
Design of a Smart Algorithm Based on Two Dimensional Wavelet Transformation for Detection and Classification of Power Quality Disturbances
, M.Sc. Thesis Sharif University of Technology ; Mokhtari, Hossein (Supervisor)
Abstract
Power Quality can be simply defined as the quality of voltage at electrical loads. Detection and classification of voltage and current disturbances is of high importance in power system protection and monitoring. This procedure cannot be implemented by operators because of the high volume of the data which must be processed. So, it is needed to automate this procedure. Systems designed for this purpose usually contain three main parts: feature generation, feature selection and classifier design. The algorithms used for feature generation for power quality disturbances are mainly based on discrete Fourier transformation or discrete wavelet transformation. These approaches have shown some...