Loading...
Search for: zarei--fatemeh
0.087 seconds

    Conflict-free Chromatic Art Gallery Covering with Vertex Guards

    , M.Sc. Thesis Sharif University of Technology Zarei Moradi, Somayeh (Author) ; Ghodsi, Mohammad (Supervisor)
    Abstract
    The visibility is one of the most important problems in computational geometry. Two points are said to be visible to each other, if the line segment that joins them does not intersect any obstacles. The art gallery problem is a well-studied visibility problem in computational geometry. It originates from a real-world problem of guarding an art gallery with the minimum number of guards who together can observe the whole gallery. In many of applications, the “guards” are “landmarks” deployed in an environment to help provide navigation and localization service to mobile robots. The mobile device communicates with these landmarks through wireless, or other “line-of-sight” signaling... 

    Modification of unscented kalman filter using a set of scaling parameters

    , Article IET Signal Processing ; Volume 12, Issue 4 , 2018 , Pages 471-480 ; 17519675 (ISSN) Zarei Jalalabadi, M ; Malaek, M. B ; Sharif University of Technology
    Institution of Engineering and Technology  2018
    Abstract
    This work, based on the standard unscented Kalman filter (UKF), proposes a modified UKF for highly non-linear stochastic systems, assuming that the associated probability distributions are normal. In the standard UKF with 2n + 1 sample points, the estimated mean and covariance match the true mean and covariance up to the third order, besides, there exists a scaling parameter that plays a crucial role in minimising the fourth-order errors. The proposed method consists of a computationally efficient formulation of the unscented transform that incorporates N - 1, N ≥ 2, constant parameters to scale 2n(N - 1) + 1 sample points such that the 2Nth order errors are minimised. The scaling parameters... 

    Touring convex polygons in polygonal domain fences

    , Article 11th International Conference on Combinatorial Optimization and Applications, COCOA 2017, 16 December 2017 through 18 December 2017 ; Volume 10628 LNCS , 2017 , Pages 61-75 ; 03029743 (ISSN); 9783319711461 (ISBN) Ahadi, A ; Mozafari, A ; Zarei, A ; Sharif University of Technology
    Springer Verlag  2017
    Abstract
    In the touring polygons problem (TPP), for a given sequence (s= P0, P1, ⋯, Pk, t = Pk+1) of polygons in the plane, where s and t are two points, the goal is to find a shortest path that starts from s, visits each of the polygons in order and ends at t. In the constrained version of TPP, there is another sequence (F0, ⋯, Fk) of polygons called fences, and the portion of the path from Pi to Pi+1 must lie inside the fence Fi. TPP is NP-hard for disjoint non-convex polygons, while TPP and constrained TPP are polynomially solvable when the polygons are convex and the fences are simple polygons. In this work, we present the first polynomial time algorithm for solving constrained TPP when the... 

    Recognition and Reconstruction of Visibility Gragh in Special Cases

    , M.Sc. Thesis Sharif University of Technology Yazdani Ghooshchi, Mina (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    For a simple polygon in the plane, the visibility graph is a graph whose vertices are the vertices of the polygon and there is an edge between two vertices if and only if their corresponding vertices see each other in the polygon. Two points of the polygon see each other if the line segment connecting them lies completely inside (or on the boundary of) the polygon. Although computing the visibility graph of a polygon has been solved efficiently, its reverse problem after three decades is still an open problem. The reverse problem is known as recognition and reconstruction visibility graphs. Recognizing visibility graphs is to determine the necessary and sufficient conditions on a graph to be... 

    Efficient Data Structures for Spatiotemporal Data

    , M.Sc. Thesis Sharif University of Technology Azizian Foumani, Arash (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    With rapid increase of availability of moving object data, especially with help of GPS, need for algorithms which can process spatiotemporal data and data structures capable of storing it efficiently, has been increased. One of spatiotemporal data applications is in wild life, which demands tracking of animal movements through time. One of problems introduced in this application is flock problem. Flock is a group of entities, which move together through time. There is a belief that in bulky data, there are a lot of hidden information and patterns. Hence, we believe that with help of flocks, we can get insight of animal behaviors in environment and to each other. In this thesis we will... 

    Fault detection and protection strategy for islanded inverter-based microgrids

    , Article IEEE Journal of Emerging and Selected Topics in Power Electronics ; 2019 ; 21686777 (ISSN) Zarei, F ; Mokhtari, H ; Blaabjerg, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    This paper proposes a fault detection and protection strategy for islanded inverter-based microgrids (IBMGs). Reliable and accurate protection is one of the main challenges in the proliferation of modern microgrids (MGs). Considering the limited fault current of the voltage-frequency controlled inverter-based distributed energy resources (VF-IBDERs), the protection is more challenging in islanded IBMGs. In this regard, the control scheme of VF-IBDER with a current limiting strategy plays an important role. Due to the limited fault currents close to the converter nominal current, the conventional fault detection methods do not work properly. In addition, bi-directional fault currents worsen... 

    The Effect of Martensite Volume Fraction on the Wear Resistance of Triple phase (Ferritic-Bainitic-Martensitic) Steels

    , M.Sc. Thesis Sharif University of Technology Zarei, Masoud (Author) ; Ekrami, Ali Akbar (Supervisor)
    Abstract
    In this study, the effect of martensite volume fraction on the wear behaviour of 4340 steel with triple-phase steel microstructure with a constant volume fraction of 34% ferrite was investigated. Using the Holman equation, it was found that triple-phase steel with different martensite volume fraction has two stages of work hardening. By increasing martensite volume fraction, yield strength and ultimate tensile strength and work hardening exponent of first and second stages increase and the elongation decreased. To perform the wear test, the pin on disc apparatus was used according to the ASTM G99 standard, and the test was done at two forces of 10 and 50 N at a fixed distance of 400 m. The... 

    Recognizing visibility graphs of triangulated irregular networks

    , Article Fundamenta Informaticae ; Volume 179, Issue 4 , 2021 , Pages 345-360 ; 01692968 (ISSN) Boomari, H ; 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... 

    Irregular Triangular Network Simplification Algorithm

    , M.Sc. Thesis Sharif University of Technology Moradi Koochi, Ali (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    One of the available methods for modeling a geographical area is sampling a series of points whose altitude is measured and the altitude of other points is estimated based on the altitude of sampled points. The use of irregular triangular networks (TIN) is one of the common methods for this estimation. Because the number of sample points is large, it is necessary to reduce them in some applications. This process reduces the number of points. The process of reducing the number of sample points is called simplification. Simplification should be done in such a way as to preserve all the main features of the original space. For this purpose, various methods have been presented, which we will... 

    Optimization of Bread Supply Chain by Using Machine Learning

    , M.Sc. Thesis Sharif University of Technology Jafari Dehkordi, Arash (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    Bread holds a significant place in the daily lives of Iranians, making the bread supply chain as one of the country's most vital product supply chain. The Iranian government has undertaken the responsibility of supplying the bread chain, and to achieve this, a specialized mother company was established. As a result, this company manages all aspects of this supply chain. Initially, the company's database and macro-policy objectives were examined to provide recommendations that align with its goals. One of the proposed suggestions was to optimize the extra-provincial transportation, which plays a crucial role in the supply chain. This proposal was chosen and thoroughly investigated. By... 

    Development of an Improved Wet/Drying Algorithm for Hydrodynamic Models to Ppredict Water Salinity in a Hypersaline Lake: the case of Lake Urmia

    , M.Sc. Thesis Sharif University of Technology Zarei Beydokhty, Alireza (Author) ; Safaie, Ammar (Supervisor)
    Abstract
    Considering the significant impact of salinity and temperature on the life of aquatic ecosystems, the growth of plants and animals, and the health of people; it is necessary to predict the spatiotemporal distribution of these qualitative characteristics in aquatic environments by using precise algorithms through hydrodynamic models. This research presents an improved algorithm for calculating qualitative characteristics of aquatic environments, such as salinity, during the wet/drying processes. The developed algorithm in this study has been incorporated into FVCOM which is a three-dimensional hydrodynamic model. The current algorithm governing the FVCOM model is not capable of accurately... 

    Investigation of hydrogen sensing properties and aging effects of Schottky like Pd/porous Si

    , Article Journal of Sensors and Actuators B: Chemical ; Volume 146, Issue 1 , 8 April , 2010 , PP. 53–60 Razi, F. (Fatemeh) ; Iraji Zad, A. (Azam) ; Rahimi, F. (Fereshteh) ; Sharif University of Technology
    2010
    Abstract
    We prepared porous silicon samples coated by continuous palladium layer in electroless process. Scanning electron microscopy (SEM) showed cauliflower-shape Pd clusters on the surface. I–V curves of Schottky like Pd/porous Si samples were measured in air and in hydrogen. These measurements showed a metal–interface–semiconductor configuration rather than an ideal Schottky diode. Variations of the electrical current in the presence of diluted hydrogen at room temperature revealed that the samples can sense hydrogen in a wide range of concentration (100–40,000 ppm) without any saturation behavior. Hydrogen sensing properties of these samples were investigated at room temperature for a duration... 

    An Integrated Active Circulator for Radar Transceivers with Shared Tx/Rx Antenna

    , M.Sc. Thesis Sharif University of Technology Masoumizadeh, Masoud (Author) ; Fotowat Ahmadi, Ali (Supervisor) ; Akbar, Fatemeh (Supervisor)
    Abstract
    The issue of automation has always been a concern for humans over the years. Replacing humans with machines or intelligent software to perform various tasks can significantly improve the accuracy and speed of those activities. One of the long-standing aspirations of humanity has been the automation of driving. In addition to freeing individuals from the time-consuming task of driving, automating vehicles can also dramatically reduce road accidents. To achieve this goal, vehicles need to be equipped with various sensors such as radar, cameras, lidar, and more. Each of these sensors has its advantages and disadvantages, and as a result, all of them must be used for safe driving. In this... 

    An Analitical Model for Grid Stiffened Structures of Various Patterns

    , M.Sc. Thesis Sharif University of Technology Zarei, Mohsen (Author) ; Kouchakzadeh, Mohammad Ali (Supervisor)
    Abstract
    Structural efficiency is a primary concern in today’s aerospace and aircraft industries. This brings about the need for strong and light weight structures. To increase the strength of a panel without considerable increase in its weight, we may use a lattice of stiffeners which may have shells connected to one side of the lattice or both sides of it. These structures are usually called grid stiffened structures. Aircraft fuselage and launch vehicle fuel tanks are some of the many applications of these structures in aerospace and aircraft industries. These structures include two major groups; isogrids (grid stiffened structures with equivalent isotropic properties) and orthogrids (grid... 

    Minimum Link Navigation

    , M.Sc. Thesis Sharif University of Technology Davari, Mohammad Javad (Author) ; Zarei, Ali Reza (Supervisor)
    Abstract
    Finding a path between two specified points is one of the most common problem in computational geometry. The minimum-link path problem is in this category. The minimum-link path between two points is the path between these points with the minimum number of segments. Minimum-link paths have application in areas such as computer graphic, geographic information systems, robotics, image processing, cryptography and VLSI.In this thesis we study variations of the minimum link path problem. Specifically we consider the constrained minimum-link paths in which the path must passes through some given
    regions. We detected a flaw in a previously presented algorithm and propose a method to fix this... 

    Geometric Algorithms for Covering a Point Set

    , M.Sc. Thesis Sharif University of Technology Hajiaghaei Shanjani, Sima (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    Covering problem is an interesting problem in computational geometry. In this problem, a geometric object and/or its location should be found for a set of points that encloses the points while optimizing an objective function such as area, perimeter, surface area, and volume. Minimum enclosing circle and minimum enclosing box are well-known problems in this field. According to the constraints of the problem, different types of this problem can be defined and utilized in many applications like geometric information systems (GIS), military and communication systems.Geometric algorithms for solving some special covering problems are found in this thesis. The problems involve using two or more... 

    The Completeness in Statistical Mechanics

    , M.Sc. Thesis Sharif University of Technology Zarei, Mohammad Hossein (Author) ; Karimipour, Vahid (Supervisor)
    Abstract
    Ising model. It means that the partition function of each lattice model is equal to the partition function of 2D Ising model. This completeness is proved by using concepts and techniques from quantum information theory and is based on the universality of cluster states. We have now proved this important result, by using independent and general concepts and methods which are accessible to a wide audience of researchers across many disciplines. Furthermore, our method has the advantage of eing algorithmic in nature so that, by following a set of simple graphical transformations, one is able to transform any discrete lattice model to an Ising model defined on a (polynomially) larger 2D... 

    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... 

    Risk assessment of vapor cloud explosions in a hydrogen production facility with consequence modeling

    , Article Journal of Research in Health Sciences ; Volume 13, Issue 2 , 2013 , Pages 181-187 ; 16822765 (ISSN) Zarei, E ; Jafari, M. J ; Badri, N ; Sharif University of Technology
    2013
    Abstract
    Background: New technologies using hazardous materials usually have certain risks. It is more serious when the technology is supposed to be applied in a large scale and become widely used by many people. The objective of this paper was to evaluate the risk of vapor cloud explosion in a hydrogen production process. Methods: Potential hazards were identified using the conventional hazard identification method (HAZID). The frequency of the proposed scenarios was estimated from statistical data and existing records. The PHAST professional software was applied for consequence modeling. Both individual and societal risks were evaluated. This cross-sectional study was conducted from June 2010 to... 

    Practical method to predict an upper bound for minimum variance track-to-track fusion

    , Article IET Signal Processing ; Volume 11, Issue 8 , 2017 , Pages 961-968 ; 17519675 (ISSN) Zarei Jalalabadi, M ; Malaek, S. M. B ; Sharif University of Technology
    2017
    Abstract
    This study deals with the problem of track-to-track fusion in a sensor network when the correlation terms between the estimates of the agents are unknown. The proposed method offers an upper bound for the optimal minimum variance fusion rule through construction of the correlation terms according to an optimisation scheme. In general, the upper bound filter provides an estimate that is more conservative than the optimal estimate generated by the minimum variance fusion rule, while at the same time is less conservative than one obtained by the widely used covariance intersection method. From the geometrical viewpoint, the upper bound filter results in the inscribed largest volume ellipsoid...