Loading...
Search for:
mahdavi--z
0.1 seconds
Total 2161 records
ACM: Accurate crosstalk modeling to predict channel delay in Network-on-Chips
, Article 2016 IEEE 22nd International Symposium on On-Line Testing and Robust System Design, IOLTS 2016, 4 July 2016 through 6 July 2016 ; 2016 , Pages 7-8 ; 9781509015061 (ISBN) ; Shirmohammadi, Z ; Miremadi, S. G ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2016
Abstract
The severity of timing delay in the communication channels of Network on Chip (NoC) depends on the transition patterns appearing on the wires. An analytical model can estimate the timing delay in NoC channels in the presence of crosstalk faults. However, recently proposed analytical model does not have enough accuracy and is based on 3-wire delay model. In this paper, an Accurate Crosstalk Model (ACM) based on 5-wire delay model is proposed to estimate the delay of communication channels in the presence of crosstalk faults. ACM is more accurate due to considering more wires in the delay model and also considering the overlaps between locations of transition patterns
Self aligned passivation of Cu in Cu/Cr, Cu/V and Cu/Ta multilayers
, Article 12th International Conference on Microelectronics, ICM 2000, 31 October 2000 through 2 November 2000 ; Volume 2000-October , 2000 , Pages 209-212 ; 9643600572 (ISBN) ; Vashaei, Z ; Mahdavi, S. M ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2000
Abstract
We compare Cu/M/SiO2 (M=Cr,V and Ta) multilayers that were deposited on Si substrates. Sample resistance measurements were carried out during annealing in 80% N2+20% H2, N2 and Ar environments. Resistivity measurements, SEM observations, RBS and AES spectroscopies from annealed samples showed good diffusion barrier properties for Cr and V but rather poor properties for Ta buffer layers. This is due to the amorphous nature of Cr films and formation of a continuous Cu overlayer. SEM observation also showed granular structure for Cu/V and Cu/Ta with grain sizes of about 500 and 1000 Å respectively. However, shallow nitrogen implantation in Cu/V samples and DC biasing for Cu/Ta layers during...
New models and algorithms for solutions of single-signed fully fuzzy LR linear systems
, Article Iranian Journal of Fuzzy Systems ; Volume 9, Issue 3 , 2012 , Pages 1-26 ; 17350654 (ISSN) ; Khezerloo, S ; Mahdavi Amiri, N ; Valizadeh, Z ; Sharif University of Technology
2012
Abstract
We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System (FFLS) of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an FFLS with a nonnegative coefficient matrix, we consider an equivalent FFLS by using an appropriate permutation to simplify fuzzy multiplications. To solve the m × n permutated system, we convert it to three m × n real linear systems, one being concerned with the cores and the other two being related to the left and right spreads. To decide whether the core system is consistent or not, we use the modified Huang algorithm of the class of ABS methods. If...
Large-Neighborhood infeasible predictor–corrector algorithm for horizontal linear complementarity problems over cartesian product of symmetric cones
, Article Journal of Optimization Theory and Applications ; 2018 ; 00223239 (ISSN) ; Mansouri, H ; Darvay, Z ; Zangiabadi, M ; Mahdavi Amiri, N ; Sharif University of Technology
Springer New York LLC
2018
Abstract
We present an infeasible interior-point predictor–corrector algorithm, based on a large neighborhood of the central path, for horizontal linear complementarity problem over the Cartesian product of symmetric cones. Throughout the paper, we assume that a certain property holds for the above-mentioned problem. This condition is equivalent to the property of sufficiency for the particular case of horizontal linear complementarity problem. The polynomial convergence is shown for the commutative class of search directions. We specialize our algorithm further by prescribing some scaling elements and also consider the case of feasible starting points. We believe this to be the first interior-point...
Large-Neighborhood infeasible predictor–corrector algorithm for horizontal linear complementarity problems over cartesian product of symmetric cones
, Article Journal of Optimization Theory and Applications ; Volume 180, Issue 3 , 2019 , Pages 811-829 ; 00223239 (ISSN) ; Mansouri, H ; Darvay, Z ; Zangiabadi, M ; Mahdavi Amiri, N ; Sharif University of Technology
Springer New York LLC
2019
Abstract
We present an infeasible interior-point predictor–corrector algorithm, based on a large neighborhood of the central path, for horizontal linear complementarity problem over the Cartesian product of symmetric cones. Throughout the paper, we assume that a certain property holds for the above-mentioned problem. This condition is equivalent to the property of sufficiency for the particular case of horizontal linear complementarity problem. The polynomial convergence is shown for the commutative class of search directions. We specialize our algorithm further by prescribing some scaling elements and also consider the case of feasible starting points. We believe this to be the first interior-point...
A full-newton step interior-point method for monotone weighted linear complementarity problems
, Article Journal of Optimization Theory and Applications ; Volume 186, Issue 3 , 2020 , Pages 864-878 ; Darvay, Z ; Lesaja, G ; Mahdavi Amiri, N ; Potra, F ; Sharif University of Technology
Springer
2020
Abstract
In this paper, a full-Newton step Interior-Point Method for solving monotone Weighted Linear Complementarity Problem is designed and analyzed. This problem has been introduced recently as a generalization of the Linear Complementarity Problem with modified complementarity equation, where zero on the right-hand side is replaced with the nonnegative weight vector. With a zero weight vector, the problem reduces to a linear complementarity problem. The importance of Weighted Linear Complementarity Problem lies in the fact that it can be used for modelling a large class of problems from science, engineering and economics. Because the algorithm takes only full-Newton steps, the calculation of the...
Thermochemical growth of Mn-doped CdS nanoparticles and study of luminescence evolution
, Article Nanotechnology ; Volume 19, Issue 22 , 2008 ; 09574484 (ISSN) ; Taghavinia, N ; Sedaghat, Z ; Iraji Zad, A ; Mahdavi, S. M ; Sharif University of Technology
2008
Abstract
We report a new method of growing Mn-doped CdS (CdS:Mn) nanoparticles in an aqueous solution at boiling temperature. The idea is to use precursors that react only at high temperature, in order to gain crystalline luminescent nanoparticles. CdSO4, Mn(NO3)2 and Na 2S2O3 were used as the precursors, and thioglycerol was employed as the capping agent and also the reaction catalyst. Na2S2O3 is thermally sensitive and it releases S2- ions upon heating. The CdS:Mn nanoparticles obtained are about 4 nm in size and show both cubic and hexagonal crystalline phases with a ratio of 35% to 65%. The luminescence of nanoparticles contains a peak at 580 nm, which is related to Mn2+ ions. Prolonged reaction...
An efficient and convenient approach for synthesizing iodohydrin and iodoether from aromatic alkenes using Hg(BF4)2.SiO2 and I2
, Article Polycyclic Aromatic Compounds ; 2021 ; 10406638 (ISSN) ; Mousavi, S. R ; Ahmadi, Y ; Batooei, N ; Sotoudehnia Korrani, Z ; Mahdavi, M ; Sharif University of Technology
Bellwether Publishing, Ltd
2021
Abstract
A new and simple method for synthesizing iodohydrins and iodoethers from aromatic alkenes is described. Iodohydrins and iodoether derivatives were prepared in excellent yield using Mercury(II) tetrafluoroborate (Hg(BF4)2.SiO2)/I2 in aqueous THF or alcohols (methanol, iso-propanol and tert-butanol). The reactions take place at room temperature, short reaction times, and high regioselectivity, following Markovnikov fashion. © 2021 Taylor & Francis Group, LLC
An efficient and convenient approach for synthesizing iodohydrin and iodoether from aromatic alkenes using Hg(BF4)2.SiO2 and I2
, Article Polycyclic Aromatic Compounds ; Volume 42, Issue 7 , 2022 , Pages 3975-3983 ; 10406638 (ISSN) ; Mousavi, S. R ; Ahmadi, Y ; Batooei, N ; Sotoudehnia Korrani, Z ; Mahdavi, M ; Sharif University of Technology
Taylor and Francis Ltd
2022
Abstract
A new and simple method for synthesizing iodohydrins and iodoethers from aromatic alkenes is described. Iodohydrins and iodoether derivatives were prepared in excellent yield using Mercury(II) tetrafluoroborate (Hg(BF4)2.SiO2)/I2 in aqueous THF or alcohols (methanol, iso-propanol and tert-butanol). The reactions take place at room temperature, short reaction times, and high regioselectivity, following Markovnikov fashion. © 2021 Taylor & Francis Group, LLC
Two-dimensional clustering of nanoparticles on the surface of cellulose fibers
, Article Journal of Physical Chemistry C ; Volume 113, Issue 28 , 2009 , Pages 12022-12027 ; 19327447 (ISSN) ; Taghavinia, N ; Irajizad, A ; Mahdavi, M ; Ye, J ; Chavoshi, M ; Vashaei, Z ; Sharif University of Technology
2009
Abstract
Density of surface charges of cellulose fibers and -potential of TiO2 nanoparticles in the solution were measured and controlled by pH. The adsorption and clustering of TiO2 nanoparticles on the surface of cellulose fibers were studied using scanning electron microscopy (SEM) and a scale in different situations of repulsion and attraction between the particles and surface. The experiments show formation of two-dimensional clusters of nanoparticles on the surface. Weight measurement of the adsorbed particles and clusters via the adsorption time results in that there are three stages containing nucleation, two-dimensional growth and saturation for clustering of nanoparticles on the surface....
Reverse time migration by Krylov subspace reduced order modeling
, Article Journal of Applied Geophysics ; Volume 151 , April , 2018 , Pages 298-308 ; 09269851 (ISSN) ; Javaherian, A ; Shomali, Z. H ; Dehghani Firouz Abadi, R ; Gholamy, S. A ; Sharif University of Technology
Elsevier B.V
2018
Abstract
Imaging is a key step in seismic data processing. To date, a myriad of advanced pre-stack depth migration approaches have been developed; however, reverse time migration (RTM) is still considered as the high-end imaging algorithm. The main limitations associated with the performance cost of reverse time migration are the intensive computation of the forward and backward simulations, time consumption, and memory allocation related to imaging condition. Based on the reduced order modeling, we proposed an algorithm, which can be adapted to all the aforementioned factors. Our proposed method benefit from Krylov subspaces method to compute certain mode shapes of the velocity model computed by as...
A modified ant colony system for finding the expected shortest path in networks with variable arc lengths and probabilistic nodes
, Article Applied Soft Computing Journal ; Vol. 21, issue , August , 2014 , p. 491-500 ; Hassanzadeh, R ; Mahdavi, I ; Mahdavi-Amiri, N ; Sharif University of Technology
2014
Abstract
The problem of finding the expected shortest path in stochastic networks, where the presence of each node is probabilistic and the arc lengths are random variables, have numerous applications, especially in communication networks. The problem being NP-hard we use an ant colony system (ACS) to propose a metaheuristic algorithm for finding the expected shortest path. A new local heuristic is formulated for the proposed algorithm to consider the probabilistic nodes. The arc lengths are randomly generated based on the arc length distribution functions. Examples are worked out to illustrate the applicability of the proposed approach
A genetic algorithm for optimization problems with fuzzy relation constraints using max-product composition
, Article Applied Soft Computing Journal ; Volume 11, Issue 1 , 2011 , Pages 551-560 ; 15684946 (ISSN) ; Khorram, E ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
2011
Abstract
We consider nonlinear optimization problems constrained by a system of fuzzy relation equations. The solution set of the fuzzy relation equations being nonconvex, in general, conventional nonlinear programming methods are not practical. Here, we propose a genetic algorithm with max-product composition to obtain a near optimal solution for convex or nonconvex solution set. Test problems are constructed to evaluate the performance of the proposed algorithm showing alternative solutions obtained by our proposed model
A genetic optimization algorithm and perceptron learning rules for a bi-criteria parallel machine scheduling
, Article Journal of the Chinese Institute of Industrial Engineers ; Volume 29, Issue 3 , 2012 , Pages 206-218 ; 10170669 (ISSN) ; Hassanzadeh, R ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
2012
Abstract
This work considers scheduling problems minding the setup and removal times of jobs rather than processing times. For some production systems, setup times and removal times are so important to be considered independent of processing times. In general, jobs are performed according to the automatic machine processing in production systems, and the processing times are considered to be constant regardless of the process sequence. As the human factor can influence the setup and removal times, when the setup process is repetitive the setup times decreases. This fact is considered as learning effect in scheduling literature. In this study, a bi-criteria m-identical parallel machines scheduling...
A DEA approach for comparing solution efficiency in U-line balancing problem using goal programming
, Article International Journal of Advanced Manufacturing Technology ; Volume 61, Issue 9-12 , August , 2012 , Pages 1161-1172 ; 02683768 (ISSN) ; Hassanzadeh, R ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
Springer
2012
Abstract
Line balancing problem plays an important role in the decision making process to increase efficiency and productivity. Recently, U-shaped layout in many production lines has replaced the traditional straight line layout using just-in-time concept. Here, we propose a model, using multi-objective decision making approach to the U-shaped line balancing problem, to offer enhanced decision maker flexibility, by allowing for conflicting goals. The assembly line operation efficiency is the most significant aim in our study, and this efficiency relates to management of resources and the solution of line balancing problem. First, the U-shaped line balancing problem is solved considering the model's...
A dynamic programming approach for finding shortest chains in a fuzzy network
, Article Applied Soft Computing Journal ; Volume 9, Issue 2 , 2009 , Pages 503-511 ; 15684946 (ISSN) ; Nourifar, R ; Heidarzade, A ; Mahdavi Amiri, N ; Sharif University of Technology
2009
Abstract
Graph theory has numerous applications to problems in systems analysis, operations research, transportation, and economics. In many cases, however, some aspects of a graph-theoretic problem may be uncertain. For example, the vehicle travel time or vehicle capacity on a road network may not be known exactly. In such cases, it is natural to make use of fuzzy set theory to deal with the uncertainty. Here, we are concerned with finding shortest chains in a graph with fuzzy distance for every edge. We propose a dynamic programming approach to solve the fuzzy shortest chain problem using a suitable ranking method. By using MATLAB, two illustrative examples are worked out to demonstrate the...
A two-phase linear programming methodology for fuzzy multi-objective mixed-model assembly line problem
, Article International Journal of Advanced Manufacturing Technology ; Volume 44, Issue 9-10 , 2009 , Pages 1010-1023 ; 02683768 (ISSN) ; Javadi, B ; Sahebjamnia, N ; Mahdavi Amiri, N ; Sharif University of Technology
2009
Abstract
We develop a fuzzy multi-objective linear programming (FMOLP) model for solving multi-objective mixed-model assembly line problem. In practice, vagueness and imprecision of the goals in this problem make the fuzzy decision-making complicated. The proposed model considers minimizing total utility work, total production rate variation, and total setup cost, using a two-phase linear programming approach. In the first phase, the problem is solved using a max-min approach. The max-min solution not being efficient, in general, we propose a new model in the second phase to maximize a composite satisfaction degree at least as good as the degrees obtained by phase one. To show the effectiveness of...
Reserve capacity of mixed urban road networks, network configuration and signal settings
, Article Intelligent Transportation and Planning: Breakthroughs in Research and Practice ; February , 2018 , Pages 883-906 ; 9781522552116 (EISBN) ; Hassanzadeh, R ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
IGI Global
2018
Abstract
The authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer bi-level mathematical problem, based on the concept of reserve capacity. The upper level goal is to maximize the reserve capacity by signal settings at intersections, determine street direction and increase street capacities via addition of lanes. The lower level problem is a deterministic user equilibrium traffic assignment problem to minimize the user travel time. The model being non-convex, meta-heuristic methods are used to solve the problem. A hybridization of genetic algorithm with simulated annealing and a bee algorithm are proposed. Numerical examples are illustrated to verify the...
Toward sustainable optimization with stackelberg game between green product family and downstream supply chain
, Article Sustainable Production and Consumption ; Volume 23 , 2020 , Pages 198-211 ; Shirazi, B ; Mahdavi, I ; Mahdavi Amiri, N ; Sharif University of Technology
Elsevier B.V
2020
Abstract
Green products are increasingly considered by companies, owing to the significant attention of government regulations, customers’ requests and competitors. Here, we deal with Green Product Families (GPFs) by selecting green components, modules and products which are produced based on the assembling to order (ATO) approach to cover diverse customer needs. Designing a GPFs is important but not sufficient for sustainable optimization. In fact, we need to simultaneously consider the supply chain of a GPF to control the pollution generated in the downstream supply chain. For a sustainable optimization approach, this joint configuration is usually structured based on economic, environmental and...
Heuristic Hybrid Genetic and Simulated Annealing Algorithms with Neural Networks for Task Assignment in Heterogeneous Computing Systems
, M.Sc. Thesis Sharif University of Technology ; Mahdavi Amiri, Nezamoddin (Supervisor)
Abstract
In this thesis, we want to present methods that are able to solve the assignment tasks problem in a heterogeneous computing system. These methods are two hybrid methods that are constructed by composing Hopefield Neural Networks with Genetic Algorithms and the Simulated Annealing. First, we solve the relaxed problem by applying Genetic Algorithms and the Simulated Annealing and we compare the results of these ways with other traditional methods. Then, we solve the constrained problem with mentioned hybrid methods. The definition of the problem is as following: Consider a distributed computing system which is comprised of set of processors with different speeds but the same structure. We want...