Loading...
Search for:
zarei--alireze
0.089 seconds
Total 126 records
Characterizing an Environment from Visibility Information
, M.Sc. Thesis Sharif University of Technology ; Zarei, Alireze (Supervisor)
Abstract
Using visual information of an environment is the immediate way of detecting and identifying an unknown environment. These information maybe obtained using straight visibility detecting sensors. One of the formal models of these visual information is the visibility graph which have a vertex for each vertex (corner point) of the environment and two vertices have an edge whenever their corresponding corners see each other. Then, the problem is to characterize such a graph and reconstruct the target environment with equivalent visibility graph. Despite existence of plenty of research results, these are open problems in computational geometry and rigid results exist only for limited special...
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) ; 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) ; 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...
Efficient Observer-Dependent Simplification in Polygonal Domains
, Article Algorithmica (New York) ; April , 2011 , Pages 1-21 ; 01784617 (ISSN) ; 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...
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) ; 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...
A practical approach for planar visibility maintenance
, Article Journal for Geometry and Graphics ; Volume 13, Issue 1 , 2009 , Pages 75-90 ; 14338157 (ISSN) ; 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) ; 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...
Query point visibility computation in polygons with holes
, Article Computational Geometry: Theory and Applications ; Volume 39, Issue 2 , 2008 , Pages 78-90 ; 09257721 (ISSN) ; Ghodsi, M ; Sharif University of Technology
2008
Abstract
In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. The goal is to perform this computation efficiently per query considering the cost of the preprocessing phase. Our algorithm is based on solutions in [A.L.P. Bose, J.I. Munro, Efficient visibility queries in simple polygons, Computational Geometry: Theory and Applications 23 (3) (2002) 313-335] and [M.T.B. Aronov, L. Guibas, L. Zhang, Visibility queries and maintenance in simple polygons, Discrete and Computational Geometry 27 (4) (2002) 461-483] proposed for simple polygons. In our solution, the preprocessing is done in time O( n3logn) to construct a data structure of size O( n3)....
Efficient computation of query point visibility in polygons with holes
, Article 21st Annual Symposium on Computational Geometry, SCG'05, Pisa, 6 June 2005 through 8 June 2005 ; 2005 , Pages 314-320 ; Ghodsi, M ; Sharif University of Technology
2005
Abstract
In this paper, we consider the problem of computing the visibility of a query point inside polygons with holes. The goal is to perform this computation efficiently per query with more cost in the preprocessing phase. Our algorithm is based on solutions in [13] and [2] proposed for simple polygons. In our solution, the preprocessing is done in time O(n3 log(n)) to construct a data structure of size O(n3). It is then possible to report the visibility polygon of any query point q in time O((1 + h′) log n + |V(q)|), in which n and h are the number of the vertices and holes of the polygon respectively, |V(q)| is the size of the visibility polygon of q, and h′ is an output and preprocessing...
Computational inverse design for cascaded systems of metasurface optics: comment
, Article Optics Express ; Volume 30, Issue 20 , 2022 , Pages 36966-37005 ; 10944087 (ISSN) ; Khavasi, A ; Sharif University of Technology
Optica Publishing Group (formerly OSA)
2022
Abstract
In a recently published article by Backer [Opt. Express 27(21), 30308 (2019).], a computational inverse design method is developed for designing optical systems composed of multiple metasurfaces. The forward propagation model used in this method was a discretized version of the angular spectrum propagator described by Goodman [Introduction to Fourier Optics, 1996]. However, slight modifications are necessary to increase the accuracy of this inverse design method. This comment examines the accuracy of the results obtained by the above-mentioned method by a full-wave electromagnetic solver and explains the reason of their difference. Thereafter, slight modifications to the method proposed by...
Introducing a suitable Controller for Rowing Activity in Patients with Spinal CordInjuries using FES
, M.Sc. Thesis Sharif University of Technology ; Jahed, Mehran (Supervisor)
Abstract
Disconnections in neural paths from the central nervous system to the muscles or vice versa cause different neuropathies, thus paralysis in different limbs may occur. As a result of the lack of muscular activity and the decrease in blood perfusion in paralyzed limbs, problems like osteoporosis, increase in the risk of breaking, decline in muscle size, cardiovascular diseases, renal dysfunction, bedsores, etc may happen. In order to induce movement in paralyzed limbs, thus preventingmentioned problems, rowing exercise through Functional Electrical Stimulation (FES) may be utilized. In FES, electrical Stimulation using current stimulating pulses is applied to contracting and relaxing muscles,...
Investigating Geometric Proximity Problems on Moving Points
, M.Sc. Thesis Sharif University of Technology ; 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...
Planar Visibility Counting
, M.Sc. Thesis Sharif University of Technology ; 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
Computational Geometry Problems in Black Box Model
, M.Sc. Thesis Sharif University of Technology ; Zarei, Alireza (Supervisor)
Abstract
Moving data is becoming more and more important in different areas such as air traffic control, mobile communications, geographical information systems, GPS and other advanced technologies. In most cases, the path trajectory of such moving data is not known in advance. Moreover, they can change the direction and their speed of motion. Recently, a moving model, called black box model, has been proposed for such environments. In this model, there is a sequence of time stamps in which the position of each object is reported and the maximum displacement of each object in a time step is bounded by a known constant, dmax. In this thesis, we use this model to solve some computational...
Reconstructing an Environment from Visibility Information
, M.Sc. Thesis Sharif University of Technology ; Zarei, Alireza (Supervisor)
Abstract
One of the methods to detect an unknown environment, is using the visual information about the environment. In this problem, we have an unknown two-dimensional environment consists of a set of edges and vertices that the geometric positions of vertices is not specified and only the combinatorial structure of the environment is available. In addition, certain information such as visibility of two vertices in the environment is known. The goal is to recognize the geometric shape of the environment with this information.This problem has many applications in Robotics particularly in dynamic envi- ronment where objects are moving.
In this thesis, we examine this problem in different conditions...
In this thesis, we examine this problem in different conditions...
Investigating Path Simplification Problems
,
M.Sc. Thesis
Sharif University of Technology
;
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...
Unsupervised Pattern Recognition in DATA Strams
, M.Sc. Thesis Sharif University of Technology ; Zarei, Alireza (Supervisor)
Abstract
Pattern recognition in data streams using bounded memory and bounded time is a difficult task. There are many techniques for recognizing patterns but when we talk about data streams these algorithms became useless since there are no enough memory to store all data. In data stream model the entire data is not available at any time and we don’t have enough time processing each data.
In this thesis we consider current methods for recognizing patterns from a data streams. The goal pattern in this study was the minimum total area of k convex polygons encloses all data
In this thesis we consider current methods for recognizing patterns from a data streams. The goal pattern in this study was the minimum total area of k convex polygons encloses all data
Cryptographic Hash Functions from Expander Graphs
, M.Sc. Thesis Sharif University of Technology ; khazaei, Shahram (Supervisor)
Abstract
A hash function maps efficiently every finite length string to a fixed one. The output represents the entire content of the input, similar to digital fingerprint of input text. In order to be able to use a hash function in cryptography, it should be hard to find two distinct inputs with the same output (collision), because finding a collision in hash functions leads to malicious attacks on many security systems.We say a hash function is provably collision resistant, if finding a collision can be reduced to the known hard problems. Family of MD hash functions are one of the most famous applied hash functions which are considerably used in industrial applications. However, they are not...
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...
Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem
, M.Sc. Thesis Sharif University of Technology ; Zarei, Alireza (Supervisor)
Abstract
Given a graph G with a set of terminals, two weight functions c and d defined on the edge set of G, and a bound D, a popular NP-hard problem in designing networks is to find the minimum cost Steiner tree (under function c) in G, to connect all terminals in such a way that its diameter (under function d) is bounded by D. Marathe et al. [1] proposed an (O(log2n);O(log2n)) approximation algorithm for this bicriteria problem, where n is the number of terminals. The first factor reflects the approximation ratio on the diameter bound D, and the second factor indicates the cost-approximation ratio. Later, Kapoor and Sarwat [2] introduced a parameterized approximation algorithm with performance...