Loading...
Search for: javad-ebrahimi--b
0.199 seconds

    Is There any Price Bubble in the Iranian Housing Market: a Structural Analysis Across Iranian Provinces Over 1375-1389

    , M.Sc. Thesis Sharif University of Technology Ebrahimi, Hassan (Author) ; Abedini, Javad (Supervisor)
    Abstract
    During the two last decades, Iranians have faced with a wide and substantial increase in housing prices, especially in great metropolitans such as Tehran, Mashhad, Isfahan and Shiraz. This easily could be refered to a hyperinflation which significantly impeded the access of low and medium income families to housing. This study uses a structure model to recognize the responsible factors of such a rise in housing prices and to show whether there is any price bubble in market. The model consists of both supply and demand side determinants to explain the price changes across Iranian provinces over 1375-1390, in a panel data context. In particular, we use a longer and larger database which also... 

    Determining Factors of Foreign Direct Investment Using Gravity Model

    , M.Sc. Thesis Sharif University of Technology Ebrahimi, Nima (Author) ; Abedini, Javad (Supervisor)
    Abstract
    Foreign direct investment (FDI) has considerably increased in recent years and achieved two percent of the world GDP in 2009. The positive impact of FDI on many national economic variables such as export and employment has been a great motivation for countries to seek it. In spite of many promoting factors in Iran, the Iranian FDI inflow still remains small. Using a huge panel dataset including 2604 real observations, this study aims to recognize and evaluate the impact of main factors influencing FDI inwards across the world. Based on a theoretical approach, we develop an empirical gravity model which includes not only the traditional mass variables but also some specific factors to FDI... 

    Approximation Algorithms for the Matroid-Constraint Maximum Subdeterminant

    , M.Sc. Thesis Sharif University of Technology Kermani, Fatemeh (Author) ; Ebrahimi Brojeni, Javad (Supervisor)
    Abstract
    let Mn n be a positive semmi definite matrix and M:= (U; B) be a matroid. Consider the problem of finding S 2 B such that det(MS;S) is maximized, in witch MS; S is the submatrix of M, restricted to rows and columns of S. This problem has a variety of applications including page ranking algorithms. The problem above is an NP-hard problem in the general case. However, there are several approximating and estimating algorithms for some special cases, which are interesting. Also, exactly solving the problem is NP-hard, even for some special matroids. As an example, one can consider the uniform matroids. Khachiyan introduced a greedy algorithm with dd approximation factor. Afterward, Di summa et... 

    Descriptive Complexity for Counting Problems

    , M.Sc. Thesis Sharif University of Technology Yaghoubi, Omid (Author) ; Ebrahimi Boroojeni, Javad (Supervisor)
    Abstract
    Descriptive complexity refers to the difficulty of expressing a problem in a formal language, allowing for a complete and precise description of the problem, including output specifications for function problems. Despite the success of the descriptive approach in computational complexity, this approach has been predominantly used for decision problems. In contrast to decision problems, a counting problem can be considered as a function with the range of natural numbers. This thesis focuses on the examination of counting problems from a descriptive perspective, exploring the connection between their descriptive and computational versions. Toward this goal, weighted logic is utilized to... 

    Vertex domination of generalized Petersen graphs

    , Article Discrete Mathematics ; Volume 309, Issue 13 , 2009 , Pages 4355-4361 ; 0012365X (ISSN) Javad Ebrahimi, B ; Jahanbakht, N ; Mahmoodian, E ; Sharif University of Technology
    2009
    Abstract
    In a graph G a vertex v dominates all its neighbors and itself. A set D of vertices of G is (vertex) dominating set if each vertex of G is dominated by at least one vertex in D. The (vertex) domination number of G, denoted by γ (G), is the cardinality of a minimum dominating set of G. A set D of vertices in G is efficient dominating set if every vertex of G is dominated by exactly one vertex of D. For natural numbers n and k, where n > 2 k, a generalized Petersen graphP (n, k) is obtained by letting its vertex set be {u1, u2, ..., un} ∪ {v1, v2, ..., vn} and its edge set be the union of {ui ui + 1, ui vi, vi vi + l} over 1 ≤ i ≤ n, where subscripts are reduced modulo n. We prove a necessary... 

    On Pliable Index Coding and Applications

    , M.Sc. Thesis Sharif University of Technology Mahdavipour, Hossein (Author) ; Ebrahimi Broujeni, Javad (Supervisor)
    Abstract
    One of the important issues in telecommunications is reducing the transmission volume for transferring a specific amount of information. In fact, the bottleneck in speed within the industrial world is not the computational power of computers and algorithms, but rather the capability of physically transferring data. One of the scientific fields that deals with optimization in data transmission is index coding. The first issue presented in index coding is examining the scenario where a satellite aims to simultaneously send different data to multiple users from a set of data. If we do not want to send all the data sequentially and consequently spend as much time as the number of requests (or... 

    Theory of Log-concave and Completely Log-concave Polynomials

    , M.Sc. Thesis Sharif University of Technology Moradzadeh, Ahmad Reza (Author) ; Ebrahimi Broujeni, Javad (Supervisor)
    Abstract
    One powerful methods to study combinatorial structures is to use polynomials. From 2006 onwards, by introducing and examining the properties of a class of polynomials called stable polynomials, deep connections were made between combinatorial structures and polynomials, and this led to special applications in solving problems such as van der Waerden conjecture conjecture and the proof of existence of Ramanojan graphs. In 2018, classes of polynomials called log-concave polynomials and completely log-concave polynomials were introduced, which led to the solution of an old conjecture, called Mason conjecture, in the field of matroid theory. The main purpose of this dissertation is to study the... 

    Releasing All-Pairs Shortest Distances of Public Graphs with Differential Privacy

    , M.Sc. Thesis Sharif University of Technology Tofighi Mohammadi, Alireza (Author) ; Ebrahimi Boroojeni, Javad (Supervisor)
    Abstract
    In the context of differential privacy, a data holder has confidential information about users. The goal is to provide a randomized algorithm that takes this information as input and outputs an aggregation of the input. The algorithm must have the property that for any neighboring input pairs, the output distribution of the algorithm is close. One problem in differential privacy research is the release of shortest distances in a weighted graph. This model, first studied by Adam Sealfon, involves an edge-weighted graph G=(V, E) with weights w : E → R, where the topology of the graph is public and the private information is the weight of the edges. The aim is to provide an (ϵ, δ)-DP algorithm... 

    Algebraic and Combinatorial Bounds for the Hat Guessing Number of Graphs

    , M.Sc. Thesis Sharif University of Technology Shariati, Mohammad Reza (Author) ; Ebrahimi Boroojeni, Javad (Supervisor)
    Abstract
    A number of players are positioned on the vertices of a finite graph, and each is wearing a hat whose color has been randomly and equally likely selected from a finite set of colors. Player A sees Player B if and only if there is a directed edge from the vertex corresponding to A to the vertex corresponding to B. The players must agree on a specific strategy before the game begins and carry it out. Once the game begins, no communication is allowed between the players, and each player must simultaneously guess the color of their own hat. The team wins if at least one guess is correct. For a given directed graph, we define the 'guessing number' of the graph as the maximum number of colors for... 

    Multivariate Mutual Information via Secret-key Agreement

    , M.Sc. Thesis Sharif University of Technology Mostafa Zadflah Chobari, Mohammad (Author) ; Ebrahimi, Javad (Supervisor)
    Abstract
    Shannon (1948) for the first time defined the "mutual information'' parameter for two random variables, but still there is no common definition for multivariate mutual information has been agreed upon, despite the multitude of research on the subject and various proposed definitions. In 2015, a study suggested that the maximum rate of secret-key, in the secret-key agreement problem, is a suitable candidate for defining multivariate mutual information. Csiszár and Narayan's research on the secret-key agreement problem provides an accessible bound for the maximum rate of secret-key rate, which in the bivariate case is the shannon's mutual information. The proposed definition has all expected... 

    The Problom of Forcing Number of Perfect Matching

    , M.Sc. Thesis Sharif University of Technology Ghanbari, Babak (Author) ; Mahmoodian, Ebadollah (Supervisor) ; Ebrahimi Borogerdi, Javad (Supervisor)
    Abstract
    The notions of forcing edge and the forcing number of a perfect matching first appeared in 1991 by Harary, Klein and Živković. The root of these concepts can be traced to the works by Randić and Klein in 1985-1987, where the forcing number was introduced under the name of “innate degree of freedom” of a Kekulé structure, which plays an important role in the resonance theory in chemistry. Over the past three decades, more research has been done on the forcing set of perfect matchings. Here, we introduce bounds on the forcing number of perfect matching of some graphs that have already been known. Then, we extend the concept of forcing to fractional perfect matching and we introduce fractional... 

    How to Explicitly Solve a Thue-Mahler Equation

    , M.Sc. Thesis Sharif University of Technology Safinejad, Fatemeh (Author) ; Ebrahimi Borojeni, Javad (Supervisor) ; Ghadermarzi, Amir (Supervisor)
    Abstract
    David Hilbert posed a list of mathematical problems in 1900. Hilbert's tenth problem was "Is there an algorithm to determine whether a given Diophantine equation, has a solution with all unknowns taking integer values." Although Matiyasevich Showed that the answer to this problem is negative in the general case; the answer of this problem for a specific diophantine equation $f(x,y) $ that has rational coefficients, is unknown. Thue-Mahler equation is a diophantine equation of the form: $$F(x,y)=c\cdot p_1^{z_1}\cdots p_v^{z_v}$$ where $F$ is homogeneous with integer coefficients, degree $n\geq3$ and $p_1,\ldots p_v$ are distinct rational primes ($v\geq1$). All the unknowns are... 

    BQP and the Polynomial Hierarchy

    , M.Sc. Thesis Sharif University of Technology Hamzei, Fahid (Author) ; Ebrahimi Broojeni, Javad (Supervisor) ; Abolfath Beigi, Salman (Co-Supervisor)
    Abstract
    The relation between BQP and PH has been one of the most fundamental open questions since the beginning of the field of quantum computational complexity. Despite the common belief that BQP contains problems outside the polynomial hierarchy, no real progress had been made in solving the problem even in relativized world. In 2009, Aaronson took the first serious step by proposing an oracle problem to separate the relation version of these two complexity classes. Finally, based on Aaronson’s works, in 2018 Raz and Tal separated BQP and PH relative to an oracle in a breakthrough work. This thesis studies the tools and techniques used to solve this challenging problem  

    Measured impact of different back-off points and cooling methods on pulse-to-pulse stability and sidelobe level of a high-power solid-state amplifier

    , Article IET Radar, Sonar and Navigation ; Volume 14, Issue 2 , 2020 , Pages 335-340 Ebrahimi, A ; Khodarahmi, E ; Ebrahimi, E ; Ahmadi, B ; Jalali, M ; Sharif University of Technology
    Institution of Engineering and Technology  2020
    Abstract
    Using solid-state power amplifiers for next generation of weather radars becomes feasible by pulse compression techniques. In this study a 1.5 kW solid-state power amplifier (transmitter) for C-band weather radars is designed and fabricated by GaN high electron mobility transistor (HEMT) technology. An experimental setup based on heterodyne receiver with 16-bit digitiser is developed to investigate the behavior of the power amplifier under different cooling methods and back-off points. Several measurements with shaped LFM pulse show an approximately identical pulse to pulse (P2P) stability for 3 dB compression, P1dB and 2 dB back-off points while the best sidelobe level (SLL) is achieved for... 

    Hydrodynamics of fingering instability in the presence of a magnetic field

    , Article Fluid Dynamics Research ; Volume 48, Issue 5 , 2016 ; 01695983 (ISSN) Mostaghimi, P ; Ashouri, M ; Ebrahimi, B ; Sharif University of Technology
    Institute of Physics Publishing  2016
    Abstract
    The hydrodynamics of two immiscible fluids in a rectangular Hele-Shaw cell under the influence of a magnetic field is studied, both theoretically and numerically. A linear stability analysis is conducted to determine the effect of magnetic fields on the formation of viscous fingers. As a result, an analytical solution is found to calculate the growth rate of perturbations. For numerical simulation of the two-phase flow, the interfacial tension is treated as a body force using the continuum surface force model and the interface tracking is performed by the volume of fluid method. The variations of the width and growth rate of fingers in an unstable displacement versus Hartmann number, a... 

    PEAF: A power-efficient architecture for SRAM-based fpgas using reconfigurable hard logic design in dark silicon era

    , Article IEEE Transactions on Computers ; Volume 66, Issue 6 , 2017 , Pages 982-995 ; 00189340 (ISSN) Ebrahimi, Z ; Khaleghi, B ; Asadi, H ; Sharif University of Technology
    IEEE Computer Society  2017
    Abstract
    Significant increase of static power in nano-CMOS era and, subsequently, the end of Dennard scaling has put a Power Wall to further integration of CMOS technology in Field-Programmable Gate Arrays (FPGAs). An efficient solution to cope with this obstacle is power gating inactive fractions of a single die, resulting in Dark Silicon. Previous studies employing power gating on SRAM-based FPGAs have primarily focused on using large-input Look-up Tables (LUTs). The architectures proposed in such studies inherently suffer from poor logic utilization which limits the benefits of power gating techniques. This paper proposes a Power-Efficient Architecture for FPGAs (PEAF) based on combination of... 

    An agent-based approach for market-based customer reliability enhancement in distribution systems

    , Article 16th International Conference on Distributed Computing and Artificial Intelligence, DCAI 2019, 26 June 2019 through 28 June 2019 ; Volume 1004 , 2020 , Pages 171-176 Ebrahimi, M ; Ebrahimi, M ; Abdi, B ; Sharif University of Technology
    Springer Verlag  2020
    Abstract
    These days, considering the importance of reliability in industries, utilities’ role for preparing high levels of reliability becomes more important. This can be done by adding numbers of switches and Tie switches which impose high expenses to system. These expenditures should be provided by customers. Level of reliability in different points of network is different. So customers which pay more, receive higher level of reliability. If a customer raises its payment, utility change the location of switches in order to raise level of reliability of that customer. all customers change their payment and then utility fixes the switches at a point that all customers reach their favorable... 

    A compensated PID active queue management controller using an improved queue dynamic model

    , Article International Journal of Communication Systems ; Vol. 27, issue. 12 , 2014 , pp. 4543-4563 Kahe, G ; Jahangir, A. H ; Ebrahimi, B ; Sharif University of Technology
    2014
    Abstract
    Beside the major objective of providing congestion control, achieving predictable queuing delay, maximizing link utilization, and robustness are the main objectives of an active queue management (AQM) controller. This paper proposes an improved queue dynamic model while incorporating the packet drop probability as well. By applying the improved model, a new compensated PID AQM controller is developed for Transmission Control Protocol/Internet Protocol (TCP/IP) networks. The non-minimum phase characteristic caused by Padé approximation of the network delay restricts the direct application of control methods because of the unstable internal dynamics. In this paper, a parameter-varying dynamic... 

    AQM controller design for TCP networks based on a new control strategy

    , Article Telecommunication Systems ; Volume 57, Issue 4 , December , 2013 , Pages 295-311 ; 10184864 (ISSN) Kahe, G ; Jahangir, A. H ; Ebrahimi, B ; Sharif University of Technology
    Kluwer Academic Publishers  2013
    Abstract
    When the network suffers from congestion, the core or edge routers signal the incidence of congestion through the active queue management (AQM) to the sources. The time-varying nature of the network dynamics and the complex process of retuning the current AQM algorithms for different operating points necessitate the development of a new AQM algorithm. Since the non-minimum phase characteristics of the network dynamics restrict direct application of the proportional-integral-derivative (PID) controller, we propose a compensated PID controller based on a new control strategy addressing the phase-lag and restrictions caused by the delay. Based on the unstable internal dynamics caused by the... 

    A layout-based approach for multiple event transient analysis

    , Article Proceedings - Design Automation Conference ; 2013 ; 0738100X (ISSN) ; 9781450320719 (ISBN) Ebrahimi, M ; Asadi, H ; Tahoori, M. B ; Sharif University of Technology
    2013
    Abstract
    With the emerging nanoscale CMOS technology, Multiple Event Transients (METs) originated from radiation strikes are expected to become more frequent than Single Event Transients (SETs). In this paper, a fast and accurate layout- based Soft Error Rate (SER) estimation technique with consideration of both SET and MET fault models is pro- posed. Unlike previous techniques in which the adjacent MET sites are obtained from logic-level netlist, we perform a comprehensive layout analysis to extract MET adjacent cells. It is shown that layout-based technique is the only effective solution for identification of adjacent cells as netlist-based techniques significantly underestimate the overall SER....