Loading...
Search for: alipour--kamran
0.098 seconds

    A local constant approximation factor algorithm for minimum dominating set of certain planar graphs

    , Article 32nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2020, 15 July 2020 through 17 July 2020 ; 2020 , Pages 501-502 Alipour, S ; Jafari, A
    Association for Computing Machinery  2020
    Abstract
    In this paper, we present a randomized LOCAL constant approximation factor algorithm for minimum dominating set (MDS) problem and minimum total dominating set (MTDS) problem in graphs. The approximation factor of this algorithm for planar graphs with no 4-cycles is 18 and 9 for MDS and MTDS problems, respectively. © 2020 Owner/Author  

    Dark silicon and the history of computing

    , Article Advances in Computers ; Volume 110 , 2018 , Pages 1-33 ; 00652458 (ISSN); 9780128153581 (ISBN) Lotfi Kamran, P ; Sarbazi Azad, H ; Sharif University of Technology
    Academic Press Inc  2018
    Abstract
    For many years, computer designers benefitted from Moore's law and Dennard scaling to significantly improve the speed of single-core processors. The failure of Dennard scaling pushed the computer industry toward homogenous multicore processors for the performance improvement to continue without significant increase in power consumption. Unfortunately, even homogeneous multicore processors cannot offer the level of energy efficiency required to operate all the cores at the same time in today's and especially tomorrow's technologies. As a result of lack of energy efficiency, not all the cores in a multicore processor can be functional at the same time. This phenomenon is referred to as dark... 

    Synthesis, and Characterization of Binuclear Platinum (IV)with Coinage Metals

    , M.Sc. Thesis Sharif University of Technology Abbasi Kamran, Ehsan (Author) ; Jamali, Sirous (Supervisor)
    Abstract
    In this research binuclear platinum(IV) complexes with coinage metals have been synthesized and characterized. the trimethyl platinum(IV) complex [PtMe3(phthalazine)3]+X- has been prepared by the reaction of [PtMe3(THF)]4 with 3 equiv. phthalazine and used as initial material. The first complex, [PtMe3(µ-(phthalazine)2Cl)PtMe3], synthesized via reaction of 2 equiv. [Pt(Me)3(Phthalazine)3] with 1 equiv. [AuClSMe2]. The second complex, [PtMe3(µ-phthalazine)3Ag][BF4], synthesized by reaction of one equiv. of each compound [Ag(CH3CN)4]BF4 and [Pt(Me)3(Phthalazine)3] And the third complex, [PtMe3(µ-phthalazine)3Cu][PF6], synthesized like second one via reaction of [Cu(CH3CN)4]PF6 and... 

    Temporal prefetching

    , Article Advances in Computers ; 2021 ; 00652458 (ISSN) Lotfi-Kamran, P ; Sarbazi Azad, H ; Sharif University of Technology
    Academic Press Inc  2021
    Abstract
    Many applications, including big-data server applications, frequently encounter data misses. Consequently, they lose significant performance potential. Fortunately, data accesses of many of these applications follow temporal correlations, which means data accesses repeat over time. Temporal correlations occur because applications usually consist of loops, and hence, the sequence of instructions that constitute the body of a loop repeats many times, leading to data access repetition. Temporal data prefetchers take advantage of temporal correlation to predict and prefetch future memory accesses. In this chapter, we introduce the concept of temporal prefetching and present two instances of... 

    Spatial prefetching

    , Article Advances in Computers ; 2021 ; 00652458 (ISSN) Lotfi Kamran, P ; Sarbazi Azad, H ; Sharif University of Technology
    Academic Press Inc  2021
    Abstract
    Many applications extensively use data objects with a regular and fixed layout, which leads to the recurrence of access patterns over memory regions. Spatial data prefetching techniques exploit this phenomenon to prefetch future memory references and hide their long latency. Spatial prefetchers are particularly of interest because they usually only need a small storage budget. In this chapter, we introduce the concept of spatial prefetching and present two instances of spatial data prefetchers, SMS and VLDP. © 2021 Elsevier Inc  

    Preface

    , Article Advances in Computers ; Volume 125 , 2022 , Pages ix-x ; 00652458 (ISSN); 9780323851190 (ISBN) Lotfi Kamran, P ; Sarbazi Azad, H ; Sharif University of Technology
    Academic Press Inc  2022

    Temporal prefetching

    , Article Advances in Computers ; Volume 125 , 2022 , Pages 31-41 ; 00652458 (ISSN); 9780323851190 (ISBN) Lotfi-Kamran, P ; Sarbazi Azad, H ; Sharif University of Technology
    Academic Press Inc  2022
    Abstract
    Many applications, including big-data server applications, frequently encounter data misses. Consequently, they lose significant performance potential. Fortunately, data accesses of many of these applications follow temporal correlations, which means data accesses repeat over time. Temporal correlations occur because applications usually consist of loops, and hence, the sequence of instructions that constitute the body of a loop repeats many times, leading to data access repetition. Temporal data prefetchers take advantage of temporal correlation to predict and prefetch future memory accesses. In this chapter, we introduce the concept of temporal prefetching and present two instances of... 

    Spatial prefetching

    , Article Advances in Computers ; Volume 125 , 2022 , Pages 19-29 ; 00652458 (ISSN); 9780323851190 (ISBN) Lotfi Kamran, P ; Sarbazi Azad, H ; Sharif University of Technology
    Academic Press Inc  2022
    Abstract
    Many applications extensively use data objects with a regular and fixed layout, which leads to the recurrence of access patterns over memory regions. Spatial data prefetching techniques exploit this phenomenon to prefetch future memory references and hide their long latency. Spatial prefetchers are particularly of interest because they usually only need a small storage budget. In this chapter, we introduce the concept of spatial prefetching and present two instances of spatial data prefetchers, SMS and VLDP. © 2022 Elsevier Inc  

    Planar Visibility Counting

    , M.Sc. Thesis Sharif University of Technology Alipour, Sharareh (Author) ; Zarei, Alireza (Supervisor)
    Abstract
    Planar visibility computing is defined as determining the region of the plane that is visible from a specific observer. This concept has many applications in computer graphics, robotic and computer games. In this thesis we consider two visibility problems: the visibility testing problem which checks the inter-visibility of two objects and the visibility counting problem which counts the number of visible objects from an observer. For these problems we propose new algorithms which have some improvements compare to the previous ones  

    Polyaniline Nanowire Networks as Sorbent for Microextraction in Packed Syringes

    , M.Sc. Thesis Sharif University of Technology Alipour, Noshin (Author) ; Bagheri, Habib (Supervisor)
    Abstract
    A simple, fast and sensitive method based on microextraction in packed syringe (MEPS), a new format of solid-phase extraction (SPE), as a sample preparation technique in off-line combination with gas chromatography-mass spectrometry (GC-MS) was developed. Polyaniline (PANI) nanowire network was synthesized and used as sorbent of MEPS for the multiresidue determination of selected analytes from triazine, organochlrorine and organophosphorous pesticides in aqueous samples. The PANI nanowires network was prepared using soft template technique and its characterization was studied by scanning electron microscopy (SEM). The use of micelles in this methodology has an important role in the shape of... 

    Visibility testing and counting

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 28 May 2011 through 31 May 2011, Jinhua ; Volume 6681 LNCS , 2011 , Pages 343-351 ; 03029743 (ISSN) ; 9783642212031 (ISBN) Alipour, S ; Zarei, A ; Sharif University of Technology
    2011
    Abstract
    For a set of n disjoint line segments S in R2, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from a query point p can be computed quickly. For this configuration, the visibility testing problem (VTP) is to test whether p sees a fixed segment s. These problems can be solved in logarithmic query time by using O(n4) preprocessing time and space. In this paper, we approximately solve this problem using quadratic preprocessing time and space. Our methods are superior to current approximation algorithms in terms of both approximation factor and preprocessing cost. In this paper, we propose a 2-approximation algorithm for the VCP using at... 

    Investigation of the Effect of Changing the Geometry of a Quad-Rotor to Increase its Maneuverability

    , M.Sc. Thesis Sharif University of Technology Alipour, Ensieh (Author) ;
    Abstract
    Design and development of Unmanned Aerial Vehicles (UAVs) has been a hot topic in the past decades. In particular, Vertical Take Off & Landing Vehicles (VTOLs) have been extensively studied and are under constant development. Quad rotors are one of the major subcategories of VTOLs and a lot of effort have been devoted to their control optimization. In the present study, we have utilized a novel transformer quad rotor structure that can change the angle between its arms. This structural change is a type of design feature modification that can effect the moments of inertia by changing the flight dynamics of quad rotor. Modification of height difference between adjacent rotors, while avoiding... 

    Efcient Algorithms for Visibility Testing of Objects and Counting

    , Ph.D. Dissertation Sharif University of Technology Alipour, Sharareh (Author) ; Ghodsi, Mohammad (Supervisor)
    Abstract
    Planar visibility computing is defned as determining the region of the plane that is visible from a specifc observer. This concept has many applications in computer graphics, robotic and computer games. In certain visibility problems, counting the number of visible objects in an appropriate time is required. For obtaining a solution fast, current algorithms give an approximated count. In this thesis, we consider visibility testing problem and visibility counting problem.For a given set S = fs1; s2; :::; sng of non-intersecting segments and a query point p in the plane, the visibility testing problem checks the inter-visibility of p and a segment si 2 S and the visibility counting problem... 

    Improvements on the k-center problem for uncertain data extended abstract

    , Article Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems ; 27 May , 2018 , Pages 425-433 ; 9781450347068 (ISBN) Alipour, S ; Jafari, A ; Sharif University of Technology
    Association for Computing Machinery  2018
    Abstract
    In real applications, there are situations where we need to model some problems based on uncertain data. This leads us to define an uncertain model for some classical geometric optimization problems and propose algorithms to solve them. The assigned version of the k-center problem for n uncertain points in a metric space is studied in this paper. The main approach is to replace each uncertain point with a clever choice of a certain point. We argue that the k-center solution for these certain replacements of our uncertain points, is a good constant approximation factor for the original uncertain k-center problem. This approach enables us to present fast and simple algorithms that give... 

    Processing Thin Magnesium Tubes by TCAP Process with Trapezoidal Geometry and Fabrication of Magnesium Microtubes with a Novel Method

    , M.Sc. Thesis Sharif University of Technology Kamran Masouleh, Mohsen (Author) ; Assempour, Ahmad (Supervisor)
    Abstract
    Due to compability of Magnesium with the body, it is a suitable material for making biodegradable stents, Althogh, its mechanical properties are not desirable for stent application. Accordingly, lately, magnesium’s microstructure and mechanical properties have been improved using various methods, including the process of severe plastic deformation (SPD). Many severe plastic deformation methods have been introduced for the fabrication of ultrafine grain tubes till now, which the process of tubular channel angular pressing (TCAP) is the most effective one. In the first part of the research, Magnesium tubes with a thickness of 1 mm were processed using the TCAP with a trapezoidal channel, and... 

    Evaluation of Aggregate Angularity Using Image Analysis

    , M.Sc. Thesis Sharif University of Technology Alipour, Aliyeh (Author) ; Tabatabaee, Nader (Supervisor)
    Abstract
    Form and angularity of aggregates are two important shape characteristics that have a significant effect on the performance of hot-mix asphalt. The first step toward the study of the effect of these characteristics on pavement performance is their proper measurement. Current test methods used in practice have several limitations in measuring these characteristics. In this thesis, a method based on image processing called “Sharif Aggregate Imaging System (SHAMS)” has been introduced which is capable of directly measuring aggregate dimensions and determining angularity index for aggregates classification. Calculated results related to the form and angularity of aggregates measured by SHAMS... 

    The Effects of Electronic Flashcards on Productive Vocabulary Knowledge and Learners’ Attitude toward CALL among Iranian EAP Students

    , M.Sc. Thesis Sharif University of Technology Alipour, Mohsen (Author) ; Alemi, Minoo (Supervisor)
    Abstract
    Vocabulary knowledge is one of the main building blocks in the process of learning a new language and presents many challenges to language learners. Using computer software and online programs is suggested as possible approaches for overcoming some of these challenges. In the present study, the researcher attempted to study the effect of creating and sharing different sets of online flash cards on the use of vocabulary items among Iranian English for Academic Purposes (EAP) students. Thirty-nine university students in two groups participated in this study (29 males, 10 females). One group were instructed to create online flash cards containing the definitions of words and their synonyms and... 

    An efficient data collection approach for wireless sensor networks

    , Article World Academy of Science, Engineering and Technology ; Volume 5, Issue8 , 2011 , Pages 1619-1622 ; 2010376X (ISSN) Alipour, H ; Pour, A. N ; Sharif University of Technology
    2011
    Abstract
    One of the most important applications of wireless sensor networks is data collection. This paper proposes as efficient approach for data collection in wireless sensor networks by introducing Member Forward List. This list includes the nodes with highest priority for forwarding the data. When a node fails or dies, this list is used to select the next node with higher priority. The benefit of this node is that it prevents the algorithm from repeating when a node fails or dies. The results show that Member Forward List decreases power consumption and latency in wireless sensor networks  

    Extended convexity of quantum Fisher information in quantum metrology

    , Article Physical Review A - Atomic, Molecular, and Optical Physics ; Volume 91, Issue 4 , April , 2015 ; 10502947 (ISSN) Alipour, S ; Rezakhani, A. T ; Sharif University of Technology
    American Physical Society  2015
    Abstract
    We prove an extended convexity for quantum Fisher information of a mixed state with a given convex decomposition. This convexity introduces a bound which has two parts: (i) The classical part associated with the Fisher information of the probability distribution of the states contributing to the decomposition, and (ii) the quantum part given by the average quantum Fisher information of the states in this decomposition. Next we use a non-Hermitian extension of a symmetric logarithmic derivative in order to obtain another upper bound on quantum Fisher information, which helps to derive a closed form for the bound in evolutions having the semigroup property. We enhance the extended convexity... 

    Online visual gyroscope for autonomous cars

    , Article 24th Iranian Conference on Electrical Engineering, ICEE 2016, 10 May 2016 through 12 May 2016 ; 2016 , Pages 113-118 ; 9781467387897 (ISBN) Kamran, D ; Karimian, M ; Nazemipour, A ; Manzuri, M.T ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2016
    Abstract
    Knowing the exact position and rotation is a crucial necessity for the navigation of autonomous robots. Even in outdoor environments GPS signals are not always accessible for estimating online rotation and position of robots. Also inertial aided navigation methods have their own defects such as the drift of gyroscope or inaccuracy of accelerometer in agile motions and environmental sensitivity of compass. In this article, we have introduced a novel online visual gyroscope that can estimate the rotation of a moving car with analyzing the images of a monocular camera installed on it. Our real time visual gyroscope utilizes an efficient method of rotation estimation between each pair of camera...