Loading...
Search for: saghafian--s
0.178 seconds

    Multi-criteria group decision making using a modified fuzzy TOPSIS procedure

    , Article International Conference on Computational Intelligence for Modelling, Control and Automation, CIMCA 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, IAWTIC 2005, Vienna, 28 November 2005 through 30 November 2005 ; Volume 2 , 2005 , Pages 215-220 ; 0769525040 (ISBN); 9780769525044 (ISBN) Saghafian, S ; Hejazi, S. R ; Sharif University of Technology
    2005
    Abstract
    In this paper we propose a modified Fuzzy Technique for Order Performance by Similarity to Ideal Solution (modified Fuzzy TOPSIS) for the Multi-criteria Decision Making (MCDM) problem when there is a group of decision makers. Regarding the value of the truth that a fuzzy number is greater than or equal to another fuzzy number, a new distance measure is proposed in this paper. This distance measure calculates the distance of each fuzzy number from both Fuzzy Positive Ideal Solution (FPIS) and Fuzzy negative Ideal Solution (FNIS). Then, the alternative which is simultaneously closer to FPIS and farther from FNIS will be selected as the best choice. To clarify our proposed procedure, a... 

    Application of unit response approach for spatial prioritization of runoff and sediment sources

    , Article Agricultural Water Management ; Volume 109 , 2012 , Pages 36-45 ; 03783774 (ISSN) Saghafian, B ; Sima, S ; Sadeghi, S ; Jeirani, F ; Sharif University of Technology
    2012
    Abstract
    Evaluation and control of suspended sediment load as one of the main water quality concerns is important in large basins, especially in basins with planned dam construction. Success in sediment control measures depends, in particular, on proper identification of sediment sources. Since observations alone are normally not adequate for source prioritization/contribution in relation to the downstream sediment loads, hydrological simulation tools may be applied for spatial prioritization of runoff and sediment yield in basins. In this paper, subbasin prioritization was conducted for the Gharasu basin, located in southwestern Iran. Soil and Water Assessment Tool (SWAT) model was calibrated and... 

    Application of the WEPP model to determine sources of run-off and sediment in a forested watershed

    , Article Hydrological Processes ; Volume 29, Issue 4 , 2015 , Pages 481-497 ; 08856087 (ISSN) Saghafian, B ; Meghdadi, A. R ; Sima, S ; Sharif University of Technology
    John Wiley and Sons Ltd  2015
    Abstract
    This study investigates critical run-off and sediment production sources in a forested Kasilian watershed located in northern Iran. The Water Erosion Prediction Project (WEPP) watershed model was set up to simulate the run-off and sediment yields. WEPP was calibrated and validated against measured rainfall-run-off-sediment data. Results showed that simulated run-off and sediment yields of the watershed were in agreement with the measured data for the calibration and validation periods. While low and medium values of run-off and sediment yields were adequately simulated by the WEPP model, high run-off and sediment yield values were underestimated. Performance of the model was evaluated as... 

    Comparison between active learning method and support vector machine for runoff modeling

    , Article Journal of Hydrology and Hydromechanics ; Volume 60, Issue 1 , March , 2012 , Pages 16-32 ; 0042790X (ISSN) Shahraiyni, H ; Ghafouri, M ; Shouraki, S ; Saghafian, B ; Nasseri, M ; Sharif University of Technology
    2012
    Abstract
    In this study Active Learning Method (ALM) as a novel fuzzy modeling approach is compared with optimized Support Vector Machine (SVM) using simple Genetic Algorithm (GA), as a well known datadriven model for long term simulation of daily streamflow in Karoon River. The daily discharge data from 1991 to 1996 and from 1996 to 1999 were utilized for training and testing of the models, respectively. Values of the Nash-Sutcliffe, Bias, R 2, MPAE and PTVE of ALM model with 16 fuzzy rules were 0.81, 5.5 m 3 s -1, 0.81, 12.9%, and 1.9%, respectively. Following the same order of parameters, these criteria for optimized SVM model were 0.8, -10.7 m 3 s -1, 0.81, 7.3%, and -3.6%, respectively. The... 

    Counting cells of order-k voronoi tessellations in ℝ3 with morse theory

    , Article 37th International Symposium on Computational Geometry, SoCG 2021, 7 June 2021 through 11 June 2021 ; Volume 189 , 2021 ; 18688969 (ISSN) ; 9783959771849 (ISBN) Biswas, R ; di Montesano, S. C ; Edelsbrunner, H ; Saghafian, M ; Sharif University of Technology
    Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing  2021
    Abstract
    Generalizing Lee's inductive argument for counting the cells of higher order Voronoi tessellations in ℝ2 to ℝ3, we get precise relations in terms of Morse theoretic quantities for piecewise constant functions on planar arrangements. Specifically, we prove that for a generic set of n ≥ 5 points in ℝ3, the number of regions in the order-k Voronoi tessellation is Nk−1 − (k/2)n + n, for 1 ≤ k ≤ n − 1, in which Nk−1 is the sum of Euler characteristics of these function's first k − 1 sublevel sets. We get similar expressions for the vertices, edges, and polygons of the order-k Voronoi tessellation. © Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian;... 

    Continuous and discrete radius functions on voronoi tessellations and delaunay mosaics

    , Article Discrete and Computational Geometry ; Volume 67, Issue 3 , 2022 , Pages 811-842 ; 01795376 (ISSN) Biswas, R ; Cultrera di Montesano, S ; Edelsbrunner, H ; Saghafian, M ; Sharif University of Technology
    Springer  2022
    Abstract
    The Voronoi tessellation in Rd is defined by locally minimizing the power distance to given weighted points. Symmetrically, the Delaunay mosaic can be defined by locally maximizing the negative power distance to other such points. We prove that the average of the two piecewise quadratic functions is piecewise linear, and that all three functions have the same critical points and values. Discretizing the two piecewise quadratic functions, we get the alpha shapes as sublevel sets of the discrete function on the Delaunay mosaic, and analogous shapes as superlevel sets of the discrete function on the Voronoi tessellation. For the same non-critical value, the corresponding shapes are disjoint,... 

    About A Model For Network Creation Game

    , M.Sc. Thesis Sharif University of Technology Saghafian, Morteza (Author) ; Jafari, Amir (Supervisor)
    Abstract
    We consider a network creation game in which, each player(vertex) has bounded budget to draw edges to other vertices. Each player wants to minimize its local diameter in MAX version, and its sum of distances to other vertices in SUM version.
    In this thesis, we first prove that the problem of finding the best response for each player in this network creation game, is NP-Hard. But we show that always there exists a Pure Nash Equilibria for each of the versions. Then we focus on the diameter of equilibrium graphs. In Unit Budget case (when each player’s budget is one) we show that the diameter of each equilibrium graph in O(1), and always there exists a Mixed Nash Equilibirum. For each n,... 

    The Analysis of Knowledge Management, Dimensions and Implementation Methods-Case study: Sardsaz Khodro Ind. Co

    , M.Sc. Thesis Sharif University of Technology Saghafian, Hamideh (Author) ; Mostafavi, Mostafa (Supervisor)
    Abstract
    Today, organizations are surrounded by basic and continuous changes such as declining organizational resources, reduction of the production cycles, and the need for rapid adaption. Those organizations remain competitive while maintaining their productivity, that have following characteristics: accurately plan and assess their knowledge resources, create and absorb beneficial knowledge, store and organize their knowledge, disseminate knowledge to needed areas, and use knowledge in practice and decision making, to improve their products/services as well as their performance. Therefore, the human capital has been considered as knowledge owners and the most important organizational resource, on... 

    On a bounded budget network creation game

    , Article Annual ACM Symposium on Parallelism in Algorithms and Architectures, 4 June 2011 through 6 June 2011, San Jose, CA ; June , 2011 , Pages 207-214 ; 9781450307437 (ISBN) Ehsani, S ; Fazli, M ; Mehrabian, A ; Sadeghian Sadeghabad, S ; Safari, M ; Saghafian, M ; Shokat Fadaee, S ; Sharif University of Technology
    2011
    Abstract
    We consider a network creation game in which, each player (vertex) has a limited budget to establish links to other players. In our model, each link has a unit cost and each agent tries to minimize its cost which is its local diameter or its total distance to other players in the (undirected) underlying graph of the created network. Two variants of the game are studied: in the MAX version, the cost incurred to a vertex is the maximum distance between that vertex and other vertices, and in the SUM version, the cost incurred to a vertex is the sum of distances between that vertex and other vertices. We prove that in both versions pure Nash equilibria exist, but the problem of finding the best... 

    A bounded budget network creation game

    , Article ACM Transactions on Algorithms ; Volume 11, Issue 4 , June , 2015 ; 15496325 (ISSN) Ehsani, S ; Shokat Fadaee, S ; Fazli, M ; Mehrabian, A ; Sadeghian Sadeghabad, S ; Safari, M ; Saghafian, M ; Sharif University of Technology
    Association for Computing Machinery  2015
    Abstract
    We introduce a network creation game in which each player (vertex) has a fixed budget to establish links to other players. In this model, each link has a unit price, and each agent tries to minimize its cost, which is either its eccentricity or its total distance to other players in the underlying (undirected) graph of the created network. Two versions of the game are studied: In the MAX version, the cost incurred to a vertex is the maximum distance between the vertex and other vertices, and, in the SUM version, the cost incurred to a vertex is the sum of distances between the vertex and other vertices. We prove that in both versions pure Nash equilibria exist, but the problem of finding the... 

    Envy free chain store pricing

    , Article 2011 CSI International Symposium on Computer Science and Software Engineering, CSSE 2011, 15 June 2011 through 16 June 2011 ; June , 2011 , Pages 44-47 ; 9781612842073 (ISBN) Fazli, M ; Nikparto, N ; Saghafian, M ; Sharif University of Technology
    2011
    Abstract
    In this paper we study envy free pricing problem in general graphs where there is not a seller in every graph's nodes. We assume unique establishment cost for initiating a store in each node and we wish to find an optimal set of nodes in which we would make the maximum profit by initiating stores in them. Our model is motivated from the observation that a same product has different prices in different locations and there is also an establishing cost for initiating any store. We consider both of these issues in our model: first where should we establish the stores, and second at what price should we sell our items in them to gain maximum possible profit. We prove that in a case of constant... 

    Is there any polynomial upper bound for the universal labeling of graphs?

    , Article Journal of Combinatorial Optimization ; 2016 , Pages 1-11 ; 13826905 (ISSN) Ahadi, A ; Dehghan, A ; Saghafian, M ; Sharif University of Technology
    Springer New York LLC  2016
    Abstract
    A universal labeling of a graph G is a labeling of the edge set in G such that in every orientation (Formula presented.) of G for every two adjacent vertices v and u, the sum of incoming edges of v and u in the oriented graph are different from each other. The universal labeling number of a graph G is the minimum number k such that G has universal labeling from (Formula presented.) denoted it by (Formula presented.). We have (Formula presented.), where (Formula presented.) denotes the maximum degree of G. In this work, we offer a provocative question that is: “Is there any polynomial function f such that for every graph G, (Formula presented.)?”. Towards this question, we introduce some... 

    Is there any polynomial upper bound for the universal labeling of graphs?

    , Article Journal of Combinatorial Optimization ; Volume 34, Issue 3 , 2017 , Pages 760-770 ; 13826905 (ISSN) Ahadi, A ; Dehghan, A ; Saghafian, M ; Sharif University of Technology
    2017
    Abstract
    A universal labeling of a graph G is a labeling of the edge set in G such that in every orientation ℓ of G for every two adjacent vertices v and u, the sum of incoming edges of v and u in the oriented graph are different from each other. The universal labeling number of a graph G is the minimum number k such that G has universal labeling from { 1 , 2 , … , k} denoted it by χu→ (G). We have 2 Δ (G) - 2 ≤ χu→ (G) ≤ 2 Δ ( G ), where Δ (G) denotes the maximum degree of G. In this work, we offer a provocative question that is: “Is there any polynomial function f such that for every graph G, χu→ (G) ≤ f(Δ (G)) ?”. Towards this question, we introduce some lower and upper bounds on their parameter... 

    Evaluation of Water Quality of Anzali Lagoon by Developing a Numerical Model

    , M.Sc. Thesis Sharif University of Technology Saghafian, Mariam (Author) ; Safaie, Ammar (Supervisor)
    Abstract
    Wetlands are valuable ecosystems that have a wide variety of functions to protect biodiversity, natural, economic and social values. Hydrological changes and nutrient enrichment, resulting from population growth, economic development and climate change are threatening the wetlands. Recently, assessing spatial and temporal variations of water quality has become an important aspect of the physical and chemical characterization of aquatic environments. Anzali wetland is one of the international wetlands in Iran, located in the southern part of the Caspian Sea in Gilan province. This wetland has been exposed to many pollution sources including agricultural, industrial, and municipal wastewater... 

    Preclustering algorithms for imprecise points

    , Article 17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, 22 June 2020 through 24 June 2020 ; Volume 162 , 2020 Abam, M. A ; de Berg, M ; Farahzad, S ; Haji Mirsadeghi, M. O ; Saghafian, M ; Sharif University of Technology
    Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing  2020
    Abstract
    We study the problem of preclustering a set B of imprecise points in Rd: we wish to cluster the regions specifying the potential locations of the points such that, no matter where the points are located within their regions, the resulting clustering approximates the optimal clustering for those locations. We consider k-center, k-median, and k-means clustering, and obtain the following results. Let B := {b1, . . ., bn} be a collection of disjoint balls in Rd, where each ball bi specifies the possible locations of an input point pi. A partition C of B into subsets is called an (f(k), α)preclustering (with respect to the specific k-clustering variant under consideration) if (i) C consists of... 

    Preclustering algorithms for imprecise points

    , Article Algorithmica ; Volume 84, Issue 6 , 2022 , Pages 1467-1489 ; 01784617 (ISSN) Abam, M. A ; de Berg, M ; Farahzad, S ; Haji Mirsadeghi, M. O ; Saghafian, M ; Sharif University of Technology
    Springer  2022
    Abstract
    We study the problem of preclustering a set B of imprecise points in Rd: we wish to cluster the regions specifying the potential locations of the points such that, no matter where the points are located within their regions, the resulting clustering approximates the optimal clustering for those locations. We consider k-center, k-median, and k-means clustering, and obtain the following results. Let B: = { b1, … , bn} be a collection of disjoint balls in Rd, where each ball bi specifies the possible locations of an input point pi. A partition C of B into subsets is called an (f(k) , α) -preclustering (with respect to the specific k-clustering variant under consideration) if (i) C consists of... 

    Source Related Elemental Characterization of the SPM of the City of Isfahan with INAA Method

    , M.Sc. Thesis Sharif University of Technology Saghafian, Maryam (Author) ; Sohrabpour, Mostafa (Supervisor) ; Khalafi, Hossein (Supervisor)
    Abstract
    Total air particulate matter of the city of Isfahan has been measured for elemental characterization in four principal directions of the city and during the year 2007-2008. High volume air samplers using whatman 41 filters have been utilized and instrumental neutron activation analysis has been used as the analytical method. Twenty one elements arising from seasonal and geographical distributions of the various elements have been determined. These distribution patterns have been discussed in view of the prevailing wind direction, location of the industrial facilities, and the Pearson correlation coefficients  

    Modeling spatial variability of daily rainfall in southwest Iran

    , Article Scientia Iranica ; Volume 10, Issue 2 , 2003 , Pages 164-174 ; 10263098 (ISSN) Saghafian, B ; Tajrishy, M ; Shahraini, H. T ; Jalali, N ; Sharif University of Technology
    Sharif University of Technology  2003
    Abstract
    Rainfall characteristics, which include spatial variability, exert a major influence on runoff properties. Many techniques have been proposed for determining the spatial distribution of daily rainfall. One of these techniques is spatial modeling, based on rainfall data measured by rain-gauge networks. In this study, application of different interpolation methods in the GIS environment, for estimating the spatial distribution of daily rainfall in the southwest of Iran with low rain-gauge density, have been compared on a regional scale. The cross validation technique was selected as an accuracy index and statistical parameters, such as MAE (Mean Absolute Error) and MBE (Mean Bias Error), were... 

    An experimental study on the effect of ultrasonication on thermal conductivity of ferrofluid loaded with carbon nanotubes

    , Article Thermochimica Acta ; Volume 617 , October , 2015 , Pages 102-110 ; 00406031 (ISSN) Shahsavar, A ; Salimpour, M. R ; Saghafian, M ; Shafii, M. B ; Sharif University of Technology
    Elsevier  2015
    Abstract
    Nanofluids containing Fe3O4 and carbon nanotubes nanoparticles emulsified and dispersed using gum arabic (GA) and tetramethylammonium hydroxide (TMAH) were made and characterized for potential use as heat transfer fluids. Due to the interaction between the TMAH and GA molecules, the magnetic nanoparticles and CNTs were physically adsorbed. This paper reports an experimental work on the effect of ultrasonication on thermal conductivity of this aqueous suspension. The characterization and surface morphology of the dried samples were studied by using XRD and TEM measurements. Experiments were conducted in the magnetic nanoparticles mass concentration range 0.494-2.428%,... 

    Examining the Impact of Key Factors on Esteghlal Tehran Fans' Intention to Attend Matches: A Social Identity Theory Perspective

    , M.Sc. Thesis Sharif University of Technology Ghasemi, Mohammad Hossein (Author) ; Alavi, Babak (Supervisor) ; Saghafian, Marzieh (Supervisor)
    Abstract
    This study investigated the relationships between team identification and attendance intention in Iranian football matches, specifically examining the impact of constraints on this relationship. The research focused on Esteghlal Football Club, one of Iran's most popular teams, which faces a paradox of having a large fan base (35-40 million supporters) but relatively low stadium attendance rates (below 50% capacity). The study employed a mixed online sampling method (convenience and snowball) with 182 Esteghlal fans who had attended at least one stadium match. Data was collected using three validated questionnaires: team identification (18 items, 6 dimensions), attendance intention (4 items,...