Loading...
Search for:
sheikholeslami--razi
0.191 seconds
Developing a New Framework for Assessing the Impact of Data Uncertainty on Water Quality Index based on Multivariate Analysis
, M.Sc. Thesis Sharif University of Technology ; Sheikholeslami, Razi (Supervisor)
Abstract
Over the past several decades, human activities have resulted in a significant increase in surface and ground water pollution. Human activities have caused significant pollution of surface and groundwater, with pollutants like nitrates, phosphorus, heavy metals, toxins, and chemical fertilizers degrading water quality. In order to control pollution and reduce the concentration of pollutants in water, it is necessary to use appropriate numerical criteria to evaluate and manage the quality of water resources. The water quality index, as a scoring method for investigating the combined effects of independent parameters on overall water quality, is a widely-used metric for measuring the quality...
Evaluating The Efficiency of Machine Learning Methods for Variance-Based Sensitivity Analysis in Hydrological Models
, M.Sc. Thesis Sharif University of Technology ; Sheikholeslami, Razi (Supervisor)
Abstract
It is inevitable to simulate the phenomena that govern nature to make decisions and policies on water and environmental issues. Therefore, researchers have tried to make a good prediction of water's quantitative and qualitative status by using modeling and computer processing power. One of the primary and essential issues in modeling is using sensitivity analysis techniques. Using this knowledge, much information will be obtained on how to influence the model's output regarding various factors such as parameters, input data, and initial and boundary conditions. Global sensitivity analysis based on variance as one of the most well-known and, at the same time, the most widely used sensitivity...
Machine Learning Analysis of Phosphorus Dynamics in Surface Waters Across Diverse Climate Zones
,
M.Sc. Thesis
Sharif University of Technology
;
Sheikholeslami, Razi
(Supervisor)
Abstract
Water quality is a fundamental pillar of public health, sustainable development, and food security, and monitoring pollutants such as total phosphorus (TP) plays a crucial role in the effective management of surface water resources. Phosphorus is an essential element for agricultural production; however, its loss from soil to aquatic systems can lead to environmental issues such as eutrophication, biodiversity loss, and degradation of water quality. Although monitoring TP concentrations is vital for effective water quality management, many countries face a lack of sufficient and consistent data. Numerical models, particularly data-driven approaches based on machine learning, can help bridge...
Global Analysis of Phosphorus Concentration and its Relationships with Environmental and Anthropogenic Factors Across Varied Climates
, M.Sc. Thesis Sharif University of Technology ; Sheikholeslami, Razi (Supervisor)
Abstract
Phosphorus is a key nutrient in the Earth's biogeochemical cycle and plays a crucial role in agricultural productivity and global food security. It is primarily utilized in the manufacture of chemical fertilizers. At the global scale, phosphorus concentrations in surface waters are regulated by a complex interplay of environmental, climatic, and anthropogenic factors. Excessive phosphorus input into aquatic systems, particularly through agricultural runoff and industrial wastewater, can lead to eutrophication, water quality degradation, and serious ecological issues. Understanding the drivers of phosphorus concentration on a global level is therefore essential for sustainable water resource...
Optimal Design of Cascade Stilling Basins using Metaheuristic Algorithms
, M.Sc. Thesis Sharif University of Technology ; Sheikholeslami, Razi (Supervisor)
Abstract
The country's increasing demand for water makes effective dam management essential. Beyond environmental concerns, constructing new dams and their components involves relatively high costs. One of the most critical components of a dam is its spillway, which accounts for a significant portion of the total construction costs and plays a vital role in water resource management. To reduce spillway construction costs, a specific type of spillway that combines a stepped spillway with cascading basins can be employed. Designing this type of spillway can be considered as an optimization problem, requiring the use of optimization methods. Metaheuristic algorithms, which have gained significant...
Global Estimates of Manure and Synthetic Fertilizer Phosphorus Loss in Runoff and the Quantification of Data Uncertainities
, M.Sc. Thesis Sharif University of Technology ; Sheikholeslami, Razi (Supervisor)
Abstract
The increasing rate of population and agricultural development over the past few decades has led to a significant rise in the pollution of surface and groundwater. The application of animal and synthetic fertilizers containing phosphorus, which increases the levels of this element in the soil, can be considered one of the factors endangering the environment, especially the quality of surface waters. The transport of phosphorus, which is one of the pollutants in agricultural runoff, can lead to the degradation of aquatic ecosystems and reduce the quality and usability of water resources. Accordingly, various numerical models have been developed to simulate phosphorus loss from the soil. They...
Global patterns and key drivers of stream nitrogen concentration: A machine learning approach
, Article Science of the Total Environment ; Volume 868 , 2023 ; 00489697 (ISSN) ; Hall, J. W ; Sharif University of Technology
Elsevier B.V
2023
Abstract
Anthropogenic loading of nitrogen to river systems can pose serious health hazards and create critical environmental threats. Quantification of the magnitude and impact of freshwater nitrogen requires identifying key controls of nitrogen dynamics and analyzing both the past and present patterns of nitrogen flows. To tackle this challenge, we adopted a machine learning (ML) approach and built an ML-driven representation that captures spatiotemporal variability in nitrogen concentrations at global scale. Our model uses random forests to regress a large sample of monthly measured stream nitrogen concentrations onto a set of 17 predictors with a spatial resolution of 0.5-degree over the...
Seismic Demand in Diaphragms and Collectors
, M.Sc. Thesis Sharif University of Technology ; Maleki, Shervin (Supervisor)
Abstract
This study investigates the seismic demand in diaphragms, chords and collectors in typical floor systems used in steel structures. These systems include joist-block slabs, open web steel joists, and composite steel decks. The lateral load resisting systems considered were Special Concentrically Braced Frames (SCBF) and Special Moment Frames (SMF) of varying heights. For each system, the influence of using shear connectors for perimeter beams, joist orientation, geometric configuration, and number of stories on lateral force transfer was examined. Nonlinear static and time history analyses were conducted on selected models. Key findings are as follows:
• In joist slab system without shear...
• In joist slab system without shear...
Design of a robust model predictive controller with reduced computational complexity
, Article ISA Transactions ; Volume 53, Issue 6 , 1 November , 2014 , Pages 1754-1759 ; ISSN: 00190578 ; Haeri, M ; Sharif University of Technology
2014
Abstract
The practicality of robust model predictive control of systems with model uncertainties depends on the time consumed for solving a defined optimization problem. This paper presents a method for the computational complexity reduction in a robust model predictive control. First a scaled state vector is defined such that the objective function contours in the defined optimization problem become vertical or horizontal ellipses or circles, and then the control input is determined at each sampling time as a state feedback that minimizes the infinite horizon objective function by solving some linear matrix inequalities. The simulation results show that the number of iterations to solve the problem...
Design of an RMPC with a time-varying terminal constraint set for tracking problem
, Article International Journal of Robust and Nonlinear Control ; Volume 26, Issue 12 , 2016 , Pages 2623-2642 ; 10498923 (ISSN) ; Haeri, M ; Sharif University of Technology
John Wiley and Sons Ltd
2016
Abstract
This paper presents a robust model predictive control algorithm with a time-varying terminal constraint set for systems with model uncertainty and input constraints. In this algorithm, the nonlinear system is approximated by a linear model where the approximation error is considered as an unstructured uncertainty that can be represented by a Lipschitz nonlinear function. A continuum of terminal constraint sets is constructed off-line, and robust stability is achieved on-line by using a variable control horizon. This approach significantly reduces the computational complexity. The proposed robust model predictive controller with a terminal constraint set is used in tracking set-points for...
Efficient algorithms for online tracking of set points in robust model predictive control
, Article International Journal of Systems Science ; Volume 48, Issue 8 , 2017 , Pages 1635-1645 ; 00207721 (ISSN) ; Haeri, M ; Sharif University of Technology
2017
Abstract
This paper presents some computationally efficient algorithms for online tracking of set points in robust model predictive control context subject to state and input constraints. The nonlinear systems are represented by a linear model along with an additive nonlinear term which is locally Lipschitz. As an unstructured uncertainty, this term is replaced in the robust stability constraint by its Lipschitz coefficient. A scheduled control technique is employed to transfer the system to desired set points, given online, by designing local robust model predictive controllers. This scheme includes estimating the regions of feasibility and stability of the related equilibriums and online switching...
Survey the Change of Phreatic Line Position in the First Filling of Earth Dams until Steady State Seepage
, M.Sc. Thesis Sharif University of Technology ; Jafarzadeh, Fardin (Supervisor)
Abstract
Since seepage-related problems account for the cause of more than forty percent of dam failure seepage analysis serves as one of the most significant stage in the design process of an embankment dam. Currently a steady seepage analysis in a typical or maximum cross section of the dam is formed instead of transient seepage analysis for simplicity. In this way, for the change of condition (unsaturated to saturated) in the first filling of dams and it’s effects on behavior and reaction of dams until the steady seepage condition established; the results of steady seepage analysis cannot be satisfactory. In this thesis, based on finite element method and with assumption of saturated-unsaturated...
Self-assembly of tryptophan-capped gold nanoparticles onto DNA network template
, Article Journal of Dispersion Science and Technology ; Volume 30, Issue 2 , 2009 , Pages 254-258 ; 01932691 (ISSN) ; Vosoughi, M ; Alemsadeh, I ; Sharif University of Technology
2009
Abstract
In this study, a simple route to the formation of DNA-gold complex has been reported, using immobilized DNA as a template. The nanoporous gold films have been prepared by the electrostatic self assembly of gold nanoparticles capped with tryptophan. Tryptophan would improve surface properties of gold nanoparticles for strongly attaching to DNA. Fourier transform infrared spectroscopy confirmed that gold nanoparticles have been capped by tryptophan. Also measured zeta potential shows that there are positive charges on the surface of gold nanoparticles. Investigations by atomic force microscopy substantially confirm that tryptophan-capped gold nanoparticles can be bonded to DNA template...
Fabrication of metal nanowires based on self assembly of tryptophan-capped gold nanoparticle onto DNA network template
, Article International Journal of Nanotechnology ; Volume 6, Issue 10-11 , 2009 , Pages 1041-1049 ; 14757435 (ISSN) ; Vossoughi, M ; Alemzadeh, I ; Sharif University of Technology
2009
Abstract
In this study, synthesis of conductive metal nanowires by using aligned and immobilised DNA strand on solid substrate is reported. The nanoporous gold film was prepared by electrostatic self assembly of gold nanoparticles capped with tryptophan. Tryptophan would improve surface properties of gold nanoparticles for strongly attaching to DNA. Fourier transform infrared (FTIR) spectroscopy confirmed that gold nanoparticles have been capped by tryptophan. Also measured zeta potential shows that there are positive charges on the surface of gold nanoparticles. Investigations by AFM observati on substantially confirm that tryptophan-capped gold nanoparticles can be bonded to DNA template...
Signed edge domination numbers in trees
, Article Ars Combinatoria ; Volume 93, Issue 1 OCT , 2009 , Pages 451-457 ; 03817032 (ISSN) ; Khodkar, A ; Sheikholeslami, M ; Sharif University of Technology
2009
Abstract
The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common endvertex with e. Let f be a function on E(G), the edge set of G, into the set {-1, 1}. If Σx∈N[e] f(x) ≥ 1 for each e ∈ E(G), then f is called a signed edge dominating function of G. The minimum of the values Σe∈E(G) f(e), taken over all signed edge dominating function f of G, is called the signed edge domination number of G and is denoted by γ′s(G). It has been conjectured that γ′s(T) ≥ 1 for every tree T. In this paper we prove that this conjecture is true and then classify all trees T with γ′s(T) = 1, 2 and 3
An upper bound for total domination subdivision numbers
, Article Ars Combinatoria ; Volume 102 , February , 2011 , Pages 321-331 ; 03817032 (ISSN) ; Khodkar, A ; Sheikholeslami, S. M ; Sharif University of Technology
2011
Abstract
A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number γt(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sd γt (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total domination number. In this paper we first prove that sdγt(G) < n -δ + 2 for every simple connected graph G of order n ≥ 3. We also classify all simple connected graphs G with sdγt (G) = n -δ+ 2,n-δ + 1, and n-δ
Optimal probabilistic initial and target channel selection for spectrum handoff in cognitive radio networks
, Article IEEE Transactions on Wireless Communications ; Volume 14, Issue 1 , 2015 , Pages 570-584 ; 15361276 (ISSN) ; Nasiri Kenari, M ; Ashtiani, F ; Sharif University of Technology
2015
Abstract
Spectrum mobility in cognitive radio networks not only enables the secondary users to guarantee the desired QoS of the primary users but also grants an efficient exploitation of the available spectrum holes in the network. In this paper, we propose a probabilistic approach in determining the initial and target channels for the handoff procedure in a single secondary user network. To characterize the network, a queuing theoretical framework is introduced, and 'stay' and 'change' handoff policies are both addressed. The performance of the secondary user in terms of average sojourn and extended service times for secondary connections is analyzed, and convex optimization problems with the...
An improved upper bound for signed edge domination numbers in graphs
, Article Utilitas Mathematica ; Volume 78 , 2009 , Pages 121-128 ; 03153681 (ISSN) ; Khodkar, A ; Sheikholeslami, S. M ; Sharif University of Technology
2009
Abstract
The closed neighborhood N G[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {-1, 1}. If σ xεN[e] f(x) ≥ 1 for each e ε E(G), Then f is called a signed edge dominating function of G. The minimum of the values of σ xεE(G) f(x), taken over every signed edge dominating function f of G, is called the signed edge domination number of G and is denoted by γ′ s(G). It has been conjectured that γ′ s(G) ≥ n - 1 for every simple graph G of order n. In this paper we prove that this conjecture is true for Eulerian simple graphs, simple graphs with all vertices of odd degree and regular...
Connected domination subdivision numbers of graphs
, Article Utilitas Mathematica ; Volume 77 , 2008 , Pages 101-111 ; 03153681 (ISSN) ; Karami, H ; Sheikholeslami, S. M ; Sharif University of Technology
2008
Abstract
A set S of vertices of a graph G = (V, E) is a connected dominating set if every vertex of V(G) S is adjacent to some vertex in S and the induced subgraph G[S] is connected. The connected domination number γc (G) is the minimum cardinality of a connected dominating set of G. The connected domination subdivision number sdγc(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the connected domination number. In this paper first we establish upper bounds on the connected domination subdivision number in terms of the order n of G or of its edge connectivity number K'(G). We also prove that γc(G) + sdγc(G) ≤ n - 1 with...
Total domination and total domination subdivision numbers
, Article Australasian Journal of Combinatorics ; Volume 38 , 2007 , Pages 229-235 ; 10344942 (ISSN) ; Karami, H ; Sheikholeslami, S. M ; Sharif University of Technology
2007
Abstract
A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S.The total domination number γ<(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sdγt(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total domination number. We show that sdγt(G) ≤ n - γt(G) + 1 for any graph G of order n ≥ 3 and that sdγt(G) < n-γt(G) except if G ≃ P3, C3, K4, P6 or C6