Loading...
Search for: zarei--parisa
0.115 seconds

    What drives mergers and acquisitions waves in developing countries? Evidences from Iranian banking industry

    , Article Iranian Economic Review ; Volume 19, Issue 2 , 2015 , Pages 123-137 ; 10266542 (ISSN) Zarei, M ; Alambeigi, A ; Karimi, P ; Zarei, B ; Sharif University of Technology
    2015
    Abstract
    Many Middle-East countries, like Iran, have dynamic banking industries and have observed merger and acquisitions (M&A) waves. M&A waves are usually defined in the developed world context and some of their main drivers were identified as: market timing, environment's shocks, merger manias, government regulation and regulatory, and technological changes. It has been discussed that merger waves and their reasons are among the ten most important unsolved mysteries in the field of finance (Brealey and Myers, 1991, p. 923), and as a result of this, it was not possible to completely clarify the reasons behind emerging M&A waves, especially in developing countries; for this reason in these... 

    The effects of mergers and acquisitions (M&As) on bank performance and entrepreneurial orientation (EO)

    , Article Iranian Entrepreneurship: Deciphering the Entrepreneurial Ecosystem in Iran and in the Iranian Diaspora ; 2017 , Pages 361-375 ; 9783319506395 (ISBN); 9783319506388 (ISBN) Zarei, M ; Alambeigi, A ; Zarei, B ; Karimi, P ; Sharif University of Technology
    Springer International Publishing  2017
    Abstract
    This chapter aims at pointing out that how mergers and acquisitions (M&As) as popular strategies which they are based on external growth approach have affected the performance of banks and entrepreneurial orientation (EO) in the context of Iranian financial sector. In this regard, it has been tried to investigate in what way EO moderates the relationships between the performance of banks in one hand, and M&As on the other hand. For this goal, 114 participants including the top and middle managers of the Iranian banks were chosen to be closely considered. The research is an applied research and a cross-correlation methodology has been used to spotlight on the probable relationships between EO... 

    Experimental Study of Drying and Calcination of Simulated High-Level Waste (HLW)

    , M.Sc. Thesis Sharif University of Technology Farahzadi, Zahra (Author) ; Samadfam, Mohammad (Supervisor) ; Zahakifar, Fazel (Supervisor) ; Zaheri, Parisa (Co-Supervisor)
    Abstract
    One of the novel methods of stabilization of nuclear waste is the use of vitrification technology. In order to stabilize high level wastes (HLLW) in glass, it is required that the elements are in their oxide form. Therefore, it is necessary to evaporate the waste and turn it into a solid form so that the elements can be converted into oxide form in the calcination furnace. Hence, one of the challenges of stabilization is the optimization of evaporation and calcination conditions. In this research, the parameters affecting evaporation were first investigated. Using laboratory measurements of application: temperature (110 to 180 °C), presence of nitric acid (0.5 to 4 mol/L), ratio of zirconium... 

    Fabrication Patient-Specific Drill Guide Templates for Cervical Pedicle Screw Placement

    , M.Sc. Thesis Sharif University of Technology Safahieh, Amir Hossein (Author) ; Arjmand, Navid (Supervisor) ; Parnianpour, Mohammad (Supervisor) ; Azimi, Parisa (Co-Supervisor)
    Abstract
    One of the most common spinal surgeries involves spinal fusion or vertebral fixation, which is used to treat various conditions such as intervertebral disc disease, scoliosis (lateral deviation of the spinal column), fractures, infections, or the presence of tumors in the spinal column. In this surgical procedure, the use of pedicle screws and titanium rods prevents motion and friction between two vertebrae. Screws may enter the vertebrae in the wrong position and angle, causing bone weakening, rupture of nerve roots or blood vessels, weakness or lack of sensation in some parts of the body, spinal cord injury, and in severe cases, paralysis of the patient. For this reason, fusion surgery is... 

    Efficient Visibility Computation and Simplification in Different Environments

    , Ph.D. Dissertation Sharif University of Technology Zarei, Alireza (Author) ; Ghodsi, Mohammad (Supervisor)
    Abstract
    In this thesis, we considered several types of the visibility problem. These problems include computing the visibility polygon of a point observer inside a polygonal domain, maintaining visibility polygon of a moving point observer, visibility coherence in space, maintaining visibility polygon of a moving segment observer and visibility dependent simplification. Furthermore, we considered these problems in both offline and streaming settings. These problems arise in different practical areas, such as computer graphics, machine vision, robotics, motion planning, geographic information systems (GIS) and computational geometry. We obtained effective theoretical results as well as superior... 

    Investigating Geometric Proximity Problems on Moving Points

    , M.Sc. Thesis Sharif University of Technology Rahmati, Zahed (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    An interesting theoretical and practical set of problems in computer science is concerned with the study of spatial relations among objects in a geometric space. Examples of such problems for a set of points P are finding the closest pair of the points P, partitioning space into regions such that all points of a region have minimum distance to the same point in P, and computing the Euclidean minimum spanning tree on P. Moreover, we need mechanisms to efficiently update these properties when the points P are allowed to move or may be inserted or deleted. This is to avoid re-computation of these properties from scratch. Here, we consider the Euclidean minimum spanning tree (EMST) of a set of... 

    Investigating Path Simplification Problems

    , M.Sc. Thesis Sharif University of Technology Emadi, Ghobad (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    A basic technique in data reduction is to approximate a collection of data by another collection of smaller size. Then, the resulted data are easier to be processed or maintained. An example of such large scale data is the ordered sequence of n points describing a path or a region boundary. We are given a sequence of points p , p , ..., p , and we consider the 1 2 n problem of approximating these points by a path with k < n line segments which error of this path is not greater than special value. Various criterions are defined to compute the path simplification error.This problem can be used in GIS, Image Processing and Computer Graphics problems. In this thesis, we consider special case... 

    Planar Visibility Counting

    , M.Sc. Thesis Sharif University of Technology Alipour, Sharareh (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    Planar visibility computing is defined as determining the region of the plane that is visible from a specific observer. This concept has many applications in computer graphics, robotic and computer games. In this thesis we consider two visibility problems: the visibility testing problem which checks the inter-visibility of two objects and the visibility counting problem which counts the number of visible objects from an observer. For these problems we propose new algorithms which have some improvements compare to the previous ones  

    Clustering Data Streams using Core-Sets

    , M.Sc. Thesis Sharif University of Technology Abdi, Masoud (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    We design a new algorithm for clustering data streams in any fixed di- mension, that use the framework of core-set to summarize data, in order to reduce the complexity of computation. Clustering is to separate data into distinct sets called clusters, which objects in the same cluster has the most similarity and objects in the different clusters has the least similarity.This problem has many application in the areas such as: machine learning,image processing, financial and stock transactions. Data stream has recently emerged as an important concept because in many applications, data is inherently streaming over a network or the data base is extremely large and sequential access is way faster... 

    Efficient Observer-Dependent Simplification in Polygonal Domains

    , Article Algorithmica (New York) ; April , 2011 , Pages 1-21 ; 01784617 (ISSN) Zarei, A ; Ghodsi, M ; Sharif University of Technology
    2011
    Abstract
    In this paper, we consider a special version of the well-known line-simplification problem for simplifying the boundary of a region illuminated by a point light source q, or its visibility polygon VP(q). In this simplification approach, we should take the position of q as an essential factor into account to determine the quality of the resulting simplification. For this purpose, we redefine the known distance- and area-distortion error criteria as the main simplification criteria to take into account the distance between the observer q and the boundary of VP(q). Based on this, we propose algorithms for simplifying VP(q). More precisely, we propose simplification algorithms of O(n2) and... 

    Line Simplifcation Using the Hausdorff Distance as Error Metric

    , M.Sc. Thesis Sharif University of Technology Naseri, Shahlla (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    Due to recent advancements and wide usage of location detection devices, huge amount of data are collected by GPS and cellular technologies which exhibits moving objects trajectories. Using this information, it is possible to track a set of objects over a long period of time, as happens for instance in studying animal migration. Always, in these situations it is undesirable or even impossible (due to process and storage limits) to store the complete stream of positioning data. Then, simplifying a trajectory as a data reduction technique is the option for resolving such problems. Moreover, there is an increasing interest in queries capturing ”aggregate” behavior of trajectories as groups like... 

    Experimental Study of the Hysteretic Behavior of a new Bracing System

    , M.Sc. Thesis Sharif University of Technology Zarei, Davood (Author) ; Khansari, Vahid (Supervisor)
    Abstract
    In this study, the behavior of a new innovative bracing system under cyclic loading and according to AISC code is investigated. An Ideal bracing system, in addition to having sufficient stiffness, should have a suitable ductility. Also, in order to prevent inelastic behavior of other structural members, braces, in addition to possessing high architectural adaptivity, must be able to contain the damage within itself and behave like a fuse. Three specimens with different sections, IPE100, HEA100 and 2UNP100, were designed and tested. The results of these tests represent an elastic- (approximately) perfectly plastic behavior of the brace if an appropriate section is used. Moreover, this bracing... 

    How a Change in Visibility Graph Affects its Underlying Polygon

    , M.Sc. Thesis Sharif University of Technology Esmradi, Ayda (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    The geometric deformation of the polygon naturally changes its Visibility Graph. Also, any change in the Visibility Graph, which includes adding or removing the edge, requires a change in the position of the polygon vertices. Of course, some changes in the graph may cause no polygon corresponding to such a graph.In this thesis, we want to study the necessary and sufficient conditions to change the Visibility Graph of a polygon, so that the new Visibility Graph corresponds to the graph obtained by adding the edge to the initial graph. We consider this problem in the case of spiral, funnel, and quasi-triangular input polygons  

    Valuation of Emerging Companies by Taking into Account the Rate of Discounting of the Variable and Volatility Changes Using the New Valuation Approaches

    , M.Sc. Thesis Sharif University of Technology Zarei, Hashem (Author) ; Modarres, Mohammad (Supervisor)
    Abstract
    Nowadays the evaluation startups has been difficult and this problem increases the likelihood of misunderstanding price of company's stock. Companies need precise evaluation in different steps of their development. during fund-raising, To make the investors’ share determine, the value of companies should be calculated because the investors’ share equals the ratio of new investment to the value of company after investment. Besides, during the merge or possession of a company, to determine the value of the deal or the share of the dealers, we need to evaluate value of the company. to evaluate the Intrinsic value of company, we need to know potential revenue streams, financial statements, the... 

    Finding the Hamiltonian Cycle Corresponding to the Boundary of a Pseudo-Triangle in its Visibility Graph

    , M.Sc. Thesis Sharif University of Technology Farokhi, Soheila (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    The visibility graph of a simple polygon represents visibility relations between its vertices. Since each vertex in a polygon is visible from the two vertices adjacent to it on the boundary of the polygon, this boundary is analogous to a Hamiltonian cycle in the visibility graph of the polygon. Therefore, visibility graphs are Hamiltonian. Finding this Hamiltonian cycle can be of great help when solving visibility graph recognition problems, in which one should decide whether a given graph is a visibility graph of a simple polygon; and reconstruction problems, which include constructing the polygon corresponding to a given visibility graph. These problems have been solved for the special... 

    Conditional Geometric Touringand Connectivity

    , Ph.D. Dissertation Sharif University of Technology Ahadi, Arash (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    Finding optimize tours on a given sequence of objects has applications in robitic. A tour on a given sequence of objects is a path that touchs or cuts each of them, in order. In STOC′03 it is shown that finding such a shortest path for a sequence of convex polygons is polynomial solvable and it is NP-hard for non-convex polygons with intersections. The complexity of the problem for disjoint polygons is asked as the importest open peoblem. In 2008 an approximation algorithm is presented for this problem. We show that the problem is NP-hard in each Lp norm, even if each polygon consists of two unit line segments. Also, in 2003 the problem, with obstacles has been proposed as a future work. An... 

    Permeability modeling using ANN and collocated cokriging

    , Article 72nd European Association of Geoscientists and Engineers Conference and Exhibition 2010: A New Spring for Geoscience. Incorporating SPE EUROPEC 2010 ; Volume 5 , 2010 , Pages 3939-3943 ; 9781617386671 (ISBN) Zarei, A ; Masihi, M ; Sharif University of Technology
    Society of Petroleum Engineers  2010
    Abstract
    Obtaining a reliable reservoir permeability map that is consistent with all available data is of great important for reservoir engineers. However, there is not enough core from existing wells to estimate the reservoir permeability directly but Well log data are more widely available. This study aims to model permeability within the reservoir while there is no enough data. In particular, we use artificial neural networks to estimate permeability using four input logs of sonic, gravity, porosity and neutron logs in six existing wells. In order to eliminate the correlated data, we have done Principal Component Analysis on selected input logs. Collocated cokriging is considered as a valuable... 

    On Characterizing TIN Visibility Graph

    , M.Sc. Thesis Sharif University of Technology Ostovari, Mojtaba (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    A triangulated irregular network (TIN) is a data structure that is usually used for representing and storing a geographic surface. TIN is a set of points and some segments between them that are distributed in space such that projection of segments on the plane is a triangulation for projection of points. Visibility graph of points is a graph in which there is a vertex correspond to each point of TIN and there is an edge between two vertexes if corresponding points can see each other. TIN’s visibility graph has many applications; for example, finding some points in a geographic surface that they can see all of the surface together, they are good places for radars.in first section of this... 

    A practical approach for planar visibility maintenance

    , Article Journal for Geometry and Graphics ; Volume 13, Issue 1 , 2009 , Pages 75-90 ; 14338157 (ISSN) Zarei, A ; Ghodsi, M ; Sharif University of Technology
    2009
    Abstract
    In this paper, we propose a method for maintaining the region visible from a moving point observer inside a planar scene. In this method, we check the observer position in discrete time-stamps to detect and apply changes to the visible or illuminated region of a moving point observer q, or VP(q). We efficiently maintain a list C(q) of edges in VP(q) which are subject to change during the motion. In each time-stamp that VP(q) is to be updated, we only refine and redraw the view against the edges of C(q) that indicate the positions of the visibility changes. We build an enriched representation of the visibility graph in a preprocessing step to apply the required updates on C(q) efficiently and... 

    Formation of Zn-Ca-Ni tri cation's phosphate coating on steel and study that properties

    , Article TMS 2009 - 138th Annual Meeting and Exhibition, San Francisco, CA, 15 February 2009 through 19 February 2009 ; Volume 1 , 2009 , Pages 615-623 ; 9780873397384 (ISBN) Zarei, M ; Afshar, A ; Sharif University of Technology
    2009
    Abstract
    A new Zinc phosphating bath, which produces coatings at relatively lower temperatures within a reasonable time by using of chemical accelerators has been devised. Improvement of the bath performance by the addition of divalent cations like calcium, nickel has been studied. Bath formulation and operating conditions have been optimized by coating weight determinations. Stable samples of phosphating formulations with and without calcium and nickel salts were prepared and the structure and morphology of the phosphate coatings were determined by using X-ray diffraction (XRD) techniques, scanning electron microscopy. ASTMB117 salt spray test and electrochemical impedance spectroscopy (EIS) were...