Loading...
Search for: sarmast--ardeshir
0.091 seconds

    The influence of welding polarity on mechanical properties, microstructure and residual stresses of gas tungsten arc welded AA5052

    , Article International Journal of Advanced Manufacturing Technology ; Volume 105, Issue 7-8 , 2019 , Pages 3397-3409 ; 02683768 (ISSN) Sarmast, A ; Serajzadeh, S ; Sharif University of Technology
    Springer  2019
    Abstract
    The effect of welding current and polarity, i.e. AC and DCEN, on imposed thermal cycles, mechanical properties, microstructural events and residual stresses was investigated in GTA welding of AA5052. A three-dimensional thermo-mechanical model was utilized to evaluate thermal responses and residual stresses distribution in the weldments. Tensile testing and hardness measurements were also conducted to study the effect of welding polarity on the mechanical properties of components. Microstructural observations utilizing optical microscopy were carried out to assess the microstructural evolutions. The results show that wide varieties of microstructures are produced in DCEN sample from cells at... 

    Optimization of Dynamic Wireless Power Transfer for Maximum Power Transmission to Electric Vehicles

    , M.Sc. Thesis Sharif University of Technology Sarmast Ghahfarokhi, Shahriar (Author) ; Tahami, Farzad (Supervisor)
    Abstract
    Nowadays, due to environmental problems, electric cars are becoming more and more popular. The main drawback of these cars is due to the large volume, weight, and price of the battery and its long charging time. Charging the battery at short intervals or even in moving, can help to use a smaller battery and reduce battery problems. Therefore, the dynamic wireless power transmission technology that provides power without having to stop the car to recharge its batteries can revolutionize the electric car industry. The ever-expanding advance of power electronics and wireless power transmission technologies has made it possible to transfer power to moving electric cars. Barriers to this industry... 

    Numerical and experimental investigation on influence of initial microstructure on GTA-welded age-hardened AA2024

    , Article International Journal of Advanced Manufacturing Technology ; Volume 97, Issue 1-4 , 2018 , Pages 1335-1346 ; 02683768 (ISSN) Sarmast, A ; Serajzadeh, S ; Jamshidi Aval, H ; Sharif University of Technology
    Springer London  2018
    Abstract
    Influence of gas tungsten arc welding on the thermal responses, residual stress distribution and final mechanical properties of the naturally age-hardened (T4) and artificially age-hardened (T6) AA2024 plates was studied. The results showed that age hardening and over-aging occurred in various sections of the heat-affected zone (HAZ) of T4 sample, depending on their locations, while in the HAZ of T6 sample, over-aging is the governing phenomenon. Also, subsequent natural aging occurred in HAZ, weld metal (WM) and partially melted material (PMM) of both weldments. This recent phenomenon is more obvious in the T4 sample in comparison with the T6 one. In both microstructures, weld metal is the... 

    A study on thermal responses, microstructural issues, and natural aging in gas tungsten arc welding of AA2024-T4

    , Article Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture ; Vol. 228, issue. 3 , 2014 , p. 413-421 Sarmast, A ; Serajzadeh, S ; Kokabi, A. H ; Sharif University of Technology
    2014
    Abstract
    In this study, a three-dimensional model has been utilized for predicting thermal responses during tungsten arc welding of AA2024-T4 plates in which double ellipsoidal heat source model was employed to consider the moving torch in the model. Furthermore, tensile and hardness tests and microstructural evaluations have been carried out to investigate the mechanical properties and the microstructures within the welded metal. The results show that there is a region inside the heat-affected zone where hardness increases while in some parts of this region having temperatures higher than 250 C the hardness decreases significantly. Furthermore, natural aging occurs after welding; however, its... 

    Optimization of Fuel Arrangement of Second Cycle of Bushehr Power Plant with Utilization Data

    , M.Sc. Thesis Sharif University of Technology Sarmast, Asgar (Author) ; Vosoughi, Naser (Supervisor) ; Hosseini, Abolfazl (Co-Advisor)
    Abstract
    One of the ways to enhance the safety and economic performance of nuclear power plants, is to choose an appropriate policy for arrange the reactor fuel assembly in the beginning of each cycle. There are variety of ways to optimize the layout of the fuel in the reactor core, but to achieve more than one goal, choosing multi-objective method can be used.One of the intelligent optimization methods is the genetic algorithms that emulate nature of biological processes and can be used to optimize two or more of the target.The goals of this research is to increase the neutron multiplication factor is to make maximum use of the fuel in the reactor and maintain the radial power peaking factor for... 

    Incorporating Degree of Belief, Desire and Capability into Propositional Belief Desire and Intention Logic

    , M.Sc. Thesis Sharif University of Technology Salimi, Babak (Author) ; Ardeshir, Mohammad (Supervisor)
    Abstract
    Nowadays, BDI architecture is of the most well known agent’s architectures. BDI architecture or the architecture in which the system is viewed as rational agents based on the attitudes of belief, desire and intention represents an abstraction of human deliberation based on a theory of rational action in the human cognition process. BDI logic introduced by Rao and Georgeff have been widely used as the theoretical basis of specification and implementation of rational agents. BDI logic is limited to deal with crisp assertion, while the assertions encountered in real world are not precise and thus cannot be treated simply by using yes or no. Moreover, In order to obtain more human like agents we... 

    Description Logic and Its Application in Model Checking

    , M.Sc. Thesis Sharif University of Technology Sakhaee, Negar (Author) ; Ardeshir, Mohammad (Supervisor)
    Abstract
    Description logic is a family of knowledge representive languages which represents knowledge via propositional logic (first order logic) propositions and constructors and applies its services for reasoning and consistency checking. Nowadays description logic and its popular reasoner FaCT++ which applies tablue reasoning technique are widely used in applications such as semantic web and onthologies. Model checking is a technique for systems and models verification and to guarantee the accuracy of design. Given a model description and a specification formula, the model checker verifies the model against the specification and decides if the model satisfies the description or not. Main model... 

    Advanced Pregroup Analysis of Persian Grammar

    , M.Sc. Thesis Sharif University of Technology Ghanbarpour, Reza (Author) ; Ardeshir, Mohammad (Supervisor)
    Abstract
    Pregroups as a mathematical structure, are replacement for Lambek's type caregorial grammar which much used in Computational Linguistics. Because of computational and logical properties of pregroups, we can use them as strong tool to analyse the sentence structure of many natural languages. This kind of analysis has been done for English, French, German, Polish, Italian, Arabic and Japanese. In case of Persian language, analysis of simple and compound sentences structure with simple tense verbs and explicit subjects and objects has been studied. In this M.Sc. thesis, we will extent analysis of Persian sentence structure to sentences with compound tense verbs and implicit subjects and objects... 

    Investigating Basic Logics and Their Possible Interrelation

    , M.Sc. Thesis Sharif University of Technology Vaezian, Vahid (Author) ; Ardeshir, Mohammad (Supervisor)
    Abstract
    In logic literature, the phrase “basic logic” can refer to three different logical systems. First, basic propositional logic (BPL) that was introduced by A. Visser in 1981. This logic is a subintuitionistic logic, that can be obtained from intuitionistic logic by a weakening of modus ponens. One decade later, Wim Ruitenberg regarding philosophical critiques of logical connectives, reintroduced BPL and its first order extension, BQC. From then, different aspects of basic logic have been investigated by logicians all over the world. Another logical system with the name “basic logic” is the system that was introduced by G. Sambin and G. Battilotti in 1997. The goal of this system is to provide... 

    A unification of the basic logics of Sambin and Visser

    , Article Logic Journal of the IGPL ; Volume 20, Issue 6 , 2012 , Pages 1202-1213 ; 13670751 (ISSN) Ardeshir, M ; Vaezian, V ; Sharif University of Technology
    2012
    Abstract
    In logical literature, the phrase 'basic logic' refers to at least three different logical systems. The first one, basic propositional logic, BPL was introduced by Albert Visser in 1981. This logic is a subintuitionistic logic that can be obtained from intuitionistic logic by weakening of modus ponens. The second logical system with the name 'basic logic', is the system B that was introduced by G. Sambin and G. Battilotti in 1997. The goal of this logical system is to provide a common foundation for all usual non-modal logics. The third one is called 'basic logic' by P. Hajek in the field of Fuzzy Logic. We show that the two systems BPL and B do not have a direct relationship (i.e. none of... 

    On the constructive notion of closure maps

    , Article Mathematical Logic Quarterly ; Volume 58, Issue 4-5 , 2012 , Pages 348-355 ; 09425616 (ISSN) Ardeshir, M ; Ramezanian, R ; Sharif University of Technology
    Wiley  2012
    Abstract
    Let A be a subset of the constructive real line. What are the necessary and sufficient conditions for the set A such that A is continuously separated from other reals, i.e., there exists a continuous function f with f -1(0) = A? In this paper, we study the notions of closed sets and closure maps in constructive reverse mathematics  

    Epistemic Protocols in Gossip Problem and Modeling Secrecy and Ignorance

    , Ph.D. Dissertation Sharif University of Technology Ramezanian, Rahim (Author) ; Ardeshir, Mohammad (Supervisor)
    Abstract
    Epistemic algorithms are instructions and rules based on knowledge of agents. These algorithms by individual or group knowledge of agents make decisions about future behavior of systems. Epistemic gossip protocols is one of these algorithms. They are used to for spreading secrets among nodes in a network. According to individual knowledge of each node they decide who calls whom in each step. In security problems epistemic algorithms are used to detect the safety of protocols. Some epistemic notions like ignorance and contingency are used in formalization of security problems. In the thesis we study these epistemic algorithms  

    Incompleteness in the Finite Domain

    , M.Sc. Thesis Sharif University of Technology Khaniki, Erfan (Author) ; Ardeshir, Mohammad (Supervisor)
    Abstract
    In this thesis, we study proof complexity conjectures and also introduce their mathematical logic equivalents in terms of provability and unprovability in strong enough first-order arithmetical theories. One of the most important conjectures in this theory is the following conjecture. The non-existence of an optimal proof system for propositional tautologies: In general, a proof system is a computable function in polynomial time such that its range is exactly the set of tautologies. We say proof system P, polynomially simulates proof system Q if and only if there exists a polynomial h such that for all tautologies such as A and for all proofs like a, if Qpaq A, then there exists a proof... 

    The double negation of the intermediate value theorem

    , Article Annals of Pure and Applied Logic ; Volume 161, Issue 6 , 2010 , Pages 737-744 ; 01680072 (ISSN) Ardeshir, M ; Ramezanian, R ; Sharif University of Technology
    2010
    Abstract
    In the context of intuitionistic analysis, we consider the set F consisting of all continuous functions φ{symbol} from [0, 1] to R such that φ{symbol} (0) = 0 and φ{symbol} (1) = 1, and the set I0 consisting of φ{symbol}'s in F where there exists x ∈ [0, 1] such that φ{symbol} (x) = frac(1, 2). It is well-known that there are weak counterexamples to the intermediate value theorem, and with Brouwer's continuity principle we have I0 ≠ F. However, there exists no satisfying answer to I0¬ ¬ =? F. We try to answer to this question by reducing it to a schema (which we call ED) about intuitionistic decidability that asserts "there exists an intuitionistically enumerable set that is not... 

    The principle of open induction and specker sequences

    , Article Logic Journal of the IGPL ; Volume 25, Issue 2 , 2017 , Pages 232-238 ; 13670751 (ISSN) Ardeshir, M ; Ghafouri, Z ; Sharif University of Technology
    Oxford University Press  2017
    Abstract
    The schema ED asserts that 'there exists an intuitionistically enumerable subset of N which is not intuitionistically decidable.' In this article, we prove that in the presence of Markov's Principle over Bishop's constructive analysis, ¬ED is equivalent to the principle of open induction on [0,1], via Specker sequences. © 2016. Oxford University Press. All rights reserved  

    Compactness, colocatedness, measurability and ED

    , Article Logic Journal of the IGPL ; Volume 26, Issue 2 , January , 2018 , Pages 244-254 ; 13670751 (ISSN) Ardeshir, M ; Ghafouri, Z ; Sharif University of Technology
    Oxford University Press  2018
    Abstract
    In classical analysis, every compact subset of ℝ is Lebesgue measurable, but it is not true in constructive analysis. In this paper, we prove that the statement 'every compact set K in a locally compact space X is integrable with respect to a positive measure μ' is equivalent to LPO, over Bishop's constructive analysis. We also prove that the existence of a compact subset of ℝ which is not Lebesgue integrable is equivalent to the schema ED, which asserts that 'there exists an intuitionistically enumerable subset of ℕ which is not intuitionistically decidable'. Moreover, classically, every open subset of ℝ is Lebesgue measurable, but it is not true constructively. We show that Lebesgue... 

    The Σ1-provability logic of HA

    , Article Annals of Pure and Applied Logic ; Volume 169, Issue 10 , 2018 , Pages 997-1043 ; 01680072 (ISSN) Ardeshir, M ; Mojtahedi, M ; Sharif University of Technology
    Elsevier B.V  2018
    Abstract
    In this paper we introduce a modal theory iHσ which is sound and complete for arithmetical Σ1-interpretations in HA, in other words, we will show that iHσ is the Σ1-provability logic of HA. Moreover we will show that iHσ is decidable. As a by-product of these results, we show that HA+□⊥ has de Jongh property. © 2018 Elsevier B.V  

    Latarres, Lattices with an Arrow

    , Article Studia Logica ; Volume 106, Issue 4 , 2018 , Pages 757-788 ; 00393215 (ISSN) Ardeshir, M ; Ruitenburg, W ; Sharif University of Technology
    Springer Netherlands  2018
    Abstract
    A latarre is a lattice with an arrow. Its axiomatization looks natural. Latarres have a nontrivial theory which permits many constructions of latarres. Latarres appear as an end result of a series of generalizations of better known structures. These include Boolean algebras and Heyting algebras. Latarres need not have a distributive lattice. © 2017, Springer Science+Business Media B.V  

    Latarres, lattices with an arrow

    , Article Studia Logica ; 2017 , Pages 1-32 ; 00393215 (ISSN) Ardeshir, M ; Ruitenburg, W ; Sharif University of Technology
    2017
    Abstract
    A latarre is a lattice with an arrow. its axiomatization looks natural. Latarres have a nontrivial theory which permits many constructions of latarres. Latarres appear as an end result of a series of generalizations of better known structures. These include Boolean algebras and Heyting algebras. Latarres need not have a distributive lattice. © 2017 Springer Science+Business Media B.V  

    The Σ1-Provability Logic of HA

    , Article Journal of Symbolic Logic ; Volume 84, Issue 3 , 2019 , Pages 1118-1135 ; 00224812 (ISSN) Ardeshir, M ; Mojtahedi, M ; Sharif University of Technology
    Cambridge University Press  2019
    Abstract
    For the Heyting Arithmetic HA,HA is defined [14, 15] as the theory {A | HA-A}, where is called the box translation of A (Definition 2.4). We characterize the Σ1-provability logic of HA as a modal theory (Definition 3.17). © 2019 The Association for Symbolic Logic