Loading...
Search for:
nouri--m
0.13 seconds
Total 20552 records
Scheduling tasks with exponential duration on unrelated parallel machines
, Article Discrete Applied Mathematics ; Volume 160, Issue 16-17 , November , 2012 , Pages 2462-2473 ; 0166218X (ISSN) ; Ghodsi, M ; Sharif University of Technology
2012
Abstract
This paper introduces a stochastic scheduling problem. In this problem a directed acyclic graphs (DAG) represents the precedence relations among m tasks that n workers are scheduled to execute. The question is to find a schedule Σ such that if tasks are assigned to workers according to Σ, the expected time needed to execute all the tasks is minimized. The time needed to execute task t by worker w is a random variable expressed by a negative exponential distribution with parameter λ wt and each task can be executed by more than one worker at a time. In this paper, we will prove that the problem in its general form is NP-hard, but when the DAG width is constant, we will show that the optimum...
Space-query-time tradeoff for computing the visibility polygon
, Article 3rd International Frontiers of Algorithmics Workshop, FAW 2009, Hefei, 20 June 2009 through 23 June 2009 ; Volume 5598 LNCS , 2009 , Pages 120-131 ; 03029743 (ISSN); 3642022693 (ISBN); 9783642022692 (ISBN) ; Ghodsi, M ; Sharif University of Technology
2009
Abstract
Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of computing VP for any query point efficiently, with some additional preprocessing phase. The scene consists of a set of obstacles, of total complexity O(n). We show for a query point q, VP(q) can be computed in logarithmic time using O(n 4) space and O(n 4 logn) preprocessing time. Furthermore to decrease space usage and preprocessing time, we make a tradeoff between space usage and query time; so by spending O(m) space, we can achieve O(n 2 log √ m/n)/√ m)query time, where n 2≤m≤n 4. These results are also applied to...
Microstructural investigation of the coatings prepared by simultaneous aluminizing and siliconizing process on γ-TiAl
, Article Journal of Mining and Metallurgy, Section B: Metallurgy ; Volume 55, Issue 2 , 2019 , Pages 217-225 ; 14505339 (ISSN) ; Azadeh, M ; Sharif University of Technology
Technical Faculty in Bor
2019
Abstract
In this research, formation of aluminide/silicide diffusion coatings on γ -TiAl[Ti-48Al-2Nb-2Cr (at.%)] alloy using gasphase diffusion pack cementation process has been investigated. The application of powder mixtures with various chemical compositions in the pack cementation process performed at 1000°C for 6 hours in order to achieve simultaneous diffusion of Al and Si, showed that the composition of the powder mixture could have a significant effect on the structure and thickness of the aluminide/silicide coatings. The identification and analysis of aluminide/silicide microstructures formed as a result of simultaneous diffusion of Al and Si, which was comprehensively and qualitatively done...
Space/query-time tradeoff for computing the visibility polygon
, Article Computational Geometry: Theory and Applications ; Volume 46, Issue 3 , April , 2013 , Pages 371-381 ; 09257721 (ISSN) ; Ghodsi, M ; Sharif University of Technology
2013
Abstract
In this paper, we consider the problem of computing the visibility polygon (VP) of a query point q (or VP(q)) in a scene consisting of some obstacles with total complexity of n. We show that the combinatorial representation of VP(q) can be computed in logarithmic time by preprocessing the scene in O( n4logn) time and using O( n4) space. We can also report the actual VP(q) in additional O(|VP(q)|) time. As a main result of this paper, we will prove that we can have a tradeoff between the query time and the preprocessing time/space. In other words, we will show that using O(m) space, we can obtain O( n2log(m/n)/m) query time, where m is a parameter satisfying n2≤m≤ n4. For example, when m= n3,...
Near optimal line segment queries in simple polygons
, Article Journal of Discrete Algorithms ; Volume 35 , November , 2015 , Pages 51-61 ; 15708667 (ISSN) ; Ghodsi, M ; Sharif University of Technology
Elsevier
2015
Abstract
This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm that preprocesses P and creates a data structure from which WVP(pq) is efficiently reported in an output sensitive manner. Our algorithm needs O(n2log n) time and O(n2) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(|WVP(pq)|+log2 n+κlog2 (nκ)), where κ is an input and output sensitive parameter of at most |WVP(pq)|. We improve the preprocessing time and space of current results for this problem [11,6] at the expense of more query time
Visibility of a moving segment observer
, Article 2009 14th International CSI Computer Conference, CSICC 2009, 20 October 2009 through 21 October 2009 ; 2009 , Pages 152-157 ; 9781424442621 (ISBN) ; Ghodsi, M ; Sharif University of Technology
2009
Abstract
In this paper we study combinatorial segment visibility, and show how to compute and maintain it as the observer moves in the plane. There are n non-overlapping convex objects in the plane, and we have a segment observer among them. We first consider static case of the problem, in which the observer and objects are static, and then we study dynamic case of the problem, in which the observer can move among obstacles. ©2009 IEEE
Visibility of a moving segment
, Article Proceedings of the 2009 International Conference on Computational Science and Its Applications, ICCSA 2009, 29 June 2009 through 2 July 2009, Yongin ; 2009 , Pages 169-176 ; 9780769537016 (ISBN) ; Ghodsi, M ; Sharif University of Technology
2009
Abstract
In this paper we define topological segment visibility, and show how to compute and maintain it as the observer moves in the plane. There are n non-intersecting line segment objects in the plane, and we have a segment observer among them. As the topological visibility of a line segment has not been studied before, we first consider static case of the problem, in which the observer and objects are static, and then we study dynamic case of the problem, in which the observer can move among obstacles
Weak visibility queries of line segments in simple polygons and polygonal domains
, Article International Journal of Computer Mathematics ; Volume 95, Issue 4 , 2018 , Pages 721-738 ; 00207160 (ISSN) ; Ghodsi, M ; Sharif University of Technology
Taylor and Francis Ltd
2018
Abstract
In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or WVP(pq)) inside a given polygon P. Our first algorithm runs in simple polygons and needs O(n3 log n) time and O(n3) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|).. We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with h ≥ 1 pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs O(n2 log n) time and O(n2) space in the preprocessing phase and WVP(pq) in query time of O(nh’ log n + k), in which h’ is an output sensitive parameter...
Weak visibility queries of line segments in simple polygons and polygonal domains
, Article International Journal of Computer Mathematics ; 2017 , Pages 1-18 ; 00207160 (ISSN) ; Ghodsi, M ; Sharif University of Technology
Taylor and Francis Ltd
2017
Abstract
In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or (Formula presented.)) inside a given polygon (Formula presented.). Our first algorithm runs in simple polygons and needs (Formula presented.) time and (Formula presented.) space in the preprocessing phase to report (Formula presented.) of any query line segment pq in time (Formula presented.). We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with (Formula presented.) pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs (Formula presented.) time and (Formula presented.) space in the...
Cultural conflict in technology transfer to non-industrial communities: A critique of ihde's ideas
, Article IEEE Technology and Society Magazine ; Volume 39, Issue 4 , 2020 , Pages 71-81 ; Taqavi, M ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2020
Abstract
Societies today have come closer together as a result of the development of communication technologies and the greater ease with which business is transacted. Consequently, technological tools and devices are being transferred from industrial societies to other countries at dazzling speeds the transfer of technology to non-industrialized societies with their own histories, civilizations, and backgrounds has led to the emergence of cultural issues and conflicts that are specific to the modern period and that had not existed prior to this period. In this article, we have reviewed the ideas of Don Ihde, a leading contemporary philosopher who has done much work in the field of the philosophy of...
Polar diagram of moving objects
, Article 20th Annual Canadian Conference on Computational Geometry, CCCG 2008, Montreal, QC, 13 August 2008 through 15 August 2008 ; August , 2008 , Pages 51-54 ; Ghodsi, M ; Sharif University of Technology
2008
Abstract
Many important problems in Computational Geometry needs to perform some kind of angle processing. The Polar Diagram [4] is a locus approach for problems processing angles. Using this structure as preprocessing, one can eliminate exhaustive searches to find objects with smallest angle. Handling data in change is a significant concept in Computer Science. One of the design and analysis tools used in the modeling of moving geometric objects is the kinetic data structure (or KDS) framework Kinetic Data Structure is a framework for maintaining a certain attribute of a set of objects while moving in a continuous manner. In this paper, we use the notion of kinetic data structure to model the...
Liquid flow analysis in concentric annular heat pipes wicks
, Article Journal of Porous Media ; Volume 8, Issue 5 , 2005 , Pages 471-480 ; 1091028X (ISSN) ; Layeghi, M ; Sharif University of Technology
2005
Abstract
In this paper, two models are developed to predict liquid pressure drop and velocity profile in the wicks of concentric annular heat pipes. A steady-state incompressible laminar flow is modeled in the wicks based on velocity and pressure mean values by the extended Darcy-Brinkman model. The corresponding one- and two-dimensional governing equations are solved analytically and numerically, respectively, in the range of low to moderate radial Reynolds numbers. It has been found that there is a difference, about 12% in the worse case, between the total pressure drops of the two models. Whereas, the predicted total pressure drop by the one-dimensional model and that of the Darcy model are in...
Heat transfer and fluid flow in porous media with two equations Non-Darcian model
, Article 2005 ASME Fluids Engineering Division Summer Meeting, FEDSM2005, Houston, TX, 19 June 2005 through 23 June 2005 ; Volume 2005 , 2005 , Pages 1943-1946 ; 0791837602 (ISBN); 9780791837603 (ISBN) ; Nazari, M ; Sharif University of Technology
2005
Abstract
In the present study criterion for local thermal equilibrium assumption is studied. It concerns with the fluid flow and heat transfer between two parallel plates filled with a saturated porous medium under non-equilibrium condition. A two-equation model is utilized to represent the fluid and solid energy transport. Numerical Finite Volume Method has been developed for solving coupled energy equations and the Non-Darcian effects are considered for description of momentum equation. The effects of suitable non dimensional parameters as Peclet number and conductivity ratio has been studied thoroughly. A suitable non dimensional equation proposed in wide range of Peclet number and conductivity...
Heat transfer and fluid flow in porous media with two equations Non-Darcian model
, Article 2005 ASME Fluids Engineering Division Summer Conference, Houston, TX, 19 June 2005 through 23 June 2005 ; Volume 2 , 2005 , Pages 637-640 ; 0791841987 (ISBN); 9780791841983 (ISBN) ; Nazari, M ; Sharif University of Technology
2005
Abstract
In the present study criterion for local thermal equilibrium assumption is studied. It concerns with the fluid flow and heat transfer between two parallel plates filled with a saturated porous medium under non-equilibrium condition. A two-equation model is utilized to represent the fluid and solid energy transport. Numerical Finite Volume Method has been developed for solving coupled energy equations and the Non-Darcian effects are considered for description of momentum equation. The effects of suitable non dimensional parameters as Peclet number and conductivity ratio has been studied thoroughly. A suitable non dimensional equation proposed in wide range of Peclet number and conductivity...
A review of concentric annular heat pipes
, Article Heat Transfer Engineering ; Volume 26, Issue 6 , 2005 , Pages 45-58 ; 01457632 (ISSN) ; Layeghi, M ; Sharif University of Technology
2005
Abstract
A detailed description of a concentric annular heat pipe (CAHP) operation is presented in low to moderate temperature ranges (50-200°C). The steady-state response of a CAHP to various heat fluxes in the evaporator and condenser sections are discussed. Two-dimensional mathematical modeling of the fluid flow and heat transfer in the annular vapor space and the wicks are described. The fundamental aspects and limitations of the operation of a CAHP are also discussed. Previously used numerical and experimental approaches for the analysis of the CAHPs and some related concepts are reviewed. The Navier-Stokes and similar equations are recommended for the simulation of fluid flow and heat transfer...
A numerical analysis of vapor flow in concentric annular heat pipes
, Article Journal of Fluids Engineering, Transactions of the ASME ; Volume 126, Issue 3 , 2004 , Pages 442-448 ; 00982202 (ISSN) ; Layeghi, M ; Sharif University of Technology
2004
Abstract
A numerical method based on the SIMPLE algorithm has been developed for the analysis of vapor flow in a concentric annular heat pipe. The steady-state response of a concentric annular heat pipe to various heat fluxes in the evaporator and condenser sections are studied. The fluid flow and heat transfer in the annular vapor space are simulated using Navier-Stokes equations. The governing equations are solved numerically, using finite volume approach. The vapor pressure and temperature distributions along a concentric annular heat pipe are predicted for a number of symmetric test cases. The vapor flow reversal and transition to turbulence phenomena are also predicted. The results are compared...
Is it possible to create a new indigenous technology from an imported technology?: making an indigenous technology; the duty of indigenous engineers
, Article World Futures ; Volume 79, Issue 6 , 2023 , Pages 647-668 ; 02604027 (ISSN) ; Taqavi, M ; Sharif University of Technology
Routledge
2023
Abstract
The transfer of technical artifacts from industrialized countries to other parts of the world is nowadays a common and everyday occurrence. But the differences in the cultural backgrounds of societies, and the cultural and social consequences of technological incursion on destination societies have led to conflicts and dichotomies that have sometimes destroyed the cultural infrastructure of these destination societies. Therefore, making changes to imported technologies and the possibility of developing technology based on the needs of the native culture have been indispensable necessities for destination communities. In this article, we explore the possibilities surrounding this issue and...
A modified low rank learning based on iterative nuclear weighting in ripplet transform for denoising MR images
, Article 29th Iranian Conference on Electrical Engineering, ICEE 2021, 18 May 2021 through 20 May 2021 ; 2021 , Pages 912-916 ; 9781665433655 (ISBN) ; Nejati Jahromi, M ; Nouri, M ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2021
Abstract
In recent studies, several methods have been suggested to decrease noise of magnetic resonance image (MRI) in order to raise the peak signal-to-noise ratio (PSNR) and the structural similarity index (SSIM). In this paper, we propose a novel method based on a minimization problem in Ripplet domain that uses singular value decomposition (SVD) in low rank learning to eliminate the noise of MRI images. We reschedule the weighted nuclear norm minimization (WNNM) problem in any edges of Ripplet domain transform and using an adaptive weighting structure to denoise the patches of Ripplet component matrix. The parameters of the proposed method are divided into two groups, some of them are calculated...
A study on the kinetic of the electrodeposited Co-Ni alloy thin films in sulfate solution
, Article Materials Chemistry and Physics ; Volume 102, Issue 2-3 , 2007 , Pages 118-124 ; 02540584 (ISSN) ; Sababi, M ; Nouri, E ; Ghorbani, M ; Sharif University of Technology
2007
Abstract
The electrodeposition of cobalt, nickel and Ni-Co alloys was studied by electrochemical techniques. Cyclic voltammetry and current transient measurements were used to characterize the Co-Ni system in other to obtain the nucleation and growth mechanism. The cyclic voltammetry results clearly showed that electrodeposition of cobalt, nickel and Co-Ni alloy is diffusion-controlled process with a typical nucleation mechanism. The redox potentials of the Co and Ni are shifted to more cathodic potentials in the Co-Ni alloy system. In addition, the current transients revealed that nucleation mechanism is instantaneous with a typical three-dimensional (3D) nucleation and growth process. The number of...
Improving data protection in BSS based secure communication: mixing matrix design
, Article Wireless Networks ; Volume 27, Issue 7 , 2021 , Pages 4747-4758 ; 10220038 (ISSN) ; Shamsollahi, M. B ; Nouri, A ; Sharif University of Technology
Springer
2021
Abstract
Abstract: In this paper, a secure and efficient Blind Source Separation (BSS) based cryptosystem is presented. The use of BSS in audio and image cryptography in wireless networks has attracted more attention. A BSS based cryptosystem consists of three main parts: secret data, secret keys, and mixing matrix. In this paper, we propose a new design to create a proper mixing matrix in BSS based cryptosystem. We offer a mathematical criterion to select mixing matrix elements before encryption. The proposed criterion gives a simple way to attach the secret sources to keys, which makes source separation very hard for the adversary. Versus, we show that using the random mixing matrix can lead to...