Loading...
Search for:
pashaei-darian--amir-salar
0.111 seconds
Total 1074 records
Designing and Implementing Service Based Mobile Network Framework
, M.Sc. Thesis Sharif University of Technology ; Hossein Khalaj, Babak (Supervisor)
Abstract
The growth of user traffic and appearance of new services, has changed architecture of mobile networks. Data flows have different requirments based on their services. Mobile platform should be able to recognize services and slice network resources based on them. Different approaches have been investigated using relevant standards and numerous articles. The focus of this thesis is on implement a platform based on fourth generation mobile networks that can differentiate between data flows according to their respective required QoS.We have implemented an IMS network and connected it to a mobile core network But IMS network just supports session-based services. We introduced a solution for non...
A Study of Steel Frames with Steel Plate Shear Wall Resisting System Subjected to Blast Loading
, M.Sc. Thesis Sharif University of Technology ; Aligani Moghaddam, Hassan (Supervisor) ; Saedi Darian, Amir (Co-Supervisor)
Abstract
Over the last years, terrorist attacks and accidental explosions have brought on a need for research in the field of structural engineering to study the response of a building subjected to blast loading conditions. An explosion within or surrounding a building, not only can have disastrous effects causing both structural damage or failure, but may also lead to the death of human beings.In order to prevent these catastrophes and gain a better understanding of responses of the buildings and lateral resisting systems with different characteristics, the study of the behavior of the lateral resisting systems under blast loading conditions is essential. This research will also aid in the...
Mathematical Programming Models for Graceful Labeling Problem of 2-Regular Graphs
, M.Sc. Thesis Sharif University of Technology ; Eshghi, Kourosh (Supervisor)
Abstract
An α-labeling of a graph is a special case of graceful labeling which was introduced in the late 1960’s. Despite the large number of papers published on this subject in literature, there are few particular techniques to find labeling of graphs. There are still many open problems on this subject, some of which are well-known in Graph Theory. In this thesis, first we present and solve several new mathematical and constraint programming models to find α-labeling of 2-regular graphs. Then, a comparison between their results is discussed. Since, proposed models can only label small size graphs; a tabu search algorithm for labeling the big size 2-regular graphs has been developed. By labeling...
A shock-detecting sensor for filtering of high-order compact finite difference schemes
, Article Journal of Computational Physics ; Volume 230, Issue 3 , February , 2011 , Pages 494-514 ; 00219991 (ISSN) ; Esfahanian, V ; Hejranfar, K ; Sharif University of Technology
2011
Abstract
A new shock-detecting sensor for properly switching between a second-order and a higher-order filter is developed and assessed. The sensor is designed based on an order analysis. The nonlinear filter with the proposed sensor ensures damping of the high-frequency waves in smooth regions and at the same time removes the Gibbs oscillations around the discontinuities when using high-order compact finite difference schemes. In addition, a suitable scaling is proposed to have dissipation proportional to the shock strength and also to minimize the effects of the second-order filter on the very small scales. Several numerical experiments are carried out and the accuracy of the nonlinear filter with...
Implementation of high-order compact finite-difference method to parabolized Navier-Stokes schemes
, Article International Journal for Numerical Methods in Fluids ; Volume 58, Issue 6 , 2008 , Pages 659-685 ; 02712091 (ISSN) ; Hejranfar, K ; Mahmoodi Darian, H ; Sharif University of Technology
2008
Abstract
The numerical solution to the parabolized Navier-Stokes (PNS) and globally iterated PNS (IPNS) equations for accurate computation of hypersonic axisymmetric flowfields is obtained by using the fourth-order compact finite-difference method. The PNS and IPNS equations in the general curvilinear coordinates are solved by using the implicit finite-difference algorithm of Beam and Warming type with a high-order compact accuracy. A shock-fitting procedure is utilized in both compact PNS and IPNS schemes to obtain accurate solutions in the vicinity of the shock. The main advantage of the present formulation is that the basic flow variables and their first and second derivatives are simultaneously...
On the use of high-order accurate solutions of PNS schemes as basic flows for stability analysis of hypersonic axisymmetric flows
, Article Journal of Fluids Engineering, Transactions of the ASME ; Volume 129, Issue 10 , 2007 , Pages 1328-1338 ; 00982202 (ISSN) ; Esfahanian, V ; Mahmoodi Darian, H ; Sharif University of Technology
2007
Abstract
High-order accurate solutions of parabolized Navier-Stokes (PNS) schemes are used as basic flow models for stability analysis of hypersonic axisymmetric flows over blunt and sharp cones at Mach 8. Both the PNS and the globally iterated PNS (IPNS) schemes are utilized. The IPNS scheme can provide the basic flow field and stability results comparable with those of the thin-layer Navier-Stokes (TLNS) scheme. As a result, using the fourth-order compact IPNS scheme, a high-order accurate basic flow model suitable for stability analysis and transition prediction can be efficiently provided. The numerical solution of the PNS equations is based on an implicit algorithm with a shock fitting procedure...
Implementation of high-order compact schemes to the iterative parabolized Navier-Stokes equations
, Article 25th Congress of the International Council of the Aeronautical Sciences 2006, Hamburg, 3 September 2006 through 8 September 2006 ; Volume 3 , 2006 , Pages 1628-1643 ; Hejranfar, K ; Darian, H. M ; Sharif University of Technology
Curran Associates Inc
2006
Abstract
The numerical solution of the parabolized Navier-Stokes (PNS) and globally iterated PNS (IPNS) equations for accurate computation of hypersonic axisymmetric flowfields is obtained by using the fourth-order compact finite-difference method. The PNS and IPNS equations in the general curvilinear coordinates are solved by using the implicit finite-difference algorithm of Beam and Warming type with a high-order compact accuracy. A shock fitting procedure is utilized in both the compact PNS and IPNS schemes to obtain accurate solutions in the vicinity of the shock. The main advantage of the present formulation is that the basic flow variables and their first and second derivatives are...
Nano-layered manganese oxides as low-cost, easily synthesized, environmentally friendly and efficient catalysts for epoxidation of olefins
, Article RSC Advances ; Volume 2, Issue 9 , 2012 , Pages 3654-3657 ; 20462069 (ISSN) ; Najafpour, M. M ; Nayeri, S ; Pashaei, B ; Bagherzadeh, M ; Sharif University of Technology
2012
Abstract
Incorporation of calcium(ii), zinc(ii) and aluminium(iii) to manganese oxides greatly improved the activity of manganese oxide towards the epoxidation of olefins in the presence of anhydrous tert-butyl hydroperoxide as an oxidant
Electrodeposition of Platinum Nanowires
, M.Sc. Thesis Sharif University of Technology ; Dolati, Abolghasem (Supervisor) ; Ghorbani, Mohammad (Supervisor)
Abstract
Platinum nanowires were prepared by electrodeposition in polycarbonate membrane, with different average diameter of nanowires about 15, 50 and 100 nm and the height about 6 µm. Kinetics of electrodeposition process were studied by electrochemical techniques such as voltammetry and chronoamperometry methods. Diffusion coefficient was then calculated from the electrochemical parameters and consequently the density of primer nuclei was extracted. The morphology of Pt nanowires was characterized by SEM, TEM and EDX. The results show that growing Nanowires on the surface of template is branch-like. The electro-oxidation of methanol and hydrogen on this electrode is investigated at room...
On the introduction of a qualitative variable to the neural network for reactor modeling: Feed type
, Article Industrial and Engineering Chemistry Research ; Volume 48, Issue 8 , 2009 , Pages 3820-3824 ; 08885885 (ISSN) ; Mehdizadeh, H ; Bozorgmehry Boozarjomehry, R ; Towfighi Darian, J ; Sharif University of Technology
2009
Abstract
Thermal cracking of hydrocarbons converts them into valuable materials in the petrochemical industries. Multiplicity of the reaction routes and complexity of the mathematical approach has led us use a kind of black-box modelingsartificial neural networks. Reactor feed type plays an essential role on the product qualities. Feed type is a qualitative character. In this paper, a method is presented to introduce a range of petroleum fractions to the neural network. To introduce petroleum cuts with final boiling points of 865 °F maximum to the neural network, a real component substitute mixture is made from the original mixture. Such substitute mixture is fully defined, it has a chemical...
Accelerated heat transfer in thermal cracking reactor tubes: the time for sinusoidal corrugated configuration
, Article Brazilian Journal of Chemical Engineering ; 2022 ; 01046632 (ISSN) ; Ardjmand, M ; Towfighi Darian, J ; Khorasheh, F ; Sharif University of Technology
Springer Science and Business Media Deutschland GmbH
2022
Abstract
Olefin industry came to a commercialization maturity, but still energy consumption, coke formation and thermal cracking optimization seem hot debates. The typical use of static mixers or fins inside the pipes itself leads to significant pressure drop, leading to higher power consumption and lower selectivity of olefins production. Herein we propose an innovative approach, i.e., accelerated sinusoidal heat transfer through mixing at viscous sublayer pipe-fluid interface. CFD simulation by SOLIDWORKS, ANSYS FLUENT computer-aided computations visualized hydrodynamic wave effects on heat transfer in corrugated tube taking bare tubes as reference. The length and outside diameter of tube were...
A general model for I/O system theory, Proceedings of AIMC31 [electronic resource]
, Article Iranian Journal of Fuzzy Systems ; 2006, Volume 3, Issue 2, Page 1-19 ; Hashem, Amir ; Sharif University of TechnologyExperimental and Numerical Study of Spray Combustion under Hot-diluted Conditions
, M.Sc. Thesis Sharif University of Technology ; Mardani, Amir (Supervisor)
Abstract
In this thesis, combustion of liquid fuel spray under the condition of hot and diluted oxidizer, has been investigated. To this end, a novel type laboratory-scale test rig was designed to study the physics governing the MILD-Spray combustion conditions with an applied approach. The underlined test rig eliminates the operational problems of its predecessor test stands and is used for a heavier fuel with much more complex chemical composition (kerosene). The test section is axially symmetrical, in which the fuel is injected by a pressure-swirl atomizer in the direction of hot and diluted co-flowing air. With the use of the aforesaid test rig, the effect of variables such as oxygen...
General theory of translation invariant systems [electronic resource]
, Article Mathematics and Its Applications ; Volume 329, 1995, pp 77-89 ; Sharif University of Technology
Abstract
The basic goal of this article is to present an abstract system-theoretic approach to morphological filtering and the theory of translation invariant systems which is mainly based on residuated semigroups. Some new results as well as a number of basic questions are also introduced
Duality in a generalized model for translation invariant systems [electronic resource]
, Article Fuzzy Sets and Systems ; 1996, Volume 83, Issue 3, Pages 347–352 ; Sharif University of Technology
Abstract
In a previous paper we introduced a generalized model for translation invariant (TI) operators. In this model we considered the space, φ of all maps from an abelian group G to ω U {-∞}, called LG-fuzzy sets, where ω is a complete lattice-ordered group; and we defined TI operators on this space. Also, in that paper, we proved strong reconstruction theorem to show the consistency of this model. This theorem states that for an order-preserving TI operator Y one can explicitly compute Y(A), for any A, from a specific subset of φ called the base of Y. In this paper duality is considered in the same general framework, and in this regard, continuous TI operators are studied. This kind of operators...
Reconstruction in a generalized model for translation invariant systems [electronic resource]
, Article Fuzzy Sets and Systems ; 1996, Volume 83, Issue 1, Pages 51–55 ; Sharif University of Technology
Abstract
We consider translation invariant (TI) operators on Φ, the set of maps from an abelian group G to Ω ∪ {−∞} , called LG-fuzzy sets, where 0 is a complete lattice ordered group. By defining Minkowski and morphological operations on Φ and considering order preserving operators, we prove a reconstruction theorem. This theorem, which is called the Strong Reconstruction Theorem (SRT), is similar to the Convolution Theorem in the theory of linear and shift invariant systems and states that for an order preserving TI operator Y one can explicitly compute Y ( A ), for any A , from a specific subset of Φ called the base of Y . The introduced framework is a general model for the theory of translation...
Residuated semigroups and morphological aspects of translation invariant systems [electronic resource]
, Article 1997, Volume 90, Issue 1, Pages 69–81 ; Fuzzy Sets and Systems ; Sharif University of Technology
Abstract
The main goal of this paper is to verify classical properties of morphological operators within the general model of translation invariant (TI) systems. In this model, TI operators are defined on the space of LG-fuzzy sets Φ i.e. Φ = {A: G → Ω ∪ {− ∞}} in which G is an abelian group and Ω is a complete lattice ordered group. A TI operator Y is an operator on Φ which is invariant under translation on G and Ω as groups. We consider the generalization of Minkowski addition (D on Φ and we emphasize that (Φ,⊛) is an involutive residuated topological monoid. We verify all properties of traditional (set-theoretic) morphological operators as well as classical representations (Matheron, 1967) for...
Forcing structures and cliques in uniquely vertex colorable graphs [electronic resource]
, Article SIAM Journal on Discrete Mathematics ; 2001, Volume 14, Issue 4, Pages 433-445 ; Sharif University of Technology
Abstract
Let G be a simple undirected uniquely vertex k-colorable graph, or a k-UCG for short. M. Truszczyński [Some results on uniquely colorable graphs, in Finite and Infinite Sets, North-Holland, Amsterdam, 1984, pp. 733--748] introduced $e^{^{*}}(G)=|V(G)|(k-1)-{k \choose 2}$ as the minimum number of edges for a k-UCG and S. J. Xu [J. Combin. Theory Ser. B, 50 (1990), pp. 319--320] conjectured that any minimal k-UCG contains a Kk as a subgraph. In this paper, first we introduce a technique called forcing. Then by applying this technique in conjunction with a feedback structure we construct a k-UCG with clique number k-t, for each $t \geq 1$ and each k, when k is large enough. This also...
Graph homomorphisms and nodal domains [electronic resource]
, Article Linear Algebra and its Applications ; 2006, Volume 418, Issue 1, Pages 44–52 ; Sharif University of Technology
Abstract
In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adjacency matrix. Also, we present some applications in graph decompositions where we prove a general version of Fisher’s inequality for G-designs
On defining numbers of circular complete graphs
, Article Discrete Mathematics ; Volume 307, Issue 2, 28 January 2007, Pages 173–180 ; Sharif University of Technology
Abstract
Let d(σ)d(σ) stand for the defining number of the colouring σσ. In this paper we consider View the MathML sourcedmin=minγd(γ) and View the MathML sourcedmax=maxγd(γ) for the onto χχ-colourings γγ of the circular complete graph Kn,dKn,d. In this regard we obtain a lower bound for dmin(Kn,d)dmin(Kn,d) and we also prove that this parameter is asymptotically equal to χ-1χ-1. Also, we show that when χ⩾4χ⩾4 and s≠0s≠0 then dmax(Kχd-s,d)=χ+2s-3dmax(Kχd-s,d)=χ+2s-3, and, moreover, we prove an inequality relating this parameter to the circular chromatic number for any graph G